scholarly journals A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases

2018 ◽  
pp. 35-77 ◽  
Author(s):  
İsmail İlkan Ceylan ◽  
Thomas Lukasiewicz
Keyword(s):  
Knowledge Bases ◽  
Query Answering ◽  
Probabilistic Knowledge

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).

Resolving Inconsistencies in Probabilistic Knowledge Bases

2007 ◽  
pp. 114-128 ◽  
Author(s):  
Marc Finthammer ◽  
Gabriele Kern-Isberner ◽  
Manuela Ritterskamp
Keyword(s):  
Knowledge Bases ◽  
Probabilistic Knowledge

UCQ-Rewritings for disjunctive knowledge and queries with negated atoms

Semantic Web ◽  
2020 ◽  
pp. 1-25
Author(s):  
Enrique Matos Alfonso ◽  
Alexandros Chortaras ◽  
Giorgos Stamou
Keyword(s):  
Incomplete Data ◽  
Knowledge Bases ◽  
Query Answering ◽  
Query Rewriting ◽  
Conjunctive Queries

In this paper, we study the problem of query rewriting for disjunctive existential rules. Query rewriting is a well-known approach for query answering on knowledge bases with incomplete data. We propose a rewriting technique that uses negative constraints and conjunctive queries to remove the disjunctive components of disjunctive existential rules. This process eventually generates new non-disjunctive rules, i.e., existential rules. The generated rules can then be used to produce new rewritings using existing rewriting approaches for existential rules. With the proposed technique we are able to provide complete UCQ-rewritings for union of conjunctive queries with universally quantified negation. We implemented the proposed algorithm in the Completo system and performed experiments that evaluate the viability of the proposed solution.

Sign in / Sign up

Export Citation Format

Share Document