Inconsistency-Tolerant Conjunctive Query Answering for Simple Ontologies

[1]  Jef Wijsen,et al.  On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases , 2010, PODS '10.

[2]  Francesco M. Donini,et al.  Deduction in Concept Languages: From Subsumption to Instance Checking , 1994, J. Log. Comput..

[3]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[4]  Diego Calvanese,et al.  The DL-Lite Family and Relations , 2009, J. Artif. Intell. Res..

[5]  Maurizio Lenzerini,et al.  Inconsistency-Tolerant Semantics for Description Logics , 2010, RR.

[6]  Jan Chomicki,et al.  Consistent Query Answering: Five Easy Pieces , 2007, ICDT.

[7]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[8]  Jan Chomicki,et al.  Consistent query answers in inconsistent databases , 1999, PODS '99.

[9]  Renée J. Miller,et al.  First-order query rewriting for inconsistent databases , 2005, J. Comput. Syst. Sci..

[10]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[11]  Riccardo Rosati,et al.  On the Complexity of Dealing with Inconsistency in Description Logic Ontologies , 2011, IJCAI.

[12]  Maurizio Lenzerini,et al.  Query Rewriting for Inconsistent DL-Lite Ontologies , 2011, RR.

[13]  Sebastian Rudolph,et al.  Reasoning-Supported Interactive Revision of Knowledge Bases , 2011, IJCAI.

[14]  Meghyn Bienvenu,et al.  First-Order Expressibility Results for Queries over Inconsistent DL-Lite Knowledge Bases , 2011, Description Logics.

[15]  Riccardo Rosati,et al.  Consistent query answering under key and exclusion dependencies: algorithms and experiments , 2005, CIKM '05.