Complete axiomatizations of finite syntactic epistemic states

被引:0
|
作者
Ågotnes, T [1 ]
Walicki, M [1 ]
机构
[1] Univ Bergen, Dept Informat, N-5020 Bergen, Norway
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this set cannot in general be assumed - reasoning takes time and real agents frequently have contradictory beliefs. This paper discusses a formal model of knowledge as explicitly computed sets of formulae. It is assumed that agents represent their knowledge syntactically, and that they can only know finitely many formulae at a given time. In order to express interesting properties of such finite syntactic epistemic states, we extend the standard epistemic language with an operator expressing that an agent knows at most a particular finite set of formulae, and investigate axiomatization of the resulting logic. This syntactic operator has also been studied elsewhere without the assumption about finite epistemic states [5]. A strongly complete logic is impossible, and the main results are non-trivial characterizations of the theories for which we can get completeness. The paper presents a part of a general abstract theory of resource bounded agents. Interesting results, e.g., complex algebraic conditions for completeness, are obtained from very simple assumptions, i.e., epistemic states as arbitrary finite sets and operators for knowing at least and at most.
引用
收藏
页码:33 / 50
页数:18
相关论文
共 50 条
  • [1] Strongly complete axiomatizations of "knowing at most" in syntactic structures
    Agotnes, Thomas
    Walicki, Michal
    [J]. COMPUTATIONAL LOGIC IN MULTI-AGENT SYSTEMS, 2006, 3900 : 57 - 76
  • [2] A Syntactic Approach to Revising Epistemic States with Uncertain Inputs
    Bauters, Kim
    Liu, Weiru
    Hong, Jun
    Godo, Lluis
    Sierra, Carles
    [J]. 2014 IEEE 26TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI), 2014, : 154 - 161
  • [3] COMPLETE AXIOMATIZATIONS OF FRAGMENTS OF MONADIC SECOND-ORDER LOGIC ON FINITE TREES
    Gheerbrant, Amelie
    ten Cate, Balder
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2012, 8 (04)
  • [4] Complete Axiomatizations for Quantum Actions
    A. Baltag
    S. Smets
    [J]. International Journal of Theoretical Physics, 2005, 44 : 2267 - 2282
  • [5] Complete axiomatizations for XPath fragments
    ten Cate, Balder
    Litak, Tadeusz
    Marx, Maarten
    [J]. JOURNAL OF APPLIED LOGIC, 2010, 8 (02) : 153 - 172
  • [6] Complete axiomatizations for quantum actions
    Baltag, A.
    Smets, S.
    [J]. INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2005, 44 (12) : 2267 - 2282
  • [7] Towards Syntactic Epistemic Logic
    Artemov, Sergei
    [J]. FUNDAMENTA INFORMATICAE, 2022, 186 (1-4) : 45 - 62
  • [8] Complete axiomatizations for reasoning about knowledge and time
    Halpern, JY
    Van der Meyden, R
    Vardi, MY
    [J]. SIAM JOURNAL ON COMPUTING, 2004, 33 (03) : 674 - 703
  • [9] COMPLETE AXIOMATIZATIONS OF SOME QUOTIENT TERM ALGEBRAS
    COMON, H
    [J]. THEORETICAL COMPUTER SCIENCE, 1993, 118 (02) : 167 - 191
  • [10] Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
    Bonsangue, Marcello M.
    Milius, Stefan
    Silva, Alexandra
    [J]. ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2013, 14 (01)