E. Gradel and I. Walukiewicz. Guarded xed point logic. In Logic in Computer Science, pages 45-54, 1999. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Deciding Regular Grammar Logics With Converse Through.. - Demri, de Nivelle (2003) (3 citations) (Correct)
The Complexity of Regularity in Grammar Logics - Demri (2001) (1 citation) (Correct)
Computational Space Efficiency and Minimal Model.. - Georgieva, Hustadt.. (2001) (Correct)
Guarded Fixed Point Logics and the Monadic Theory of Countable.. - Grädel (2000) (Correct)
Back and Forth Between Guarded and Modal Logics - Grädel, Hirsch, Otto (2000) (7 citations) (Correct)
Decidability Issues for Action Guarded Logics - Goncalves, Grädel (2 citations) (Correct)
A Tableau Algorithm for the Clique Guarded Fragment (Extended .. - Hirsch, Tobies (2000) (Correct)
Interpolation in Guarded Fragments - Hoogland, Marx (2000) (4 citations) (Correct)
The Computational Complexity of Hybrid Temporal Logics - Areces, Blackburn, Marx (2000) (9 citations) (Correct)
The Two-Variable Guarded Fragment with Transitive Relations - Ganzinger, Meyer, Veanes (1999) (33 citations) (Correct)
Logic Programming: The Case of Description and Hybrid Logic - Areces (Correct)
Decidable Properties of Tree Languages - Bojanczyk (2004) Self-citation (Walukiewicz) (Correct)
Decidable Fragments of First-Order and Fixed-Point Logic - From.. - Grädel (2003) Self-citation (Gr) (Correct)
Games and Model Checking for Guarded Logics - Berwanger, Grädel (2000) Self-citation (Gr) (Correct)
Why Are Modal Logics So Robustly Decidable? - Grädel Self-citation (Gr) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC