Multimodal logic programming using equational and order-sorted logic
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
Formal languages: an introduction and a synopsis
Handbook of formal languages, vol. 1
Constructing the least models for positive modal logic programs
Fundamenta Informaticae
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
How to Use Modalities and Sorts in Prolog
JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
Reasoning in expressive description logics
Handbook of automated reasoning
Deciding Regular Grammar Logics with Converse Through First-Order Logic
Journal of Logic, Language and Information
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
Journal of Automated Reasoning
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Complexity boundaries for horn description logics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Decidability of SHIQ with complex role inclusion axioms
Artificial Intelligence
Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic
International Journal of Approximate Reasoning
Approximating horn knowledge bases in regular description logics to have PTIME data complexity
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Data complexity in the ƐL family of description logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Conjunctive queries for a tractable fragment of OWL 1.1
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
A bottom-up method for the deterministic horn fragment of the description logic ALC
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
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
On the web ontology rule language OWL 2 RL
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part I
HornDL: an expressive horn description logic with PTime data complexity
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
| Hi-index | 0.00 |
Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data complexity of the instance checking problem is coNP-complete even for Horn knowledge bases in the basic description logic ALC. In this paper, we present and study weakenings with PTIME data complexity of the instance checking problem for Horn knowledge bases in regular description logics. We also study cases when the weakenings are an exact approximation. In contrast to previous related work of other authors, our approach deals with the case when the constructor ∀ is allowed in premises of program clauses that are used as terminological axioms.