论文信息 - Inverse Roles Make Conjunctive Queries Hard

Inverse Roles Make Conjunctive Queries Hard

Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering in expressive DLs have never been obtained: all known algorithms run in deterministic double exponential time, but the existing lower bound is only an EXPTIME one. In this paper, we prove that conjunctive query answering in ALCI is 2-EXPTIME-hard (and thus complete), and that it becomes NEXPTIME-complete under some reasonable assumptions.

Carsten Lutz | C. Lutz

[1] Diego Calvanese,et al. The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[2] Boris Motik,et al. Data Complexity of Reasoning in Very Expressive Description Logics , 2005, IJCAI.

[3] C. Lutz. The Complexity of Reasoning with Concrete Domains , 1999 .

[4] Ian Horrocks,et al. Reasoning with Individuals for the Description Logic SHIQ , 2000, CADE.

[5] Diego Calvanese,et al. Data Complexity of Query Answering in Description Logics , 2006, Description Logics.

[6] Ian Horrocks,et al. Conjunctive Query Answering for Description Logics with Transitive Roles , 2006, Description Logics.

[7] Diego Calvanese,et al. Dwq : Esprit Long Term Research Project, No 22469 on the Decidability of Query Containment under Constraints on the Decidability of Query Containment under Constraints , 2022 .

[8] Ian Horrocks,et al. Keys, Nominals, and Concrete Domains , 2003, IJCAI.

[9] Andrea Schaerf,et al. On the complexity of the instance checking problem in concept languages with existential quantification , 1993, Journal of Intelligent Information Systems.

[10] Ian Horrocks,et al. Conjunctive Query Answering for the Description Logic SHIQ , 2007, IJCAI.

[11] Diego Calvanese,et al. Data Complexity of Answering Unions of Conjunctive Queries in SHIQ , 2006, Description Logics.