A Defeasible Logic of Policy-Based Intention (Extended Abstract)
- First Online:
- Cite this paper as:
- Governatori G., Padmanabhan V., Sattar A. (2002) A Defeasible Logic of Policy-Based Intention (Extended Abstract). In: McKay B., Slaney J. (eds) AI 2002: Advances in Artificial Intelligence. AI 2002. Lecture Notes in Computer Science, vol 2557. Springer, Berlin, Heidelberg
Most of the theories on formalising intention interpret it as a unary modal operator in Kripkean semantics, which gives it a monotonic look. Moreo ver they model such an operator as a normal modal operator (i.e., it admits the necessitation rule: ⊢ A/ ⊢ □A).This means that such intention formalisations are affected by the logical omniscience problem, which requires an agent to intend all consequences of a given intention.Logical omniscience is a well-known problem with many facets, one of them being that the epistemic state of an agent must be closed under logical theories in the classical sense.That is, it contains an infinite set of formulas, which implies that the agent must have infinite computational power.