Conjunctive query answering for the description logic SHIQ

Conjunctive query answering for the description logic SHIQ (2007)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Birte Glimm , Ian Horrocks , Carsten Lutz , Uli Sattler

Citations:

86 - 21 self

BibTeX

@INPROCEEDINGS{Glimm07conjunctivequery,
    author = {Birte Glimm and Ian Horrocks and Carsten Lutz and Uli Sattler},
    title = {Conjunctive query answering for the description logic SHIQ},
    booktitle = {},
    year = {2007},
    pages = {399--404}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, it was an open problem whether conjunctive query answering over DL knowledge bases is decidable if transitive roles are admitted in the query. In this paper, we consider conjunctive queries over knowledge bases formulated in the popular DL SHIQ and allow transitive roles in both the query and the knowledge base. We show that query answering is decidable and establish the following complexity bounds: regarding combined complexity, we devise a deterministic algorithm for query answering that needs time single exponential in the size of the KB and double exponential in the size of the query. Regarding data complexity, we prove co-NP-completeness. 1

Citations

395	From SHIQ and RDF to OWL: the making of a web ontology language - Halo, PF, et al. - 2003
360	P.P.: The Description Logic Handbook - Baader, McGuiness, et al. - 2003
279	Practical Reasoning for Expressive Description Logics - Horrocks, Sattler, et al. - 1999
222	On the decidability of query containment under constraints - Calvanese, Giacomo, et al. - 1998
215	Weaving the Web, The Original Design and Ultimate Destiny of the World Wide Web - Berners-Lee - 2000
188	Query Answering for OWL-DL with Rules - Motik, Sattler, et al. - 2004
167	Reducing owl Entailment to Description Logic Satisfiability - Horrocks, Patel-Schneider
151	Description Logic Framework for Information Integration - Calvanese, Giacomo, et al. - 1998
147	Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family - Calvanese, Giacomo, et al.
141	Data complexity of query answering in description logics - Calvanese, Giacomo, et al. - 2006
136	Creating semantic web contents with protégé-2000 - Noy, Sintek, et al.
124	Combining Horn Rules and Description Logics in CARIN - Levy, Rousset - 1998
123	S.: Reasoning with individuals for the description logic SHIQ - Horrocks, Sattler, et al. - 2000
115	Complexity results and practical algorithms for logics in knowledge representation - TOBIES
105	I: FaCT++ Description Logic Reasoner: System Description - Tsarkov, Horrocks
100	A tableaux decision procedure for SHOIQ - Horrocks, Sattler - 2005
95	What are hybrid languages - Blackburn, Seligman - 1998
94	CARIN: A representation language combining Horn rules and description logics - Levy, Rousset - 1996
90	is modal logic so robustly decidable - Why - 1997
83	Conjunctive query containment revisited - Chekuri, Rajaraman - 1997
82	Data complexity of reasoning in very expressive description logics - HUSTADT, MOTIK, et al. - 2005
73	Deduction in concept languages: From subsumption to instance checking - Donini, Lenzerini, et al. - 1994
72	OWL Web ontology language reference - Bechhofer, Harmelen, et al. - 2004
70	Reasoning with individuals in concept languages - Schaerf - 1994
63	DL+log: Tight integration of description logics and disjunctive datalog - Rosati - 2006
62	A conjunctive query language for description logic ABoxes, in - Horrocks, Tessaris
50	How to Decide Query Containment Under Constraints Using a Description Logic - Horrocks, Sattler, et al. - 2000
45	The Problem of Incomplete Information in Relational Databases - Grahne - 1991
42	A Tool for Working with Web Ontologies - Kalyanpur, Parsia, et al. - 2005
40	Questions and answers: reasoning and querying in Description Logic - Tessaris - 2001
37	On the complexity of the instance checking problem in concept languages with existential quantification - Schaerf - 1993
34	T.: Characterizing data complexity for conjunctive query answering in expressive description logics - Ortiz, Calvanese, et al.
29	Unending chess, symbolic dynamics, and a problem in semigroups - Morse, Hedlund - 1944
28	A high performance semantic web query answering engine - Wessel, Möller - 2005
27	On conjunctive query answering in EL - Rosati - 2007
25	Answering regular path queries in expressive description logics: An automata-theoretic approach - Calvanese, Eiter, et al. - 2007
23	A decomposition rule for decision procedures by resolution-based calculi - Hustadt, Motik, et al. - 2004
20	Data complexity of answering unions of conjunctive queries in SHIQ - Ortiz, Calvanese, et al. - 2006
19	Why are modal logics so robustly decidable - Grädel - 2001
16	Inverse roles make conjunctive queries hard - Lutz - 2007
13	Extended query facilities for racer and an application to software-engineering problems - Haarslev, Möller, et al. - 2004
13	Query containment using a DLR ABox - Horrocks, Sattler, et al.
12	On the decidability and finite controllability of query processing in databases with incomplete information - Rosati - 2006
12	The Limits of Querying Ontologies - Rosati - 2007
8	Optimizations for answering conjunctive abox queries - Sirin, Parsia - 2006
6	Narcissists, stepmothers and spies - Marx - 2002
6	Logical approaches to incomplete information: A survey - Horrocks, Meyden, et al. - 1998
5	Ontology reasoning in the SHOQ description logic - Horrocks, Sattler - 2001
4	A Little Semantic Web Goes a Long Way - Wolstencroft, Brass, et al. - 2005
3	Handling cyclic conjunctive queries - Glimm, Horrocks - 2005