| dc.contributor.author | Lukasiewicz, T | |
| dc.contributor.author | Malizia, E | |
| dc.contributor.author | Molinaro, C | |
| dc.date.accessioned | 2018-06-06T13:50:24Z | |
| dc.date.issued | 2018-06 | |
| dc.description.abstract | Several semantics have been proposed to query inconsistent ontological
knowledge bases, including the intersection of repairs and the intersection of closed
repairs as two approximate inconsistency-tolerant semantics. In this paper, we
analyze the complexity of conjunctive query answering under these two semantics
for a wide range of Datalog± languages. We consider both the standard setting,
where errors may only be in the database, and the generalized setting, where also
the rules of a Datalog± knowledge base may be erroneous. | en_GB |
| dc.description.sponsorship | This work was supported by The Alan Turing Institute under the
UK EPSRC grant EP/N510129/1, and by the EPSRC grants EP/R013667/1, EP/L012138/1,
and EP/M025268/1. | en_GB |
| dc.identifier.citation | SEBD 2018: 26th Italian Symposium on Advanced Database Systems (SEBD 2018), 24-27 June 2018, Castellaneta Marina (Taranto), Italy | en_GB |
| dc.identifier.uri | http://hdl.handle.net/10871/33102 | |
| dc.language.iso | en | en_GB |
| dc.publisher | SEBD - Sistemi Evoluti per Basi di Dati | en_GB |
| dc.relation.url | http://www.sebd.org | en_GB |
| dc.rights.embargoreason | Under embargo until 28 June 2018, post completion of the conference | en_GB |
| dc.rights | © 2018 SEBD | en_GB |
| dc.title | Complexity of Approximate Query Answering under Inconsistency in Datalog+/- | en_GB |
| dc.type | Conference paper | en_GB |
| dc.description | This is the author accepted manuscript. The final version is available from the publisher via the link in this record | en_GB |
