Handbook of theoretical computer science (vol. B)
Theoretical Computer Science
Reasoning in description logics
Principles of knowledge representation
Why are modal logics so robustly decidable?
Current trends in theoretical computer science
Modal logic
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Dynamic Logic
Modal Logic over Finite Structures
Journal of Logic, Language and Information
Modal and Guarded Characterisation Theorems over Finite Transition Systems
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Theoretical Computer Science
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
Automata logics, and infinite games
On the complexity of division and set joins in the relational algebra
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Semijoin Algebra and the Guarded Fragment
Journal of Logic, Language and Information
On the complexity of division and set joins in the relational algebra
Journal of Computer and System Sciences
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
The Descriptive Complexity of Parity Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Separating Graph Logic from MSO
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Highly acyclic groups, hypergraph covers, and the guarded fragment
Journal of the ACM (JACM)
Finite satisfiability for guarded fixpoint logic
Information Processing Letters
Where First-Order and Monadic Second-Order Logic Coincide
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the (un)decidability of fuzzy description logics under Łukasiewicz t-norm
Information Sciences: an International Journal
| Hi-index | 0.00 |
Guarded fixed-point logic μGF extends the guarded fragment by means of least and greatest fixed points, and thus plays the same role within the domain of guarded logics as the modal μ-calculus plays within the modal domain. We provide a semantic characterization of μGF within an appropriate fragment of second-order logic, in terms of invariance under guarded bisimulation. The corresponding characterization of the modal μ-calculus, due to Janin and Walukiewicz, is lifted from the modal to the guarded domain by means of model theoretic translations. Guarded second-order logic, the fragment of second-order logic which is introduced in the context of our characterization theorem, captures a natural and robust level of expressiveness with several equivalent characterizations. For a wide range of issues in guarded logics it may take up a role similar to that of monadic second-order in relation to modal logics. At the more general methodological level, the translations between the guarded and modal domains make the intuitive analogy between guarded and modal logics available as a tool in the further analysis of the model theory of guarded logics.