Regular path queries in expressive description logics with nominals

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 714-720

  Calvanese, Diego ^a   Eiter, Thomas ^b   Ortiz, Magdalena ^b  

^a FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BIRDS; DATA DESCRIPTION; INVERSE PROBLEMS;

COMPLEX QUERIES; DIRECT IMPACT; EXPRESSIVE DESCRIPTION LOGIC; NUMBER RESTRICTIONS; REGULAR EXPRESSIONS; REGULAR PATH QUERIES; UPPER BOUND;

QUERY PROCESSING;

EID: 78651421669     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

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