A defeasible logic of policy-based intention

12Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Most of the theories on formalising intention interpret it as a unary modal operator in Kripkean semantics, which gives it a monotonic look. We argue that policy-based intentions [8] exhibit non-monotonic behaviour which could be captured through a non-monotonic system like defeasible logic. To this end we outline a defeasible logic of intention. The proposed technique alleviates most of the problems related to logical omniscience. The proof theory given shows how our approach helps in the maintenance of intention-consistency in agent systems like BDI.

Cite

CITATION STYLE

APA

Governatori, G., & Padmanabhan, V. (2003). A defeasible logic of policy-based intention. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2903, pp. 414–426). Springer Verlag. https://doi.org/10.1007/978-3-540-24581-0_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free