Decision procedures for guarded logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1632, Issue , 1999, Pages 31-51

  Grädel, Erich ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; CALCULATIONS; TEMPORAL LOGIC; THEOREM PROVING;

DECISION PROCEDURE; FIXED POINTS; FIXED-POINT LOGIC; MODAL LOGIC; MU-CALCULUS; OPTIMAL COMPLEXITY; TREE MODELING; TREE-WIDTH;

FORESTRY;

EID: 84957612843     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48660-7_3     Document Type: Conference Paper

References (12)

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