Handbook of theoretical computer science (vol. B)
A calculus for access control in distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Monadic second-order definable graph transductions: a survey
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Cornerstones of undecidability
Cornerstones of undecidability
Reasoning about knowledge
Basic proof theory
Formal languages: an introduction and a synopsis
Handbook of formal languages, vol. 1
The nondeterministic information logic NIL is PSPACE-complete
Fundamenta Informaticae
Single Step Tableaux for Modal Logics
Journal of Automated Reasoning
On infinite transition graphs having a decidable monadic theory
Theoretical Computer Science
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Efficient Loop-Check for Backward Proof Search in Some Non-classical Propositional Logics
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Tableaux Methods for Access Control in Distributed Systems
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Tableau for Multimodal Logics and Some (Un)Decidability Results
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
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
A Concept Language Extended with Different Kinds of Transitive Roles
KI '96 Proceedings of the 20th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Algorithmic Aspects of Propositional Tense Logics
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Resolution-Based Calculi for Modal and Temporal Logics
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
A Resolution Decision Procedure for the Guarded Fragment
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Deciding the guarded fragments by resolution
Journal of Symbolic Computation
Encoding two-valued nonclassical logics in classical logic
Handbook of automated reasoning
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
On the Decision Problem for the Guarded Fragment with Transitivity
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Decidability of SHIQ with complex role inclusion axioms
Artificial Intelligence
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
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
Cheap Boolean Role Constructors for Description Logics
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
Computational Logic in Multi-Agent Systems
Representing ontologies using description logics, description graphs, and rules
Artificial Intelligence
A Tableau Calculus for Regular Grammar Logics with Converse
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Hypertableau reasoning for description logics
Journal of Artificial Intelligence Research
A Framework for Graded Beliefs, Goals and Intentions
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Fundamenta Informaticae
A better uncle for OWL: nominal schemas for integrating rules and ontologies
Proceedings of the 20th international conference on World wide web
A tableau calculus with automaton-labelled formulae for regular grammar logics
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
An extension of complex role inclusion axioms in the description logic SROIQ
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Complexities of Horn Description Logics
ACM Transactions on Computational Logic (TOCL)
Acyclicity notions for existential rules and their application to query answering in ontologies
Journal of Artificial Intelligence Research
Consequence-based and fixed-parameter tractable reasoning in description logics
Artificial Intelligence
| Hi-index | 0.01 |
We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic. The translation is theoretically interesting because it translates modal logics with certain frame conditions into first-order logic, without explicitly expressing the frame conditions. It is practically relevant because it makes it possible to use a decision procedure for the guarded fragment in order to decide regular grammar logics with converse. The class of regular grammar logics includes numerous logics from various application domains. A consequence of the translation is that the general satisfiability problem for every regular grammar logics with converse is in EXPTIME. This extends a previous result of the first author for grammar logics without converse. Other logics that can be translated into GF2 include nominal tense logics and intuitionistic logic. In our view, the results in this paper show that the natural first-order fragment corresponding to regular grammar logics is simply GF2 without extra machinery such as fixed-point operators.