An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Back and forth between guarded and modal logics
ACM Transactions on Computational Logic (TOCL)
Linear time datalog and branching time logic
Logic-based artificial intelligence
Guarded fixed point logics and the monadic theory of countable trees
Theoretical Computer Science - Complexity and logic
Beth Definability for the Guarded Fragment
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Computational Space Efficiency and Minimal Model Generation for Guarded Formulae
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Games and Model Checking for Guarded Logics
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Two-Way Alternating Automata and Finite Models
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
EXPSPACE-Complete Variant of Guarded Fragment with Transitivity
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
The Finite Graph Problem for Two-Way Alternating Automata
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Progress on the State Explosion Problem in Model Checking
Informatics - 10 Years Back. 10 Years Ahead.
Invited Talk: Decision procedures for guarded logics
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Deciding the guarded fragments by resolution
Journal of Symbolic Computation
The finite graph problem for two-way alternating automata
Theoretical Computer Science - Foundations of software science and computation structures
Encoding two-valued nonclassical logics in classical logic
Handbook of automated reasoning
Back and Forth between Guarded and Modal Logics
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
The description logic handbook
Automata logics, and infinite games
Guarded Quantification in Least Fixed Point Logic
Journal of Logic, Language and Information
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
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
Description Logics for Shape Analysis
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
On the complexity of the two-variable guarded fragment with transitive guards
Information and Computation
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
Guarded hybrid knowledge bases12
Theory and Practice of Logic Programming
FO(ID) as an Extension of DL with Rules
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Decidability of the Guarded Fragment with the Transitive Closure
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Efficient Patterns for Model Checking Partial State Spaces in CTL ∩ LTL
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of Java Programs with Interacting Analysis Plugins
Electronic Notes in Theoretical Computer Science (ENTCS)
The two-variable guarded fragment with transitive guards is 2EXPTIME-hard
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Higher order pushdown automata, the Caucal hierarchy of graphs and parity games
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On finite satisfiability of the guarded fragment with equivalence or transitive guards
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Non-standard inferences in description logics
Non-standard inferences in description logics
FO(ID) as an extension of DL with rules
Annals of Mathematics and Artificial Intelligence
On the complexity of model expansion
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
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
Guarded open answer set programming
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
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
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
Guarded open answer set programming with generalized literals
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Results on the guarded fragment with equivalence or transitive relations
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Bounded model checking of pointer programs
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Finite satisfiability for guarded fixpoint logic
Information Processing Letters
Proceedings of the VLDB Endowment
Decidable Elementary Modal Logics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Well-founded semantics for extended datalog and ontological reasoning
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
Guarded fixed point logics are obtained by adding least and greatest fixed points to the guarded fragments of first-order logic that were recently introduced by Andr?ka, van Benthem and N?meti. Guarded fixed point logics can also be viewed as the natural common extensions of the modal mu-calculus and the guarded fragments. We prove that the satisfiability problems for guarded fixed point logics are decidable and complete for deterministic double exponential time. For guarded fixed point sentences of bounded width, the most important case for applications, the satisfiability problem is EXPTIME-complete.