Conflict-Based Inconsistency-Tolerant Query Answering

نویسندگان

چکیده

In this paper, we place ourselves in the context of inconsistency-tolerant query answering over lightweight ontologies, which aims to a set conflicting facts using an ontology that represents generic knowledge about particular domain. Existing semantics typically consist selecting some (maximal) consistent subsets facts, called repairs. We explore novel strategy select most relevant repairs based on stratification assertional base into priority levels automatically induce from ontology. propose method exploits conflict statistical regularities between embedding, each fact is represented by vector. Based Euclidean distances classify assertions reliable least important ones. then use these define Interestingly enough, show obtained repair done polynomial time.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inconsistency-tolerant query answering in ontology-based data access

Ontology-based data access (OBDA) is receiving great attention as a new paradigm for managing information systems through semantic technologies. According to this paradigm, a Description Logic ontology provides an abstract and formal representation of the domain of interest to the information system, and is used as a sophisticated schema for accessing the data and formulating queries over them....

متن کامل

A General Modifier-Based Framework for Inconsistency-Tolerant Query Answering

We propose a general framework for inconsistency-tolerant query answering within existential rule setting. This framework unifies the main semantics proposed by the state of art and introduces new ones based on cardinality and majority principles. It relies on two key notions: modifiers and inference strategies. An inconsistency-tolerant semantics is seen as a composite modifier plus an inferen...

متن کامل

Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis

Generalising the state of the art, an inconsistency-tolerant semantics can be seen as a couple composed of a modifier operator and an inference strategy. In this paper we deepen the analysis of such general setting and focus on two aspects. First, we investigate the rationality properties of such semantics for existential rule knowledge bases. Second, we unfold the broad landscape of complexity...

متن کامل

Practical Query Answering in Data Exchange Under Inconsistency-Tolerant Semantics

Exchange-repair semantics (or, XR-Certain semantics) is a recently proposed inconsistency-tolerant semantics in the context of data exchange. This semantics makes it possible to provide meaningful answers to target queries in cases in which a given source instance cannot be transformed into a target instance satisfying the constraints of the data exchange specification. It is known that computi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... International Florida Artificial Intelligence Research Society Conference

سال: 2022

ISSN: ['2334-0762', '2334-0754']

DOI: https://doi.org/10.32473/flairs.v35i.130702