A Defeasible Logic of Policy-Based Intention

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.

• Type: Conference
• Year: 2003
• Where: AUSAI
• Authors: Guido Governatori, Vineet Padmanabhan
• Keywords: Artificial Intelligence, AUSAI 2003, Defeasible Logic, Exhibit Non-monotonic Behaviour, Unary Modal Operator