login

A Defeasible Logic of Policy-Based Intention

Lecture notes in computer sciencePublished 1 January 2003Open access
Guido Governatori, Vineet Padmanabhan
Citations19
View PDF

TL;DR

A defeasible logic of intention is outlined that alleviates most of the problems related to logical omniscience and helps in the maintenance of intention-consistency in agent systems like BDI.

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 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.

Keywords

Computer Science