First-Order Linear-Time Epistemic Logic with Group Knowledge: An Axiomatisation of the Monodic Fragment

Authors:
Francesco Belardinelli;Alessio Lomuscio
Affiliations:
Department of Computing, Imperial College London, UK;Department of Computing, Imperial College London, UK
Venue:
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Year:
2009

Citing 12
Cited 0

The complexity of reasoning about knowledge and time. I. lower bounds

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Knowledge and common knowledge in a distributed environment

Journal of the ACM (JACM)
A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
Reasoning about knowledge

Reasoning about knowledge
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Epistemic Logic for AI and Computer Science

Epistemic Logic for AI and Computer Science
Decidable and Undecidable Fragments of First-Order Branching Temporal Logics

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Monodic Epistemic Predicate Logic

JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Formal Semantics of Temporal Epistemic Reflection

LOPSTR '94/META '94 Proceedings of the 4th International Workshops on Logic Programming Synthesis and Transformation - Meta-Programming in Logic
Computationally Grounded Theories of Agency

ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Complete Axiomatizations for Reasoning about Knowledge and Time

SIAM Journal on Computing
Quantified epistemic logics for reasoning about knowledge in multi-agent systems

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate quantified interpreted systems, a computationally grounded semantics for a first-order temporal epistemic logic on linear time. We report a completeness result for the monodic fragment of a language that includes LTL modalities as well as distributed and common knowledge. We exemplify possible uses of the formalism by analysing message passing systems, a typical framework for distributed systems, in a first-order setting.