Skip to main content
SpringerLink
Log in

Reasoning about Time-Dependent Multi-agents: Foundations of Theorem Proving and Model Checking

  • Chapter
Transactions on Computational Collective Intelligence VI

Part of the book series: Lecture Notes in Computer Science ((TCCI,volume 7190))

  • 446 Accesses

Abstract

Firstly, an extension of linear-time temporal logic (LTL), called an agents-indexed linear-time temporal logic (ALTL), is introduced as a Gentzen-type sequent calculus. ALTL is intended to appropriately express reasoning about time-dependent multi-agents within a proof system. The cut-elimination and completeness theorems for ALTL are shown. Secondly, an extension of computation tree logic (CTL), called an agents-indexed computation tree logic (ACTL), is introduced as a Kripke-type semantics. ACTL is intended to appropriately formalize reasoning about time-dependent multi-agents within an executable temporal logic by model checking. The model-checking, validity and satisfiability problems for ACTL are shown to be decidable.

This paper is an extension of the presentation [9] in the track “Agent and multi-agent systems” of the conference KES 2010. Section [3] includes a new result (concerning ACTL) which is presented in this paper. In [9], the results for ACTL were not included.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM 49(5), 672–713 (2002)

    Article  MathSciNet  Google Scholar 

  2. Clarke, E.M., Emerson, E.A.: Design and Synthesis of Synchronization Skeletons using Branching Time Temporal Logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  3. Clarke, E.M., Grumberg, O., Peled, D.A.: Model checking. The MIT Press (1999)

    Google Scholar 

  4. Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Formal Models and Semantics (B), pp. 995–1072. Elsevier, MIT Press (1990)

    Google Scholar 

  5. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about knowledge. MIT Press (1995)

    Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Kacprzak, M., Nabialek, W., Niewiadomski, A., Penczek, W., Polroa, A., Szreter, M., Wozawa, B., Zbrzezny, A.: VerICS 2007: A model checker for real-time and multi-agent systems. Fundamenta Informaticae 85(1-4), 313–328 (2008)

    MATH  MathSciNet  Google Scholar 

  8. Kamide, N.: Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic. In: Fisher, M., Sadri, F., Thielscher, M. (eds.) CLIMA IX. LNCS (LNAI), vol. 5405, pp. 57–76. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Kamide, N.: A Proof System for Time-dependent Multi-agents. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds.) KES 2010. LNCS (LNAI), vol. 6276, pp. 178–187. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Kamide, N., Wansing, H.: Combining linear-time temporal logic with constructiveness and paraconsistency. Journal of Applied Logic 8, 33–61 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kawai, H.: Sequential calculus for a first order infinitary temporal logic. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 33, 423–432 (1987)

    Article  MATH  Google Scholar 

  12. Konikowska, B., Penczek, W.: Model checking for multi-valued computation tree logics. In: Fitting, M., Ołowska, E. (eds.) Beyond Two: Theory and Applications of Multiple Valued Logic, pp. 193–210. Physica-Verlag (2003)

    Google Scholar 

  13. Konikowska, B., Penczek, W.: Model checking for multivalued logic knowledge and time. In: Proceedings of the 5th International Conference on Autonomous Agent and Multiagent Systems (AAMAS 2006), pp. 169–176. ACM (2006)

    Google Scholar 

  14. Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science 27, 333–354 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lewis, D.K.: Convention: A philosophical study. Harvard University Press (1969)

    Google Scholar 

  16. Lomuscio, A., Raimondi, F.: mcmas: A Model Checker for Multi-agent Systems. In: Hermanns, H. (ed.) TACAS 2006. LNCS, vol. 3920, pp. 450–454. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pp. 46–57 (1977)

    Google Scholar 

  18. van der Hoek, W., Wooldridge, M.: Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications. Studia Logica 75(1), 125–157 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  19. van der Meyden, R., Shilov, N.V.: Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract). In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 432–445. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  20. van der Meyden, R., Wong, K.-S.: Complete axiomatizations for reasoning about knowledge and branching time. Studia Logica 75(1), 93–123 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  21. Wooldridge, M.: An introduction to multiagent systems. John Wiley and Sons Ltd. (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Waseda Institute for Advanced Study, Waseda University, 1-6-1 Nishi Waseda, Shinjuku-ku, Tokyo, 169-8050, Japan

    Norihiro Kamide

Authors
  1. Norihiro Kamide
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Wroclaw University of Technology, Poland

    Ngoc Thanh Nguyen

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kamide, N. (2012). Reasoning about Time-Dependent Multi-agents: Foundations of Theorem Proving and Model Checking. In: Nguyen, N.T. (eds) Transactions on Computational Collective Intelligence VI. Lecture Notes in Computer Science, vol 7190. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29356-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29356-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29355-9

  • Online ISBN: 978-3-642-29356-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation