Filters








10,434 Hits in 11.6 sec

Explaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases

Meghyn Bienvenu, Camille Bourgaux, François Goasdoué
2016 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Several inconsistency-tolerant semantics have been introduced for querying inconsistent description logic knowledge bases.  ...  This paper addresses the problem of explaining why a tuple is a (non-)answer to a query under such semantics.  ...  Introduction Description logic (DL) knowledge bases (KBs) consist of a TBox (ontology) that provides conceptual knowledge about the application domain and an ABox (dataset) that contains facts about particular  ... 
doi:10.1609/aaai.v30i1.10092 fatcat:fpbmwaxr35h63n3n4n46hsun3m

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.  ...  As such errors may render the KB inconsistent, several inconsistency-tolerant semantics have been introduced in order to provide meaningful answers to queries posed over inconsistent KBs.  ...  Explanation facilities are all the more essential when using inconsistency-tolerant semantics, as recently argued in [1, 2] .  ... 
dblp:conf/dlog/BienvenuBG15 fatcat:w2cccxxttraoziawipadc746l4

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

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.  ...  In oder to represent and reason over ontologies, the focus has been placed on logical formalisms such as description logics [5] and rule-based languages (also called Datalog ± ) [6] .  ... 
doi:10.11591/ijece.v12i3.pp2944-2954 fatcat:2aabpm7n7rd6jhlyrnj65ymvcy

On Conceptual Graphs and Explanation of Query Answering under Inconsistency [chapter]

Abdallah Arioua, Nouredine Tamani, Madalina Croitoru
2014 Lecture Notes in Computer Science  
We present different explanation heuristics of query answering under inconsistency and show how they can be implemented under the Conceptual Graphs editor COGUI.  ...  In this paper we are interested in the use of Conceptual Graphs in the setting of Ontology Based Data Access, and, more specifically, in reasoning in the presence of inconsistency.  ...  More precisely we are interested in explaining why a query α is ICR-entailed by an inconsistent knowledge base K.  ... 
doi:10.1007/978-3-319-08389-6_6 fatcat:zqlqcfjsfbagrh2punlzpczx7u

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  ...  In the last years there has been much interest on defining inconsistency-tolerant semantics for query answering in Description Logics (DLs) [Lembo et al., 2010; Bienvenu, 2012] .  ... 
doi:10.24963/ijcai.2017/736 dblp:conf/ijcai/Martinez17 fatcat:cgxriw3cs5cjhaciauodhjptse

Querying of Several DL-Lite Knowledge Bases from Various Information Sources-based Polynomial Response Unification Approach

Ghassen Hamdi, Abdelmoutia Telli, Mohamed Nazih Omri
2020 Journal of King Saud University: Computer and Information Sciences  
We introduce the management of this inconsistency problem to query the inconsistent DL-Lite knowledge bases.  ...  In this article, we proceed directly to a knowledge base query to retrieve an exhaustive list of responses and then, once these responses are retrieved, we repair them.  ...  over arbitrary DLs for answering queries over inconsistent DL knowledge bases.  ... 
doi:10.1016/j.jksuci.2020.06.002 fatcat:ynhbrgv2mfbo3k6xdr7tdc67ia

Dealing with Inconsistency When Combining Ontologies and Rules Using DL-Programs [chapter]

Jörg Pührer, Stijn Heymans, Thomas Eiter
2010 Lecture Notes in Computer Science  
Description Logic Programs (DL-programs) have been introduced to combine ontological and rule-based reasoning in the context of the Semantic Web.  ...  A DL-program loosely combines a Description Logic (DL) ontology with a non-monotonic logic program (LP) such that dedicated atoms in the LP, called DL-atoms, allow for a bidirectional flow of knowledge  ...  Informally, a DL-program consists of a Description Logic ontology Φ over Σ o and a normal program Π over Σ p , which may contain queries to Φ.  ... 
doi:10.1007/978-3-642-13486-9_13 fatcat:zyyd7brprffx3plcpec6tdkhbu

Recursive algorithms to repair prioritized and inconsistent dl-lite knowledge base [article]

Ghassen Hamdi and Abdelmoutia Telli and Mohamed Nazih Omri
2019 arXiv   pre-print
We introduce the handling of this inconsistency problem to query inconsistent DL-Lite knowledge bases.  ...  However, our algorithm, on proceeds directly with an interrogation of the knowledge base in order to recover an exhaustive list of answers to a given query.  ...  [8, 9, 10] ), deal with the problem of querying inconsistent DL KBs by proposing several inconsistency-tolerant inferences, called semantics, and were introduced for the lightweight description logic  ... 
arXiv:1912.02898v1 fatcat:5qyd7t23frhtflcijdvdqwgqye

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

Semantic Technologies for Situation Awareness

Franz Baader, Stefan Borgwardt, Patrick Koopmann, Veronika Thost, Anni-Yasmin Turhan
2020 Künstliche Intelligenz  
The general idea was to formalize situations as ontology-mediated queries, but in order to express the relevant situations, both the employed ontology language and the query language had to be extended  ...  These queries are answered over the fact base, using the definitions and constraints contained in the ontology.  ...  this SQL query over the fact base (without ontology).  ... 
doi:10.1007/s13218-020-00694-3 fatcat:xcoxluhqdvbjvfbelzrrjesvpi

Explanations for Inconsistency-Tolerant Query Answering under Existential Rules

Thomas Lukasiewicz, Enrico Malizia, Cristian Molinaro
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
Querying inconsistent knowledge bases is a problem that has attracted a great deal of interest over the last decades.  ...  In particular, explaining query answers allows users to understand not only what is entailed by an inconsistent knowledge base, but also why.  ...  To provide meaningful answers to users' queries in the presence of inconsistency, different inconsistency-tolerant semantics of query answering have been proposed over the years.  ... 
doi:10.1609/aaai.v34i03.5682 fatcat:jdsuiynrvndv7liiy4jh4jpphu

Managing Data through the Lens of an Ontology

Maurizio Lenzerini
2018 The AI Magazine  
While the amount of data stored in current information systems continuously grows, and the processes making use of such data become more and more complex, extracting knowledge and getting insights from  ...  Indeed, it is not surprising that data scientists spend a comparatively large amount of time in the data preparation phase of a project, compared with the data minining and knowledge discovery phase.  ...  His current projects focus on Ontology-based Data Management, whose long-term goal is to exploit Knowledge Repreentation and Automated Reasoning techniques for addressing data access and integration issues  ... 
doi:10.1609/aimag.v39i2.2802 fatcat:6zqwnid4qzbcnfhrxg223eamb4

Efficient Federated Debugging of Lightweight Ontologies [chapter]

Andreas Nolle, Christian Meilicke, Heiner Stuckenschmidt, German Nemirovski
2014 Lecture Notes in Computer Science  
been developed for processing of locally available knowledge bases.  ...  We further explain how these queries can be used for pinpointing those assertions that cause inconsistencies and discuss finally some experimental evaluation results of our implementation.  ...  Inconsistency in Description Logics In Description Logics (DLs) [4] a knowledge base K = T , A consists of a TBox T , the intensional knowledge part, and an ABox A, the extensional knowledge part.  ... 
doi:10.1007/978-3-319-11113-1_17 fatcat:g2bnxbi7bnhazev6dmcxqhzfta

Inconsistency-tolerant query answering in ontology-based data access

Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati, Marco Ruzzi, Domenico Fabio Savo
2015 Journal of Web Semantics  
Our general goal is both to study DL semantical frameworks that are inconsistency-tolerant, and to devise techniques for answering unions of conjunctive queries under such inconsistency-tolerant semantics  ...  Given a DL language L, an L knowledge base, or simply a DL knowledge base when L is clear from the context, over an alphabet Γ is a pair K = T , A , where: • T , called the TBox of K, is a finite set of  ...  In particular, since an inconsistent logical theory has no classical model, it logically implies every formula (ex falso quodlibet), and therefore query answering over an inconsistent knowledge base becomes  ... 
doi:10.1016/j.websem.2015.04.002 fatcat:kcrhpvmymzaonmngkey5i43pkq
« Previous Showing results 1 — 15 out of 10,434 results