Guarded fixed point logics and the monadic theory of countable trees (original) (raw)
Related papers
The Decidability of Guarded Fixed Point Logic
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), 1999
On the expressive power of monadic least fixed point logic
Theoretical Computer Science, 2006
On the Expressive Power of Monadic Least Fixed Point Logic (Full Version
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
IEEE Symposium on Foundations of Computer Science, 1991
Journal of the ACM, 2021
UvA-DARE ( Digital Academic Repository ) Fixed-point logics on trees
2010
Expressive power of monadic logics on words, trees, pictures, and graphs
2008
Reasoning about Social Choice and Games in Monadic Fixed-Point Logic
Electronic Proceedings in Theoretical Computer Science, 2019
Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard?
ArXiv, 2021
Finite satisfiability for guarded fixpoint logic
Information Processing Letters 112(10):371-375, 2012
Fixed-Point Logics and Solitaire Games
Theory of Computing Systems, 2004
Tree automata, mu-calculus and determinacy
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?
Cornell University - arXiv, 2021
Why Does Propositional Quantification Make Logics on Trees Robustly Hard?
Logical Methods in Computer Science
Lecture Notes in Computer Science, 1979
Expressiveness of Monadic Second-Order Logics on Infinite Trees of Arbitrary Branching Degree
2012
Enhancing fixed point logic with cardinality quantifiers
Journal of Logic and Computation, 1998
Logic and Games on Automatic Structures
Citeseer
Guarded Open Answer Set Programming
Davy Van Nieuwenborgh, Dirk Vermeir
Lecture Notes in Computer Science, 2005
Counting on CTL*: on the expressive power of monadic path logic
Information and Computation, 2003
Guarded Open Answer Set Programming with Generalized Literals
An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation, 1989
Stable model semantics for guarded existential rules and description logics
Principles of Knowledge Representation and Reasoning, 2014
Guards, Bounds, and Generalized Semantics
Journal of Logic, Language and Information, 2005
The Complexity of Model Checking Higher-Order Fixpoint Logic
Logical Methods in Computer Science, 2007
2010
Two-way cost automata and cost logics over infinite trees
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014
Branching-Time Temporal Logics with Minimal Model Quantifiers
Lecture Notes in Computer Science, 2009
Game solution, epistemic dynamics and fixed-point logics
Fundamenta Informaticae, 2010
Monadic second order finite satisfiability and unbounded tree-width
A proof system for finite trees
1996
Monadic fixed-points are in linear time on bounded degree graphs
Modal Logics with Composition on Finite Forests
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
Lecture Notes in Computer Science, 2002