Paper Info
Title
'Knowing Whether' in Proper Epistemic Knowledge Bases.
Abstract
Proper epistemic knowledge bases (PEKBs) are syntactic knowledge bases that use multi-agent epistemic logic to represent nested multi-agent knowledge and belief. PEKBs have certain syntactic restrictions that lead to desirable computational properties; primarily, a PEKB is a conjunction of modal literals, and therefore contains no disjunction. Sound entailment can be checked in polynomial time, and is complete for a large set of arbitrary formulae in logics K-n and KDn. In this paper, we extend PEKBs to deal with a restricted form of disjunction: 'knowing whether'. An agent i knows whether phi iff agent i knows phi or knows (sic)phi; that is, square i phi V square i(sic)phi. In our experience, the ability to represent that an agent knows whether something holds is useful in many multi-agent domains. We represent knowing whether with a modal operator, Delta(i), and present sound polynomial-time entailment algorithms on PEKBs with Delta(i) in K-n and KDn, but which are complete for a smaller class of queries than standard PEKBs.
Year
Venue
Field
2016
THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE
Epistemic modal logic,Logical consequence,Computer science,Modal operator,Multi-agent system,Artificial intelligence,Time complexity,Epistemology,Syntax,Modal
DocType
Citations 
PageRank 
Conference
2
0.38
References 
Authors
14
5
Name
Order
Citations
PageRank
Tim Miller119616.45
Paolo Felli2285.27
Christian J. Muise317622.68
Adrian R. Pearce430131.88
Liz Sonenberg5802119.89