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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Belardinelli, F., Lomuscio, A.: A Complete First-Order Logic of Knowledge and Time. In: Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), pp. 705–714. AAAI Press, Menlo Park (2008)
Belardinelli, F., Lomuscio, A.: Quantified Epistemic Logics for Reasoning about Knowledge in Multi-Agent Systems. Artificial Intelligence (to appear), http://dx.doi.org/10.1016/j.artint.2009.02.003
Blackburn, P., van Benthem, J., Wolter, F. (eds.): Handbook of Modal Logic. Elsevier, Amsterdam (2006)
Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning about Knowledge. MIT Press, Cambridge (1995)
Gabbay, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics. Elsevier, Amsterdam (2003)
Gammie, P., van der Meyden, R.: MCK: Model Checking the Logic of Knowledge. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 479–483. Springer, Heidelberg (2004)
Halpern, J., van der Meyden, R., Vardi, M.: Complete axiomatisations for reasoning about knowledge and time. SIAM Journal on Computing 33(3), 674–703 (2003)
Halpern, J., Moses, Y.: Knowledge and common knowledge in a distributed environment. Journal of the ACM 37(3), 549–587 (1990)
Halpern, J., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence 54, 319–379 (1992)
Halpern, J., Vardi, M.: The complexity of reasoning about knowledge and time 1: lower bounds. Journal of Computer and System Sciences 38(1), 195–237 (1989)
Hodkinson, I.: Monodic packed fragment with equality is decidable. Studia Logica 72, 185–197 (2002)
Hodkinson, I.: Complexity of monodic guarded fragments over linear and real time. Annals of Pure and Applied Logic 138, 94–125 (2006)
Hodkinson, I., Kontchakov, R., Kurucz, A., Wolter, F., Zakharyaschev, M.: On the computational complexity of decidable fragments of first-order linear temporal logics. In: Proceedings of the International Symposium on Temporal Representation and Reasoning (TIME 2003), pp. 91–98. IEEE Press, Los Alamitos (2003)
Hodkinson, I., Wolter, F., Zakharyaschev, M.: Decidable and undecidable fragments of first-order branching temporal logics. In: Logic in Computer science (LICS 2002), pp. 393–402. IEEE Computer Society Press, Los Alamitos (2002)
Hodkinson, I., Wolter, F., Zakharyaschev, M.: Decidable fragment of first-order temporal logics. Annals of Pure and Applied Logic 106(1-3), 85–134 (2000)
van der Hoek, W., Meyer, J.-J.C., Treur, J.: Formal semantics of temporal epistemic reflection. In: Fribourg, L., Turini, F. (eds.) LOPSTR 1994 and META 1994. LNCS, vol. 883, pp. 332–352. Springer, Heidelberg (1994)
Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)
van der Meyden, R.: Axioms for knowledge and time in distributed systems with perfect recall. In: Logic in Computer Science (LICS 1994), pp. 448–457. IEEE, Los Alamitos (1994)
Meyer, J.-J.C., van der Hoek, W.: Epistemic Logic for AI and Computer Science. Cambridge University Press, Cambridge (1995)
Raimondi, F., Lomuscio, A.: Automatic verification of multi-agent systems by model checking via OBDDs. Journal of Applied Logic 5(2), 235–251 (2007)
Reynolds, M.: Axiomatising first-order temporal logic: until and since over linear time. Studia Logica 57(2/3), 279–302 (1996)
Sturm, H., Wolter, F., Zakharyaschev, M.: Monodic epistemic predicate logic. In: Brewka, G., Moniz Pereira, L., Ojeda-Aciego, M., de Guzmán, I.P. (eds.) JELIA 2000. LNCS, vol. 1919, pp. 329–344. Springer, Heidelberg (2000)
Sturm, H., Wolter, F., Zakharyaschev, M.: Common knowledge and quantification. Economic Theory 19, 157–186 (2002)
Wolter, F., Zakharyaschev, M.: Decidable fragments of first-order modal logics. Journal of Symbolic Logic 66(3), 1415–1438 (2001)
Wolter, F., Zakharyaschev, M.: Axiomatizing the monodic fragment of first-order temporal logic. Annals of Pure and Applied Logic 118(1-2), 133–145 (2002)
Wolter, F.: First order common knowledge logics. Studia Logica 65(2), 249–271 (2000)
Wooldridge, M.: Computationally grounded theories of agency. In: Proceedings of the International Conference on Multi-Agent Systems (ICMAS 2000), pp. 13–22. IEEE Press, Los Alamitos (2000)
Wooldridge, M.: Reasoning about Rational Agents. MIT Press, Cambridge (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Belardinelli, F., Lomuscio, A. (2009). First-Order Linear-Time Epistemic Logic with Group Knowledge: An Axiomatisation of the Monodic Fragment. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2009. Lecture Notes in Computer Science(), vol 5514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02261-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-02261-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02260-9
Online ISBN: 978-3-642-02261-6
eBook Packages: Computer ScienceComputer Science (R0)