Query answering in the horn fragments of the description logics SHOIQ and SROIQ

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 1039-1044

  Ortiz, Magdalena ^a   Rudolph, Sebastian ^b   Šimkus, Mantas ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINED COMPLEXITY; CONJUNCTIVE QUERIES; DATA COMPLEXITY; DESCRIPTION LOGIC; EXPRESSIVE DESCRIPTION LOGIC; QUERY ANSWERING; REGULAR PATH QUERIES; STANDARD REASONING;

ARTIFICIAL INTELLIGENCE; COMPUTABILITY AND DECIDABILITY; FORMAL LANGUAGES; QUERY LANGUAGES;

DATA DESCRIPTION;

EID: 84865830031     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-178     Document Type: Conference Paper

References (12)

1. T. Eiter, G. Gottlob, M. Ortiz, and M. Šimkus. Query answering in the description logic Horn-SHIQ. In Proc. JELIA'08, pages 166-179, 2008.
2. T. Eiter, C. Lutz, M. Ortiz, and M. Šimkus. Query answering in description logics with transitive roles. In Proc. IJCAI'09, pages 759-764, 2009.
3. U. Hustadt, B. Motik, and U. Sattler. Data complexity of reasoning in very expressive description logics. In Proc. IJCAI'05, pages 466-471, 2005.
4. Y. Kazakov. RIQ and SROIQ are harder than SHOIQ. In Proc. KR'08, pages 274-284, 2008.
5. M. Krötzsch, S. Rudolph, and P. Hitzler. Complexity boundaries for Horn description logics. In Proc. AAAI'07, pages 452-457, 2007.
6. Carsten Lutz. The complexity of conjunctive query answering in expressive description logics. In Proc. IJCAR'08, pages 179-193, 2008.
7. M. Ortiz, S. Rudolph, and M. Šimkus. Query answering is undecidable in dls with regular expressions, inverses, nominals, and counting. Technical Report INFSYS RR- 1843-10-03, TU Vienna, April 2010.
8. M. Ortiz, S. Rudolph, and M. Šimkus. Worstcase optimal reasoning for the Horn-DL fragments of OWL 1 and 2. In Proc. KR'10, 2010.
9. W3C OWL Working Group. OWL 2 Web Ontology Language: Document Overview. W3C Recommendation, 27 October 2009.
10. S. Rudolph and B. Glimm. Nominals, inverses, counting, and conjunctive queries or: Why infinity is your friend! J. Artif. Intell. Res. (JAIR), 39:429-481, 2010.
11. S. Tobies. The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. J. Artif. Intell. Res. (JAIR), 12:199-217, 2000.
12. Moshe Y. Vardi. Reasoning about the past with twoway automata. In ICALP'98, pages 628-641. Springer, 1998.