Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Implementation and Optimisation of a Tableau Algorithm for the Guarded Fragment
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
An overview of the Jahob analysis system: project goals and current status
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Combining theories: the Ackerman and guarded fragments
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
On the finite satisfiability problem for the guarded fragment with transitivity
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Counting in the two variable guarded logic with transitivity
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Invited contribution: a comprehensive framework for combined decision procedures
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
| Hi-index | 0.00 |
Different variants of guarded logics (a powerful generalization of modal logics) are surveyed and the recent decidability result for guarded fixed point logic (obtained in joint work with I. Walukiewicz) is explained. The exposition given here emphasizes the tree model property of guarded logics: every satisfiable sentence has a model of bounded tree width. Based on the tree model property, different methods for reasoning with guarded fixed point sentences are presented: (1) reduction to the monadic theory of countable trees (SωS); (2) reduction to the µ-calculus with backwards modalities; (3) the automata theoretic method (which gives theoretically optimal complexity results).