Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
Information and Computation - Semantics of Data Types
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Reasoning about knowledge
Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
A Deduction Model of Belief
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Artificial Believers: The Ascription of Belief
Artificial Believers: The Ascription of Belief
Effective Theorem Proving for Hardware Verification
TPCD '94 Proceedings of the Second International Conference on Theorem Provers in Circuit Design - Theory, Practice and Experience
Combining superposition, sorts and splitting
Handbook of automated reasoning
Denotational proof languages
On evaluating decision procedures for modal logic
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Toward a General Logicist Methodology for Engineering Ethically Correct Robots
IEEE Intelligent Systems
Toward Formalizing Common-Sense Psychology: An Analysis of the False-Belief Task
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
A verification framework for agent knowledge
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Hi-index | 0.00 |
We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then use Athena as a metalanguage in order to reason about the multi-agent logic an as object language. This facilitates theorem proving in the multi-agent logic in several ways. First, it lets us marshal the highly efficient theorem provers for classical first-order logic that are integrated with Athena for the purpose of doing proofs in the multi-agent logic. Second, unlike model-theoretic embeddings of modal logics into classical first-order logic, our proofs are directly convertible into native epistemic logic proofs. Third, because we are able to quantify over propositions and agents, we get much of the generality and power of higher-order logic even though we are in a firstorder setting. Finally, we are able to use Athena's versatile tactics for proof automation in the multi-agent logic. We illustrate by developing a tactic for solving the generalized version of the wise men problem.