Dietmar Berwanger, Erich Grädel  Home/Search
Context Related
| mgi.informatik.rwthaachen.de...lpar.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mgi.informatik.rwthaachen.de/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the model checking problems for guarded first-order and fixed point logics by reducing them to parity games. This approach is known to provide good results for the modal µ-calculus and is very closely related to automata-based methods. To obtain good results also for guarded logics, optimized constructions of games have to be provided. Further, we study the structure of parity games, isolate `easy' cases that admit efficient algorithmic solutions, and determine their relationship ... (Update)
Similar documents based on text: More All
1.3: Fixed Point Formulae and Solitaire Games - Berwanger, Grädel (Correct)
0.8: Back and Forth between Guarded and Modal Logics - Grädel, Hirsch, Otto (2000) (Correct)
0.8: Datalog LITE: A deductive query language with linear time .. - Gottlob, Grädel, Veith (Correct)
BibTeX entry: (Update)
D. Berwanger, Games and model checking for guarded logics. Diploma thesis, RWTH Aachen, 2000. http://citeseer.ist.psu.edu/berwanger00games.html More
@article{ berwanger01games,
author = "Dietmar Berwanger and Erich Gr{\"a}del",
title = "Games and Model Checking for Guarded Logics",
journal = "Lecture Notes in Computer Science",
volume = "2250",
pages = "70+",
year = "2001",
url = "citeseer.ist.psu.edu/berwanger00games.html" }
Citations (may not include all citations):100 mu-calculus and determinacy (context) - Emerson, Jutla et al. - 1991
86 An automata-theoretic approach to branching-time model check.. - Kupferman, Vardi et al. - 2000
47 the complexity of bounded-variable queries (context) - Vardi - 1995
44 Modal languages and bounded fragments of predicate logic - Andr, van Benthem et al. - 1998
40 the restraining power of guards - Gr, On - 1999
34 The two-variable guarded fragment with transitive relations - Ganzinger, Meyer et al. - 1999
26 Theoretical Computer Science (context) - Gr, Otto et al. - 1999
21 Query evaluation via tree-decompositions - Flum, Frick et al. - 2001
15 Guarded xed point logic (context) - Gr, Walukiewicz - 1999
13 Why are modal logics so robustly decidable (context) - Gr - 2001
12 Small progress measures for solving parity games (context) - Jurdzi - 2000
11 Theoretical Computer Science (context) - Emerson, Jutla et al. - 2001
9 Datalog LITE: A deductive query language with linear time mo.. - Gottlob, Gr et al.
7 Deciding the winner in parity games is in UP \ Co-UP (context) - Jurdzinski - 1998
3 Games and model checking for guarded logics - Berwanger - 2000
[Article contains additional citations not shown here]
Documents on the same site (http://www-mgi.informatik.rwth-aachen.de/Publications/): More
Game Logic is Strong Enough for Parity Games - Berwanger (Correct)
Why Are Modal Logics So Robustly Decidable? - Grädel (Correct)
Prefix-Recognisable Graphs and Monadic Second-Order Logic - Blumensath (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