Regular path queries in expressive description logics with nominals (original) (raw)

2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009)

Abstract

Reasoning over complex queries in the DLs underlying OWL 2 is of importance in several application domains. We provide decidability and (tight) upper bounds for the problem of checking entailment and containment of positive regular path queries under various combinations of constructs used in such expressive DLs; specifically: regular expressions and (safe) Booleans over roles, and allowing for the combination of any two constructs among inverse roles, qualified number restrictions, and nominals. Our results ...

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (6)

  1. Baader et al., 2003] Franz Baader, Diego Calvanese, Deborah McGuinness, Daniele Nardi, and Peter F. Patel-Schneider, edi- tors. The Description Logic Handbook: Theory, Implementation and Applications. 2003. [Bonatti et al., 2008] Piero Bonatti, Carsten Lutz, Aniello Murano, and Moshe Y. Vardi. The complexity of enriched µ-calculi. Log- ical Methods in Computer Science, 4(3:11):1-27, 2008. [Calvanese et al., 2000] Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. Containment of con- junctive regular path queries with inverse. In Proc. of KR 2000. [Calvanese et al., 2002] Diego Calvanese, Giuseppe De Giacomo, and Maurizio Lenzerini. 2ATAs make DLs easy. In Proc. of DL 2002, volume 53 of CEUR, ceur-ws.org. [Calvanese et al., 2007] Diego Calvanese, Thomas Eiter, and Mag- dalena Ortiz. Answering regular path queries in expressive de- scription logics: An automata-theoretic approach. In Proc. of AAAI 2007.
  2. Cuenca Grau et al., 2008] Bernardo Cuenca Grau, Ian Horrocks, Boris Motik, Bijan Parsia, Peter Patel-Schneider, and Ulrike Sat- tler. OWL 2: The next step for OWL. J. of Web Semantics, 6(4):309-322, 2008.
  3. Glimm et al., 2008] Birte Glimm, Ian Horrocks, and Ulrike Sattler. Unions of conjunctive queries in SHOQ. In Proc. of KR 2008. [Horrocks et al., 2006] Ian Horrocks, Oliver Kutz, and Ulrike Sat- tler. The even more irresistible SROIQ. In Proc. of KR 2006. [Kazakov, 2008] Yevgeny Kazakov. RIQ and SROIQ are harder than SHOIQ. In Proc. of KR 2008. [Ortiz et al., 2008] Magdalena Ortiz, Diego Calvanese, and Thomas Eiter. Data complexity of query answering in expressive description logics via tableaux. J. of Automated Reasoning, 41(1):61-98, 2008.
  4. Ortiz, 2008] Magdalena Ortiz. An automata-based algorithm for description logics around SRIQ. In Proc. of LANMR 2008, vol- ume 408 of CEUR, ceur-ws.org.
  5. Pratt-Hartmann, 2008] Ian Pratt-Hartmann. Data complexity of the two-variable fragment with counting quantifiers. Available at http://arxiv.org/abs/0806.1636/, 2008. [Rudolph et al., 2008] Sebastian Rudolph, Markus Krötzsch, and Pascal Hitzler. Cheap boolean role constructors for description logics. In Proc. of JELIA 2008, volume 5293 of LNCS. [Sattler and Vardi, 2001] Ulrike Sattler and Moshe Y. Vardi. The hybrid µ-calculus. In Proc. of IJCAR 2001, pages 76-91.
  6. Tobies, 2000] Stephan Tobies. The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. J. of Artificial Intelligence Research, 12:199-217, 2000.