Games and Model Checking for Guarded Logics

Authors:
Dietmar Berwanger;Erich Grädel
Affiliations:
-;-
Venue:
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Year:
2001

Citing 15
Cited 3

Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the complexity of bounded-variable queries (extended abstract)

PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deciding the winner in parity games is in UP ∩ co-UP

Information Processing Letters
On logics with two variables

Theoretical Computer Science
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On model checking for the &mgr;-calculus and its fragments

Theoretical Computer Science
Why are modal logics so robustly decidable?

Current trends in theoretical computer science
Datalog LITE: a deductive query language with linear time model checking

ACM Transactions on Computational Logic (TOCL)
Guarded fixed point logics and the monadic theory of countable trees

Theoretical Computer Science - Complexity and logic
Query Evaluation via Tree-Decompositions

ICDT '01 Proceedings of the 8th International Conference on Database Theory
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Bounded-Variable Fixpoint Queries are PSPACE-complete

CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Guarded Fixed Point Logic

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The Two-Variable Guarded Fragment with Transitive Relations

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

On the Variable Hierarchy of the Modal µ-Calculus

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Guarded negation

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
The variable hierarchy of the µ-calculus is strict

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the model checking problems for guarded first-order and fixed point logics byreducing them to paritygames. 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 studythe structure of paritygames, isolate 'easy' cases that admit efficient algorithmic solutions, and determine their relationship to specific fragments of guarded fixed point logics.