Advertisement

Decision Procedures for Guarded Logics

  • Erich Grädel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Modal Logic Decision Procedure Tree Decomposition Point Logic Kripke Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    J. VAN Benthem, Dynamic bits and pieces, ILLC research report, University of Amsterdam, 1997.Google Scholar
  3. 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. 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. 5.
    E. Grädel, On the restraining power of guards, Journal of Symbolic Logic. To appear.Google Scholar
  6. 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. 7.
    D. Kozen, Results on the propositional μ-calculus, Theoretical Computer Science, 27(1983), pp. 333–354.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    M. Rabin, Decidability of second-order theories and automata on infinite trees, Transactions of the AMS, 141(1969), pp. 1–35.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 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. 10.
    C. Stirling, Bisimulation, model checking and other games. Notes for the Mathfit instructional meeting on games and computation. Edinburgh, 1997.Google Scholar
  11. 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. 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.CrossRefGoogle Scholar
  13. 13.
    W. Zielonka, Infinite games on finitely coloured graphs with applications to automata on infinite trees, Theoretical Computer Science, 200(1998), pp. 135–183.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Erich Grädel
    • 1
  1. 1.Mathematische Grundlagen der InformatikRWTH AachenGermany

Personalised recommendations