Information and Computation - Semantics of Data Types
Reasoning about knowledge
Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
Model checking multi-agent systems with MABLE
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
The logic of public announcements, common knowledge, and private suspicions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Verifying epistemic properties of multi-agent systems via bounded model checking
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Dynamic epistemic logic with assignment
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Complexity and succinctness of public announcement logic
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Dynamic Epistemic Logic
Metareasoning for multi-agent epistemic logics
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
| Hi-index | 0.00 |
One of the challenges for designing multi-agent systems is how to capture and reason about agent knowledge and knowledge evolution in a highly abstract and modular way. Hence it is very desirable to have a generic framework in which such systems can be conveniently specified and the properties verified under one umbrella. As a classical reasoning support, the model checking technique has proved to be applicable for systems of reasonable size. However current model checkers for epistemic logics suffer from the state explosion problem and their inability to handle infinite state problems. Prototype Verification System (PVS) is an environment for the development of formal specifications. It integrates a highly expressive specification language and a well supported theorem prover. In this paper, we demonstrate our attempt towards mechanizing epistemic logic reasoning by building a formal, sound and complete verification framework in PVS for reasoning about a spectrum of (dynamic) epistemic logics.