First steps in modal logic
Modal logic
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
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
A Superposition Decision Procedure for the Guarded Fragment with Equality
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Back and Forth between Guarded and Modal Logics
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Games and Model Checking for Guarded Logics
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Automata logics, and infinite games
The Semijoin Algebra and the Guarded Fragment
Journal of Logic, Language and Information
A Guarded Fragment for Abstract State Machines
Journal of Logic, Language and Information
Queries determined by views: pack your views
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
A Logic Based Approach to the Static Analysis of Production Systems
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Deciding the verification problem for abstract state machines
ASM'03 Proceedings of the abstract state machines 10th international conference on Advances in theory and practice
Combining theories: the Ackerman and guarded fragments
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
A logic of reachable patterns in linked data-structures
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A decision procedure for the alternation-free two-way modal µ-calculus
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
The predicate-minimizing logic MIN
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Guarded open answer set programming with generalized literals
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
Different variants of guarded logics (a powerful generalization of modal logics) are surveyed and an elementary proof for the decidability of guarded fixed point logics is presented. In a joint paper with Igor Walukiewicz, we proved that the satisfiability problems for guarded fixed point logics are decidable and complete for deterministic double exponential time (E. Grädel and I. Walulkiewicz, Proc. 14th IEEE Symp. on Logic in Computer Science, 1999, pp. 45-54). That proof relies on alternating automata on trees and on a forgetful determinacy theorem for games on graphs with unbounded branching. 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, we show that the satisfiability problem for guarded fixed point formulae can be reduced to the monadic theory of countable trees (SωS), or to the µ-calculus with backwards modalities.