Tractable Approximations of Consistent Query Answering for Robust Ontology-based Data Access. Bienvenu, M. & Rosati, R. In IJCAI, 2013. IJCAI/AAAI.
Tractable Approximations of Consistent Query Answering for Robust Ontology-based Data Access. [link]Paper  Tractable Approximations of Consistent Query Answering for Robust Ontology-based Data Access. [link]Link  abstract   bibtex   
A robust system for ontology-based data access should provide meaningful answers to queries even when the data conflicts with the ontology. This can be accomplished by adopting an inconsistency-tolerant semantics, with the consistent query answering (CQA) semantics being the most prominent example. Unfortunately, query answering under the CQA semantics has been shown to be computationally intractable, even when extremely simple ontology languages are considered. In this paper, we address this problem by proposing two new families of inconsistency-tolerant semantics which approximate the CQA semantics from above and from below and converge to it in the limit. We study the data complexity of conjunctive query answering under these new semantics, and show a general tractability result for all known first-order rewritable ontology languages. We also analyze the combined complexity of query answering for ontology languages of the DL-Lite family
@inproceedings{ conf/ijcai/BienvenuR13,
  abstract = {A robust system for ontology-based data access should provide meaningful answers to queries even 
  when the data conflicts with the ontology. This can be accomplished by adopting an inconsistency-tolerant semantics, with the 
  consistent query answering (CQA) semantics being the most prominent example. Unfortunately, query answering under the CQA 
  semantics has been shown to be computationally intractable, even when extremely simple ontology languages are considered. 
  In this paper, we address this problem by proposing two new families of inconsistency-tolerant semantics which 
  approximate the CQA semantics from above and from below and converge to it in the limit. We study the data complexity of 
  conjunctive query answering under these new semantics, and show a general tractability result for all known first-order 
  rewritable ontology languages. We also analyze the combined complexity of query answering for ontology languages of the DL-Lite family},
  added-at = {2014-06-02T12:08:59.000+0200},
  audience = {academic},
  author = {Bienvenu, Meghyn and Rosati, Riccardo},
  biburl = {http://www.bibsonomy.org/bibtex/2486a7e215d843130da556f51412c705d/savo.fabio},
  booktitle = {IJCAI},
  editor = {Rossi, Francesca},
  ee = {http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6904},
  interhash = {7576ed5df0f10357892294ee9738afc2},
  intrahash = {486a7e215d843130da556f51412c705d},
  isbn = {978-1-57735-633-2},
  keywords = {optique-project},
  partneroptique = {UNIROMA1},
  publisher = {IJCAI/AAAI},
  title = {Tractable Approximations of Consistent Query Answering for Robust Ontology-based Data Access.},
  url = {http://dblp.uni-trier.de/db/conf/ijcai/ijcai2013.html#BienvenuR13},
  wpoptique = {WP4},
  year = {2013},
  yearoptique = {Y1}
}

Downloads: 0