DLOG
2011
13 years 3 months ago
2011
We present an optimized query rewriting algorithm for OWL 2 QL that computes the rewriting set of a user query by avoiding unnecessary inferences and extended clause subsumption ch...
DLOG
2011
13 years 3 months ago
2011
The canonical standard description logic reasoning service is classification, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While ...
DLOG
2011
13 years 3 months ago
2011
We introduce an algorithm for MinA extraction in EL based on bidirectional reachability. We obtain a significant reduction in the size of modules extracted at almost no additional...
DLOG
2011
2011
Reasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases
13 years 3 months ago
We present a framework for logic-based matchmaking on ALN ABoxes stored in a relational database. The proposed approach allows both non-standard reasoning and subsumption check be ...
DLOG
2011
13 years 3 months ago
2011
In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services. This holds also for DLs, where research focused on the...
DLOG
2011
13 years 3 months ago
2011
We study a restriction of the classification procedure for EL++ where the inference rule for complex role inclusion axioms (RIAs) is applied in a “left-linear” way in analogy ...
DLOG
2011
13 years 3 months ago
2011
We propose a method for controlling the quality of (semi-)automatically acquired axioms. We combine the manual inspection of axioms with automatic evaluation decisions and propose ...
DLOG
2011
13 years 3 months ago
2011
Abstract. In this paper, we introduce a paraconsistent extension of Rough Description Logics which allows the representation of incomplete and contradictory concepts, as well as th...
DLOG
2011
13 years 3 months ago
2011
We propose an extension of SROIQ with nominal schemas which can be used like “variable nominal concepts” within axioms. This feature allows us to express arbitrary DL-safe rule...
DLOG
2011
13 years 3 months ago
2011
We prove co-N2ExpTime-hardness for conjunctive query entailment in the description logic ALCOIF , thus improving the previously known 2ExpTime lower bound. The result transfers to ...