Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases

DOI10.1613/jair.1.11395zbMath1489.68267OpenAlexW2922066636WikidataQ128242585 ScholiaQ128242585MaRDI QIDQ3121510

Meghyn Bienvenu, François Goasdoué, Camille Bourgaux

Publication date: 18 March 2019

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11395

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (8)

Inconsistency-tolerant query answering for existential rules ⋮ An argumentative approach for handling inconsistency in prioritized Datalog ± ontologies ⋮ Selecting accepted assertions in partially ordered inconsistent DL-Lite knowledge bases ⋮ On the Complexity of Finding Set Repairs for Data-Graphs ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ A model of three-way decisions for knowledge harnessing ⋮ Query answering over inconsistent knowledge bases: a probabilistic approach ⋮ Preference-based inconsistency-tolerant query answering under existential rules

This page was built for publication: Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases