Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic for Programming Artificial Intelligence and Reasoning

LPAR 2001: Logic for Programming, Artificial Intelligence, and Reasoning pp 70–84Cite as

Games and Model Checking for Guarded Logics

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2250))

Abstract

We investigate the model checking problems for guarded first-order and fixed point logics byreducing them to paritygames. This approach is known to provide good results for the modal μ-calculus and is verycloselyrelated to automata-based methods. To obtain good results also for guarded logics, optimized constructions of games have to be provided.

Further, we studythe structure of paritygames, isolate ‘easy’ cases that admit efficient algorithmic solutions, and determine their relationship to specific fragments of guarded fixed point logics.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Andréka, J. van Benthem, and I. Németi, Modal languages and bounded fragments of predicate logic, Journal of Philosophical Logic, 27 (1998), 217–274.

    Article  MATH  MathSciNet  Google Scholar 

  2. D. Berwanger, Games and model checking for guarded logics. Diploma thesis, RWTH Aachen, 2000.

    Google Scholar 

  3. R. Bloem, H. Gabow, and F. Somenzi, An algorithm for strongly connected component analysis in n log n symbolic steps, in Formal Methods in Computer Aided Design, LNCS Nr. 1954 (2000), 37–54.

    Chapter  Google Scholar 

  4. S. Dziembowski, Bounded-variable fixpoint queries are PSPACE-complete, Computer Science Logic CSL 96. LNCS Nr. 1258 (1996), 89–105.

    Google Scholar 

  5. A. Emerson and C. Jutla, Tree automata, mu-calculus and determinacy, in Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991, 368–377.

    Google Scholar 

  6. A. Emerson and C. Jutla and A. P. Sistla, On model checking for the μ-calculus and its fragments, Theoretical Computer Science 258 (2001), 491–522.

    Google Scholar 

  7. J. Flum, M. Frick, and M. Grohe, Query evaluation via tree-decompositions, in Database Theory-ICDT 2001, LNCS Nr. 1973 (2001), 22–38.

    Google Scholar 

  8. H. Ganzinger, C. Meyer, and M. Veanes, The two-variable guarded fragment with transitive relations, in Proc. 14th IEEE Symp. on Logic in Computer Science, 1999, 24–34.

    Google Scholar 

  9. G. Gottlob, E. Grädel, and H. Veith, Datalog LITE: A deductive query language with linear time model checking, ACM Transactions on Computational Logic, (to appear).

    Google Scholar 

  10. G. Gottlob, N. Leone, and F. Scarcello, Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width, in Proc. 20th ACM Symp. on Principles of Database Systems, 2001, 195–201.

    Google Scholar 

  11. E. Grädel, On the restraining power of guards, Journal of Symbolic Logic, 64 (1999), 1719–1742.

    Article  MATH  MathSciNet  Google Scholar 

  12. E. Grädel, Guarded fixed point logics and the monadic theory of countable trees, to appear in Theoretical Computer Science, (2001).

    Google Scholar 

  13. E. Grädel, Why are modal logics so robustly decidable?, in Current Trends in Theoretical Computer Science. Entering the 21st Century, G. Paun, G. Rozenberg, and A. Salomaa, eds., World Scientific, 2001, 393–498.

    Google Scholar 

  14. E. Grädel and M. Otto, On logics with two variables, Theoretical Computer Science, 224 (1999), 73–113.

    MATH  Google Scholar 

  15. E. Grädel and I. Walukiewicz, Guarded fixed point logic, in Proc. 14th IEEE Symp. on Logic in Computer Science, 1999, 45–54.

    Google Scholar 

  16. B. Herwig, Zur Modelltheorie von Lμ. Dissertation, Universität Freiburg, 1989.

    Google Scholar 

  17. M. Jurdzinski, Deciding the winner in parity games is in UP ∩ Co-UP., Information Processing Letters, 68 (1998), 119–124.

    MathSciNet  Google Scholar 

  18. M. Jurdziński, Small progress measures for solving parity games, Proceedings of STACS 2000, LNCS Nr. 1770 (2000), 290–301.

    Chapter  Google Scholar 

  19. V. King, O. Kupferman, and M. Vardi, On the complexity of parity word automata, in Proceedings of FOSSACS 2001, LNCS Nr. 2030 (2001), 276–286.

    Google Scholar 

  20. O. Kupferman, M. Vardi, and P. Wolper, An automata-theoretic approach to branching-time model checking, Journal of the ACM, 47 (2000), 312–360.

    Article  MathSciNet  MATH  Google Scholar 

  21. C. Stirling, Bisimulation, model checking and other games. Notes for the Mathfit instructional meeting on games and computation. Edinburgh, 1997.

    Google Scholar 

  22. M. Vardi, On the complexity of bounded-variable queries, in Proc. 14th ACM Symp. on Principles of Database Systems, 1995, 266–267.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RWTH Aachen, Mathematische Grundlagen der Informatik, Aachen

    Dietmar Berwanger & Erich Grädel

Authors
  1. Dietmar Berwanger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erich Grädel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Software, Technical University of Catalonia, Jordi Girona 1, 08034, Barcelona, Spain

    Robert Nieuwenhuis

  2. Department of Computer Science, University of Manchester, Kilburn Building, Oxford Road, M13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berwanger, D., Grädel, E. (2001). Games and Model Checking for Guarded Logics. In: Nieuwenhuis, R., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2001. Lecture Notes in Computer Science(), vol 2250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45653-8_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-45653-8_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42957-9

  • Online ISBN: 978-3-540-45653-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation