Reasoning about knowledge
Actions and resources in epistemic logic
Actions and resources in epistemic logic
Coalgebraic epistemic update without change of model
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information
Electronic Notes in Theoretical Computer Science (ENTCS)
Using the perseus system for modelling epistemic interactions
Transactions on computational collective intelligence V
Interpreted systems semantics for process algebra with identity annotations
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
| Hi-index | 0.00 |
We present an algorithm for proving epistemic properties of dynamic scenarios in multi-agent systems and an implementation of it as the C^+^+ program Aximo. The program consists of a rewrite system and a recursive reasoner, and we prove that its decision procedure is sound with regard to the algebraic axiomatics of dynamic epistemic logic. We study the termination and complexity of the program and show its applicability, by proving properties of honest and also newer dishonest versions of the the muddy children puzzle as well as a coin toss scenario.