Name
Abstract | ||
|---|---|---|
Reasoning about the nested beliefs or knowledge of other agents is essential for many collaborative and competitive tasks. However, reasoning with nested belief (for example through epistemic logics) is computationally expensive. Proper Epistemic Knowledge Bases (PEKBs) address this by enforcing syntactic restrictions on the knowledge base. By compiling a PEKB and query formula into a specific normal form, entailment can be checked in polynomial time, which is sound and complete for the epistemic logic Kn. The downside is that the complexity of compiling into the normal form is exponential in time and space. In this work, we extend PEKBs to handle belief in the logic of KDn. We show that this simplifies the complexity of the required reasoning, and importantly, achieves polynomial entailment checking without first having to compile the PEKB into a normal form. Also, we present an alternative approach that calculates the closure of a PEKB, which is exponential in the maximum depth of nested belief, but for which entailment checking is constant on average. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.5555/2772879.2773339 | Autonomous Agents and Multi-Agent Systems |
Field | DocType | Citations |
Epistemic modal logic,Logical consequence,Polynomial,Computer science,Multi-agent system,A-normal form,Knowledge base,Epistemology,Time complexity,Syntax | Conference | 4 |
PageRank | References | Authors |
0.45 | 9 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christian J. Muise | 1 | 176 | 22.68 |
| Tim Miller | 2 | 8 | 1.95 |
| Paolo Felli | 3 | 4 | 2.81 |
| Adrian R. Pearce | 4 | 8 | 1.63 |
| Liz Sonenberg | 5 | 802 | 119.89 |