See this document in CiteSeerX!

Why Are Modal Logics So Robustly Decidable?  (Make Corrections)  
Erich Grädel



  Home/Search   Context   Related

 
View or download:
mgi.informatik.rwthaa...Grtrends01.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  mgi.informatik.rwthaachen.de/... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Modal logics are widely used in a number of areas in computer science, in particular (Update)

Similar documents (at the sentence level):
53.1%:   Why Are Modal Logics So Robustly Decidable? - Grädel (1999)   (Correct)
17.1%:   Decidable Fragments of First-Order and Fixed-Point Logic - From.. - Grädel (2003)   (Correct)

Active bibliography (related documents):   More   All
0.9:   Guarded Fixed Point Logic - Grädel, Walukiewicz (1999)   (Correct)
0.5:   Guarded Fixed Point Logics and the Monadic Theory of Countable.. - Grädel (2000)   (Correct)
0.4:   The Decidability of Guarded Fixed Point Logic - Grädel   (Correct)

Similar documents based on text:   More   All
0.2:   Model Checking Games - Grädel (2002)   (Correct)
0.1:   The Challenger-Solver game: Variations on the theme of P =?NP - Gurevich (1989)   (Correct)
0.1:   Evolving Algebras - Mini-Course - Gurevich, Börger (1995)   (Correct)

BibTeX entry:   (Update)

@misc{ del-why,
  author = "Erich Grädel",
  title = "Why Are Modal Logics So Robustly Decidable?",
  url = "citeseer.ist.psu.edu/441009.html" }
Citations (may not include all citations):
725   Temporal and modal logic (context) - Emerson - 1990
241   Decidability of second-order theories and automata on innite.. (context) - Rabin - 1969
165   Theoretical Computer Science (context) - the, -calculus - 1983
131   The complexity of tree automata and logics of programs (context) - Emerson, Jutla - 1988
130   The computational complexity of provability in systems of pr.. (context) - Ladner - 1977
127   An automata-theoretic approach to branching-time model check.. - Bernholtz, Vardi et al. - 1994
106   A linear-time model-checking algorithm for the alternation-f.. - Cleaveland, Steffen - 1993
84   Decision procedures and expressiveness in the temporal logic.. (context) - Emerson, Halpern - 1985
69   Modal Logic and Classical Logic (context) - van Benthem - 1983
68   Why is modal logic so robustly decidable - Vardi - 1997
60   An automata theoretic decision procedure for the proposition.. (context) - Streett, Emerson - 1989
44   Modal languages and bounded fragments of predicate logic - Andr, van Benthem et al. - 1998
40   the restraining power of guards - Gr, On - 1999
38   the expressive completeness of the propositional mucalculus .. - Janin, Walukiewicz - 1996
31   The Classical Decision Problem (context) - orger, Gr et al. - 1997
26   Theoretical Computer Science (context) - Gr, Otto et al. - 1999
15   Guarded xed point logic (context) - Gr, Walukiewicz - 1999
13   ur Mathematische Logik und Grundlagen der Mathematik (context) - Mortimer, with et al. - 1975
12   the decision problem for two-variable rstorder logic (context) - Gr, Kolaitis et al. - 1997
6   Undecidability results on two-variable logics - Gr, Otto et al. - 1997
6   First Steps in Modal Logic (context) - Popcorn - 1994
6   Reasoning in description logics (context) - Donnini, Lenzerini et al. - 1996
5   On preservation theorems for two-variable logic - Gr, Rosen - 1999
4   ILLC research report (context) - van Benthem, bits - 1997
2   mu-calculus and determinacy (context) - automata - 1991
2   Bulletin of the Europea Association for Theoretical Computer.. (context) - Gurevich, classical et al. - 1990
1   preliminary version is available httpturing (context) - de Rijke, Logic et al. - 1999
1   A nite model theorem for the propositional -calculus (context) - Kozen - 1983
1   Process operation in extended dynamic logic (context) - van Benthem - 1998

Documents on the same site (http://www-mgi.informatik.rwth-aachen.de/Publications/):   More
Game Logic is Strong Enough for Parity Games - Berwanger   (Correct)
Prefix-Recognisable Graphs and Monadic Second-Order Logic - Blumensath (2001)   (Correct)
Inflationary Fixed Points in Modal Logic - Dawar, Grädel, Kreutzer (2001)   (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