Weakening Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity

作者: Anh Linh Nguyen

DOI:

关键词:

摘要:

参考文章(31)
Riccardo Rosati, On Conjunctive Query Answering in EL. Description Logics. ,(2007)
Alexandru Mateescu, Arto Salomaa, Formal languages: an introduction and a synopsis Handbook of formal languages, vol. 1. pp. 1- 39 ,(1997) , 10.1007/978-3-642-59136-5_1
Franz Baader, Carsten Lutz, Sebastian Brandt, Pushing the EL envelope international joint conference on artificial intelligence. pp. 364- 369 ,(2005)
Sebastian Brandt, Polynomial time reasoning in a Description Logic with existential restrictions, GCI axioms, and—what else? european conference on artificial intelligence. pp. 298- 302 ,(2004)
Linh Anh Nguyen, On the Complexity of Fragments of Modal Logics advances in modal logic. pp. 249- 268 ,(2004)
Rajeev Goré, Tableau Methods for Modal and Temporal Logics Handbook of Tableau Methods. pp. 297- 396 ,(1999) , 10.1007/978-94-017-1754-0_6
Andreas Nonnengart, How to Use Modalities and Sorts in Prolog Untitled Event. pp. 365- 378 ,(1994)
Ullrich Hustadt, Boris Motik, Ulrike Sattler, Data complexity of reasoning in very expressive description logics international joint conference on artificial intelligence. pp. 466- 471 ,(2005)
Diego Calvanese, Giuseppe De Giacomo, Daniele Nardi, Maurizio Lenzerini, Reasoning in expressive description logics Handbook of automated reasoning. pp. 1581- 1634 ,(2001) , 10.1016/B978-044450813-3/50025-4
Klaus Schild, Terminological cycles and the propositional µ-calculus principles of knowledge representation and reasoning. pp. 509- 520 ,(1994) , 10.22028/D291-25004