A Defeasible Logic of Policy-based Intention
MetadataShow full item record
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 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.
Australian Joint Conference on artificial Intelligence 2002
© 2002 Springer Berlin/Heidelberg. This is an electronic version of an article published in Lecture Notes in Computer Science, volume 2903, pp 414-426. Lecture Notes in Computer Science is available online at: http://link.springer.com/ with the open URL of your article.