Answering Expressive Path Queries over Lightweight DL Knowledge Bases

In recent years, there has been growing interest in ontology-based data access, in which information in the ontology is used to derive additional answers to queries posed over

The goal of this work is to introduce an intuitive certain answer semantics for the class of well-designed pattern trees under DL-Lite R (which provides the theoretical underpinning

(2019) that rooted CQ answering under bag semantics 5 has tractable data complexity in DL-Lite core , and furthermore, the same holds for rooted versions of the Count()-queries

Among these formula-based merging approaches, Removed Sets Fusion approach has been proposed in [17, 18] for merging propositional belief bases.. This approach stems from removing

In this paper, we investigated the query answering problem when we do not know the content of the ABox (Data) in terms of inference strategies.. We proposed basic inferences from

This development leads to a revision of the definition of partial−CF DI ∀− nc knowledge bases in which the traditional notion of an ABox is replaced by a CBox: a set of

We proposed a framework for query answering over inconsistent KBs that is based on (i) a notion of repair that preserves more information than classical repair strategies, (ii)

In the linear case, CRPQ answering is E XP T IME -complete in combined complexity, PS PACE - complete in combined complexity with bounded predicate arity and NL-complete in data