Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Deduction

CADE 1999: Automated Deduction — CADE-16 pp 31–51Cite as

Decision Procedures for Guarded Logics

  • Conference paper
  • First Online:

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

Abstract

Different variants of guarded logics (a powerful generalization of modal logics) are surveyed and the recent decidability result for guarded fixed point logic (obtained in joint work with I. Walukiewicz) is explained. The exposition given here emphasizes the tree model property of guarded logics: every satisfiable sentence has a model of bounded tree width.

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   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

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), pp. 217–274.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. VAN Benthem, Dynamic bits and pieces, ILLC research report, University of Amsterdam, 1997.

    Google Scholar 

  3. A. Emerson and C. Jutla, The complexity of tree automata and logics of programs, in Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp. 328–337.

    Google Scholar 

  4. J. Flum, On the (infinite) model theory of fixed-point logics, in Models, algebras, and proofs, X. Caicedo and C. Montenegro, eds., no. 2003 in Lecture Notes in Pure and Applied Mathematics Series, Marcel Dekker, 1999, pp. 67–75.

    Google Scholar 

  5. E. Grädel, On the restraining power of guards, Journal of Symbolic Logic. To appear.

    Google Scholar 

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

    Google Scholar 

  7. D. Kozen, Results on the propositional μ-calculus, Theoretical Computer Science, 27(1983), pp. 333–354.

    Article  MATH  MathSciNet  Google Scholar 

  8. M. Rabin, Decidability of second-order theories and automata on infinite trees, Transactions of the AMS, 141(1969), pp. 1–35.

    Article  MATH  MathSciNet  Google Scholar 

  9. B. Reed, Tree width and tangles: A new connectivity measure and some applications, in Surveys in Combinatorics, R. Bailey, ed., Cambridge University Press, 1997, pp. 87–162.

    Google Scholar 

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

    Google Scholar 

  11. M. Vardi, Why is modal logic so robustly decidable?, in Descriptive Complexity and Finite Models, N. Immerman and P. Kolaitis, eds., vol. 31 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, 1997, pp. 149–184.

    Google Scholar 

  12. —, Reasoning about the past with two-way automata, in Automata, Languages and Programming ICALP 98, vol. 1443 of Springer Lecture Notes in Computer Science, 1998, pp. 628–641.

    Chapter  Google Scholar 

  13. W. Zielonka, Infinite games on finitely coloured graphs with applications to automata on infinite trees, Theoretical Computer Science, 200(1998), pp. 135–183.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematische Grundlagen der Informatik, RWTH Aachen, Germany

    Erich Grädel

Authors
  1. Erich Grädel
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grädel, E. (1999). Decision Procedures for Guarded Logics. In: Automated Deduction — CADE-16. CADE 1999. Lecture Notes in Computer Science(), vol 1632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48660-7_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-48660-7_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66222-8

  • Online ISBN: 978-3-540-48660-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation