Interactions between Time and Knowledge in a First-order Logic for Multi-Agent Systems

We investigate a class of first-order temporal epistemic logics for the specification of multi-agent systems. We consider well-known properties of multi-agent systems including perfect recall, synchronicity, no learning, unique initial state, and define natural correspondences between these and quantified interpreted systems. Our findings identify several monodic fragments of first-order temporal epistemic logic that we prove to be both sound and complete with respect to the corresponding classes of quantified interpreted systems. The results show that interaction axioms for propositional temporal epistemic logic can be lifted to the monodic fragment.

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

[2]  LamportLeslie.  Time, clocks, and the ordering of events in a distributed system , 1978 .

[3]  Roger Villemaire,et al.  Browser-Based Enforcement of Interface Contracts in Web Applications with BeepBeep , 2009, CAV.

[4]  Alessio Lomuscio,et al.  First-Order Linear-time Epistemic Logic with Group Knowledge: An Axiomatisation of the Monodic Fragment , 2009, Fundam. Informaticae.

[5]  Frank Wolter,et al.  Monodic Epistemic Predicate Logic , 2000, JELIA.

[6]  Alessio Lomuscio,et al.  Quantified epistemic logics for reasoning about knowledge in multi-agent systems , 2009, Artif. Intell..

[7]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[8]  Frank Wolter,et al.  Axiomatizing the monodic fragment of first-order temporal logic , 2002, Ann. Pure Appl. Log..

[9]  Frank Wolter,et al.  On the computational complexity of decidable fragments of first-order linear temporal logics , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

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

[11]  Ian M. Hodkinson.  Complexity of monodic guarded fragments over linear and real time , 2006, Ann. Pure Appl. Log..

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

[13]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[14]  Alessio Lomuscio,et al.  A Complete First-Order Logic of Knowledge and Time , 2008, KR.

[15]  Hector J. Levesque,et al.  Communicative Actions for Artificial Agents , 1997, ICMAS.

[16]  Joseph Y. Halpern,et al.  The complexity of reasoning about knowledge and time , 1986, STOC '86.

[17]  Michael Wooldridge,et al.  Reasoning about rational agents , 2000, Intelligent robots and autonomous agents.

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

[19]  Owen Rees,et al.  Efficient and timely mutual authentication , 1987, OPSR.

[20]  Anand S. Rao,et al.  Deliberation and its Role in the Formation of Intentions , 1991, UAI.

[21]  Alin Deutsch,et al.  Specification and verification of data-driven web services , 2004, PODS.

[22]  D. Gabbay,et al.  Many-Dimensional Modal Logics: Theory and Applications , 2003 .

[23]  Frank Wolter,et al.  Decidable and undecidable fragments of first-order branching temporal logics , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[24]  Joseph Y. Halpern,et al.  Complete Axiomatizations for Reasoning about Knowledge and Time , 2002, SIAM J. Comput..