Filters








3,095 Hits in 7.4 sec

Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics

Meghyn Bienvenu, Camille Bourgaux, François Goasdoué
2014 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Recently several inconsistency-tolerant semantics have been introduced for querying inconsistent description logic knowledge bases.  ...  We analyze the complexity of query answering under the resulting semantics, focusing on the lightweight logic DL-Lite_R.  ...  To address this issue, several different inconsistencytolerant semantics have been proposed for querying inconsistent DL knowledge bases.  ... 
doi:10.1609/aaai.v28i1.8855 fatcat:mrur5roeo5cy3g5t6hxs2vpbwi

Query-driven Repairing of Inconsistent DL-Lite Knowledge Bases (Extended Abstract)

Meghyn Bienvenu, Camille Bourgaux, François Goasdoué
2016 International Workshop on Description Logics  
Ranking the remaining relevant assertions based on their impact is time consuming, so we plan to optimize impact computation. Acknowledgements This work was supported by contract ANR-12-JS02-007-01.  ...  We consider the following scenario: a user poses conjunctive queries against a possibly inconsistent DL-Lite R knowledge base (KB) and receives the sets of possible answers (i.e. those holding under brave  ...  The DL-Lite family of description logics [8] , which underlies the OWL 2 QL profile [20] , has garnered significant interest as it allows OMQA to be reducedto standard database query evaluation.  ... 
dblp:conf/dlog/BienvenuBG16 fatcat:zhgb3msc5jcsdfcb67oicoompm

Special Issue on Challenges for Reasoning under Uncertainty, Inconsistency, Vagueness, and Preferences

Gabriele Kern-Isberner, Thomas Lukasiewicz
2017 Künstliche Intelligenz  
Tabia investigate different approaches for handling inconsistent knowledge bases in the description logic DL-Lite when the ABox is prioritized and inconsistent with the TBox.  ...  In "Polynomial algorithms for computing a single preferred assertional-based repair"  ...  Tabia investigate different approaches for handling inconsistent knowledge bases in the description logic DL-Lite when the ABox is prioritized and inconsistent with the TBox.  ... 
doi:10.1007/s13218-016-0479-z fatcat:rdduceqyzzatljzzbmlo2vhjty

Explaining Query Answers under Inconsistency-Tolerant Semantics over Description Logic Knowledge Bases (Extended Abstract)

Meghyn Bienvenu, Camille Bourgaux, François Goasdoué
2015 International Workshop on Description Logics  
The problem of querying description logic (DL) knowledge bases (KBs) using database-style queries (in particular, conjunctive queries) has been a major focus of recent DL research.  ...  Query answering under AR semantics amounts to considering those answers (w.r.t. standard semantics) that can be obtained from every repair, the latter being defined as an inclusion-maximal subset of the  ...  To help the user understand this classification, we introduce the notion of explanation for positive and negative query answers under brave, AR, and IAR semantics.  ... 
dblp:conf/dlog/BienvenuBG15 fatcat:w2cccxxttraoziawipadc746l4

Reasoning in inconsistent prioritized knowledge bases: an argumentative approach

Loan Thi-Thuy Ho, Somjit Arch-int, Ngamnij Arch-int
2022 International Journal of Power Electronics and Drive Systems (IJPEDS)  
<p>A study of query answering in prioritized ontological knowledge bases (KBs) has received attention in recent years.  ...  While several semantics of query answering have been proposed and their complexity is rather well-understood, the problem of explaining inconsistency-tolerant query answers has paid less attention.  ...  DL-Lite R KBs under preferred repair semantics.  ... 
doi:10.11591/ijece.v12i3.pp2944-2954 fatcat:2aabpm7n7rd6jhlyrnj65ymvcy

Inconsistency-Tolerant Semantics for Description Logics [chapter]

Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati, Marco Ruzzi, Domenico Fabio Savo
2010 Lecture Notes in Computer Science  
We address the problem of dealing with inconsistencies in Description Logic (DL) knowledge bases.  ...  Our general goal is both to study DL semantical frameworks which are inconsistency-tolerant, and to devise techniques for answering unions of conjunctive queries posed to DL knowledge bases under such  ...  In this paper, we address the problem of dealing with inconsistencies in Description Logic (DL) knowledge bases.  ... 
doi:10.1007/978-3-642-15918-3_9 fatcat:lmy7rixntjd77lvm4oh5lbw6ba

An Empirical Evaluation of Argumentation in Explaining Inconsistency-Tolerant Query Answering

Abdelraouf Hecham, Abdallah Arioua, Gem Stapleton, Madalina Croitoru
2017 International Workshop on Description Logics  
tolerant semantics in existential rules knowledge bases?"  ...  In this paper we answer empirically the following research question: "Are dialectical explanation methods more effective than one-shot explanation methods for Intersection of Closed Repairs inconsistency  ...  For each situation, the user is presented with a textual description of the inconsistent knowledge base that is as faithful as possible to the underlying logical formalism.  ... 
dblp:conf/dlog/HechamASC17 fatcat:eccztgdivfh33igyp5wgfjwczi

Query Answering with Inconsistent Existential Rules under Stable Model Semantics

Hai Wan, Heng Zhang, Peng Xiao, Haoran Huang, Yan Zhang
2016 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
repair semantics remain the same as that under the conventional query answering semantics.  ...  In this paper we present a framework of handling inconsistent existential rules under stable model semantics, which is defined by a notion called rule repairs to select maximal components of the existential  ...  , and Guangzhou Science and Technology Project under grant 2013J4100058.  ... 
doi:10.1609/aaai.v30i1.10085 fatcat:6wu4wm3yuneqxmnk6gajr226by

Query Answering with Inconsistent Existential Rules under Stable Model Semantics [article]

Hai Wan, Heng Zhang, Peng Xiao, Haoran Huang, Yan Zhang
2016 arXiv   pre-print
repair semantics remain the same as that under the conventional query answering semantics.  ...  Traditional inconsistency-tolerent query answering in ontology-based data access relies on selecting maximal components of an ABox/database which are consistent with the ontology.  ...  Hai Wan's research was in part supported by the National Natural Science Foundation of China under grant 61573386, Natural Science Foundation of Guangdong Province of China under grant S2012010009836,  ... 
arXiv:1602.05699v1 fatcat:llhuma2bvjg4xlpdbdabnlr7uq

Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation

Meghyn Bienvenu, Camille Bourgaux
2020 Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning  
After transferring the notions of globally-, Pareto- and completion-optimal repairs to our setting, we study the data complexity of the core reasoning tasks: query entailment under inconsistency-tolerant  ...  semantics based upon optimal repairs, existence of a unique optimal repair, and enumeration of all optimal repairs.  ...  Our first contribution is a data complexity analysis of the central reasoning problems related to optimal repairs: conjunctive query entailment under inconsistency-tolerant semantics based upon optimal  ... 
doi:10.24963/kr.2020/15 dblp:conf/kr/BienvenuB20 fatcat:el6cutd2azgcppde57v3aud7zm

Preference-based Inconsistency-Tolerant Query Answering under Existential Rules

Marco Calautti, Sergio Greco, Cristian Molinaro, Irina Trubitsyna
2020 Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning  
In this paper, we propose a framework for querying inconsistent knowledge bases under user preferences for existential rule languages.  ...  Query answering over inconsistent knowledge bases is a problem that has attracted a great deal of interest over the years.  ...  To deal with the scenarios discussed above, we propose a framework for querying inconsistent knowledge bases under user preferences.  ... 
doi:10.24963/kr.2020/21 dblp:conf/kr/CalauttiGMT20 fatcat:q6pjo5rkbnbvtolkneia4rdbhm

Knowledge Base Repair: From Active Integrity Constraints to Active TBoxes

Guillaume Feuillade, Andreas Herzig, Christos Rantsoudis
2020 International Workshop on Description Logics  
We then discuss how these ideas can be adapted to Description Logics.  ...  We assume extensions of TBox axioms by update actions that denote the preferred ways an ABox should be repaired in case of inconsistency with the axioms of the TBox.  ...  The TBoxes of Description Logic knowledge bases bear resemblances with integrity constraints.  ... 
dblp:conf/dlog/FeuilladeHR20 fatcat:y5my73cbcrcy5cbqzjsw4s5kqm

Lexicographic Repair Under Querying Prioritised DL-Lite Knowledge Bases

Telli Abdelmoutia, Hamdi Ghassen, Omri Nazih
2021 Basic and Applied Sciences - Scientific Journal of King Faisal University  
This article discusses the issue of inconsistency in responses from various DL-Lite knowledge bases.  ...  for non-defeat repair based on lexicography of possible inconsistent responses.  ...  Note that all DL-Lite knowledge bases can be written as a First-Order Logic (FOL) knowledge base. In addition, we share the semantics of DL-Lite knowledge bases.  ... 
doi:10.37575/b/sci/0054 fatcat:67u4fqmntbc5tb2lhxuwvehzbe

Knowledge Engineering for Intelligent Decision Support

María Vanina Martínez
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
Knowledge can be seen as the collection of skills and information an individual (or group) has acquired through experience, while intelligence as the ability to apply such knowledge.  ...  However, in order to achieve real artificial intelligence we need to go beyond data and knowledge representation, and deeper into how such a system could, and would, use available knowledge in order to  ...  Acknowledgments This work has been partially supported by EU H2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 690974 for the project MIREL: MIning and REasoning  ... 
doi:10.24963/ijcai.2017/736 dblp:conf/ijcai/Martinez17 fatcat:cgxriw3cs5cjhaciauodhjptse

Conflict-Based Inconsistency-Tolerant Query Answering

Rim Mohamed, Zied Bouraoui, Zied Loukil, Faiez Gargouri
2022 Proceedings of the ... International Florida Artificial Intelligence Research Society Conference  
Existing inconsistency-tolerant semantics typically consist in selecting some of (maximal) consistent subsets of facts, called repairs.  ...  In this paper, we place ourselves in the context of inconsistency-tolerant query answering over lightweight ontologies, which aims to query a set of conflicting facts using an ontology that represents  ...  Definition 2 Let K = ⟨T , A⟩ be a DL-Lite ontology, the most common inconsistency-tolerant semantics are: • ABox Repair Semantics: A tuple a is an answer to a query q under AR semantics, denoted K |= AR  ... 
doi:10.32473/flairs.v35i.130702 fatcat:6j7zxprehrgs3nvhrt3jb5c42u
« Previous Showing results 1 — 15 out of 3,095 results