Australian Joint Conference on Artificial Intelligence

AI 2002: AI 2002: Advances in Artificial Intelligence pp 723-723

A Defeasible Logic of Policy-Based Intention (Extended Abstract)

  • Guido Governatori
  • Vineet Padmanabhan
  • Abdul Sattar
Conference paper

DOI: 10.1007/3-540-36187-1_71

Volume 2557 of the book series Lecture Notes in Computer Science (LNCS)
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

Abstract

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Guido Governatori
    • 2
  • Vineet Padmanabhan
    • 1
  • Abdul Sattar
    • 1
  1. 1.Knowledge Representation & Reasoning Unit (KRRU)School of Information Technology Griffth UniversityQueenslandAustralia
  2. 2.School of Information Technology and Electronic EngineeringThe University of QueenslandQueenslandAustralia