Mostrar el registro sencillo del ítem
dc.contributor.author
Lukasiewicz, Thomas
dc.contributor.author
Malizia, Enrico
dc.contributor.author
Martinez, Maria Vanina
dc.contributor.author
Molinaro, Cristian
dc.contributor.author
Pieris, Andreas
dc.contributor.author
Simari, Gerardo
dc.date.available
2022-07-12T11:50:11Z
dc.date.issued
2022-06
dc.identifier.citation
Lukasiewicz, Thomas; Malizia, Enrico; Martinez, Maria Vanina; Molinaro, Cristian; Pieris, Andreas; et al.; Inconsistency-tolerant query answering for existential rules; Elsevier Science; Artificial Intelligence; 307; 6-2022; 1-39
dc.identifier.issn
0004-3702
dc.identifier.uri
http://hdl.handle.net/11336/161826
dc.description.abstract
Querying inconsistent knowledge bases is an intriguing problem that gave rise to a flourishing research activity in the knowledge representation and reasoning community during the last years. It has been extensively studied in the context of description logics (DLs), and its computational complexity is rather well-understood. Although DLs are popular formalisms for modeling ontologies, it is generally agreed that rule-based ontologies are well-suited for data-intensive applications, since they allow us to conveniently deal with higher-arity relations, which naturally occur in standard relational databases. The goal of this work is to perform an in-depth complexity analysis of querying inconsistent knowledge bases in the case of the main decidable classes of existential rules, based on the notions of guardedness, linearity, acyclicity, and stickiness, enriched with negative (a.k.a. denial) constraints. Our investigation concentrates on three central inconsistency-tolerant semantics: the ABox repair (AR) semantics, considered as the standard one, and its main sound approximations, the intersection of repairs (IAR) semantics and the intersection of closed repairs (ICR) semantics.
dc.format
application/pdf
dc.language.iso
eng
dc.publisher
Elsevier Science
dc.rights
info:eu-repo/semantics/restrictedAccess
dc.rights.uri
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.subject
COMPUTATIONAL COMPLEXITY
dc.subject
CONJUNCTIVE QUERIES
dc.subject
INCONSISTENCY
dc.subject
QUERY ANSWERING
dc.subject
RULE-BASED ONTOLOGIES
dc.subject
SEMANTICS
dc.subject.classification
Ciencias de la Computación
dc.subject.classification
Ciencias de la Computación e Información
dc.subject.classification
CIENCIAS NATURALES Y EXACTAS
dc.title
Inconsistency-tolerant query answering for existential rules
dc.type
info:eu-repo/semantics/article
dc.type
info:ar-repo/semantics/artículo
dc.type
info:eu-repo/semantics/publishedVersion
dc.date.updated
2022-07-04T19:18:28Z
dc.journal.volume
307
dc.journal.pagination
1-39
dc.journal.pais
Países Bajos
dc.journal.ciudad
Amsterdam
dc.description.fil
Fil: Lukasiewicz, Thomas. University of Oxford; Reino Unido
dc.description.fil
Fil: Malizia, Enrico. Università di Bologna; Italia
dc.description.fil
Fil: Martinez, Maria Vanina. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina
dc.description.fil
Fil: Molinaro, Cristian. Università della Calabria; Italia
dc.description.fil
Fil: Pieris, Andreas. University of Edinburgh; Reino Unido
dc.description.fil
Fil: Simari, Gerardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Ciencias e Ingeniería de la Computación. Universidad Nacional del Sur. Departamento de Ciencias e Ingeniería de la Computación. Instituto de Ciencias e Ingeniería de la Computación; Argentina
dc.journal.title
Artificial Intelligence
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.artint.2022.103685
dc.relation.alternativeid
info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S000437022200025X
Archivos asociados