Reasoning about knowledge
Formal languages: an introduction and a synopsis
Handbook of formal languages, vol. 1
Artificial Intelligence
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Dynamic Logic
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
Analytic Tableau Systems for Propositional Bimodal Logics of Knowledge and Belief
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
Decidability of SHIQ with complex role inclusion axioms
Artificial Intelligence
Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs
Computational Logic in Multi-Agent Systems
An Efficient Tableau Prover using Global Caching for the Description Logic ALC
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
A Tableau Calculus for Regular Grammar Logics with Converse
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity
Fundamenta Informaticae
Reasoning about epistemic states of agents by modal logic programming
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
An Efficient Tableau Prover using Global Caching for the Description Logic ALC
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
We present a sound and complete tableau calculus for the class of regular grammar logics. Our tableau rules use a special feature called automaton-labelled formulae, which are similar to formulae of automaton propositional dynamic logic. Our calculus is cut-free and has the analytic superformula property so it gives a decision procedure. We show that the known EXPTIME upper bound for regular grammar logics can be obtained using our tableau calculus. We also give an effective Craig interpolation lemma for regular grammar logics using our calculus.