A Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL

2009 ◽  
pp. 146-162 ◽  
Author(s):  
Jianfeng Du ◽  
Guilin Qi ◽  
Jeff Z. Pan ◽  
Yi-Dong Shen
Keyword(s):  
Query Answering ◽  
Conjunctive Query

An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆

2021 ◽  
Vol 178 (4) ◽  
pp. 315-346
Author(s):  
Domenico Cantone ◽  
Marianna Nicolosi-Asmundo ◽  
Daniele Francesco Santamaria
Keyword(s):  
Semantic Web ◽  
Set Theory ◽  
Description Logic ◽  
Knowledge Bases ◽  
Query Answering ◽  
Conjunctive Query ◽  
Classification Problems ◽  
Previous Version ◽  
Decidable Fragment ◽  
Stratified Set

We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic 𝒟ℒ〈4LQSR,×〉(D) (𝒟ℒD4,×, for short). Our application solves the main TBox and ABox reasoning problems for 𝒟ℒD4,×. In particular, it solves the consistency and the classification problems for 𝒟ℒD4,×-knowledge bases represented in set-theoretic terms, and a generalization of the Conjunctive Query Answering problem in which conjunctive queries with variables of three sorts are admitted. The reasoner, which extends and improves a previous version, is implemented in C++. It supports 𝒟ℒD4,×-knowledge bases serialized in the OWL/XML format and it admits also rules expressed in SWRL (Semantic Web Rule Language).

scholarly journals Conjunctive Query Answering for the Description Logic SHIQ

2008 ◽  
Vol 31 ◽  
pp. 157-204 ◽  
Author(s):  
B. Glimm ◽  
C. Lutz ◽  
I. Horrocks ◽  
U. Sattler
Keyword(s):  
Description Logic ◽  
Query Language ◽  
Description Logics ◽  
Knowledge Bases ◽  
Deterministic Algorithm ◽  
Query Answering ◽  
Conjunctive Query ◽  
Conjunctive Queries ◽  
Complexity Bounds ◽  
Double Exponential

Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive query answering over DL knowledge bases is only poorly understood if transitive roles are admitted in the query. In this paper, we consider unions of conjunctive queries over knowledge bases formulated in the prominent DL SHIQ and allow transitive roles in both the query and the knowledge base. We show decidability of query answering in this setting and establish two tight complexity bounds: regarding combined complexity, we prove that there is a deterministic algorithm for query answering that needs time single exponential in the size of the KB and double exponential in the size of the query, which is optimal. Regarding data complexity, we prove containment in co-NP.

scholarly journals Answering Fuzzy Queries over Fuzzy DL-Lite Ontologies

2022 ◽  
pp. 1-30
Author(s):  
GABRIELLA PASI ◽  
RAFAEL PEÑALOZA
Keyword(s):  
Fuzzy Logic ◽  
Domain Knowledge ◽  
Description Logic ◽  
Classical Case ◽  
Point Of View ◽  
Query Answering ◽  
Data Complexity ◽  
Conjunctive Query ◽  
Triangular Norm ◽  
Mathematical Fuzzy Logic

Abstract A prominent problem in knowledge representation is how to answer queries taking into account also the implicit consequences of an ontology representing domain knowledge. While this problem has been widely studied within the realm of description logic ontologies, it has been surprisingly neglected within the context of vague or imprecise knowledge, particularly from the point of view of mathematical fuzzy logic. In this paper, we study the problem of answering conjunctive queries and threshold queries w.r.t. ontologies in fuzzy DL-Lite. Specifically, we show through a rewriting approach that threshold query answering w.r.t. consistent ontologies remains in ${AC}^{0}$ in data complexity, but that conjunctive query answering is highly dependent on the selected triangular norm, which has an impact on the underlying semantics. For the idempotent Gödel t-norm, we provide an effective method based on a reduction to the classical case.

scholarly journals Finite Controllability of Conjunctive Query Answering with Existential Rules: Two Steps Forward

2018 ◽  
Author(s):  
Giovanni Amendola ◽  
Nicola Leone ◽  
Marco Manna
Keyword(s):  
Query Answering ◽  
Conjunctive Query ◽  
General Technique ◽  
First Order ◽  
Finite Models ◽  
Decidable Classes

Reasoning with existential rules typically consists of checking whether a Boolean conjunctive query is satisfied by all models of a first-order sentence having the form of a conjunction of Datalog rules extended with existential quantifiers in rule-heads. To guarantee decidability, five basic decidable classes - linear, weakly-acyclic, guarded, sticky, and shy - have been singled out, together with several generalizations and combinations. For all basic classes, except shy, the important property of finite controllability has been proved, ensuring that a query is satisfied by all models of the sentence if, and only if, it is satisfied by all of its finite models. This paper takes two steps forward: (i) devise a general technique to facilitate the process of (dis)proving finite controllability of an arbitrary class of existential rules; and (ii) specialize the technique to complete the picture for the five mentioned classes, by showing that also shy is finitely controllable.

A New Matchmaking Approach Based on Abductive Conjunctive Query Answering

2012 ◽  
pp. 144-159 ◽  
Author(s):  
Jianfeng Du ◽  
Shuai Wang ◽  
Guilin Qi ◽  
Jeff Z. Pan ◽  
Yong Hu
Keyword(s):  
Query Answering ◽  
Conjunctive Query

Abductive Conjunctive Query Answering w.r.t. Ontologies

2015 ◽  
Vol 30 (2) ◽  
pp. 177-182 ◽  
Author(s):  
Ralf Möller ◽  
Özgür Özçep ◽  
Volker Haarslev ◽  
Anahita Nafissi ◽  
Michael Wessel
Keyword(s):  
Query Answering ◽  
Conjunctive Query

scholarly journals Complexity of Inconsistency-Tolerant Query Answering in Datalog+/– under Cardinality-Based Repairs

2019 ◽  
Vol 33 ◽  
pp. 2962-2969 ◽  
Author(s):  
Thomas Lukasiewicz ◽  
Enrico Malizia ◽  
Andrius Vaicenavičius
Keyword(s):  
Computational Complexity ◽  
Knowledge Bases ◽  
Query Answering ◽  
Conjunctive Query ◽  
Wide Range ◽  
Consistent Subset

Querying inconsistent ontological knowledge bases is an important problem in practice, for which several inconsistencytolerant query answering semantics have been proposed, including query answering relative to all repairs, relative to the intersection of repairs, and relative to the intersection of closed repairs. In these semantics, one assumes that the input database is erroneous, and the notion of repair describes a maximally consistent subset of the input database, where different notions of maximality (such as subset and cardinality maximality) are considered. In this paper, we give a precise picture of the computational complexity of inconsistencytolerant (Boolean conjunctive) query answering in a wide range of Datalog± languages under the cardinality-based versions of the above three repair semantics.

Sign in / Sign up

Export Citation Format

Share Document