论文信息 - Aximo: Automated Axiomatic Reasoning for Information Update

Aximo: Automated Axiomatic Reasoning for Information Update

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.

Simon Richards | Mehrnoosh Sadrzadeh

[1] Alan Bundy,et al. Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[2] Ronald Fagin,et al. Reasoning about knowledge , 1995 .

[3] Mehrnoosh Sadrzadeh,et al. Epistemic Actions as Resources , 2007, J. Log. Comput..

[4] Michael Wooldridge,et al. Time, Knowledge, and Cooperation: Alternating-Time Temporal Epistemic Logic and Its Applications , 2002, KI.

[5] Michael Wooldridge,et al. Time, Knowledge, and Cooperation: Alternating-Time Temporal Epistemic Logic and Its Applications , 2002, COORDINATION.

[6] Lawrence S. Moss,et al. Logics for Epistemic Programs , 2004, Synthese.

[7] Corina Cîrstea,et al. Coalgebraic Epistemic Update Without Change of Model , 2007, CALCO.

[8] M. Sadrzadeh. Actions and resources in epistemic logic , 2006 .