Quantified Epistemic Logics with Flexible Terms

We present a family of quantified epistemic logics for reasoning about knowledge in multi-agent systems. The language enjoys flexible terms with different denotations depending on the epistemic context in which they are interpreted. We present syntax and semantics of the language formally and show completeness of an axiomatisation. We discuss the expressive features of the language by means of an example.

[1]  Ron van der Meyden,et al.  MCK: Model Checking the Logic of Knowledge , 2004, CAV.

[2]  Mark Ryan,et al.  On the Relation between Interpreted Systems and Kripke Models , 1997, Agents and Multi-Agent Systems Formalisms, Methodologies, and Applications.

[3]  Frank Wolter,et al.  Decidable fragments of first-order modal logics , 2001, Journal of Symbolic Logic.

[4]  Ramaswamy Ramanujam,et al.  Distributed Processes and the Logic of Knowledge , 1985, Logic of Programs.

[5]  Ronald Fagin,et al.  Modelling Knowledge and Action in Distributed Systems , 1988, Concurrency.

[6]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[7]  Torben Braüner,et al.  First-order modal logic , 2007, Handbook of Modal Logic.

[8]  W. van der Hoek,et al.  Epistemic logic for AI and computer science , 1995, Cambridge tracts in theoretical computer science.

[9]  James W. Garson,et al.  Quantification in Modal Logic , 1984 .

[10]  A. Szałas.  Concerning the Semantic Consequence Relation in First-Order Temporal Logic , 1986, Theoretical Computer Science.

[11]  Wojciech Penczek,et al.  Verifying epistemic properties of multi-agent systems via bounded model checking , 2002, AAMAS '03.

[12]  Alessio Lomuscio,et al.  Deontic Interpreted Systems , 2003, Stud Logica.

[13]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[14]  Frank Wolter,et al.  Decidable fragment of first-order temporal logics , 2000, Ann. Pure Appl. Log..

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