Abstract. We consider the problem of characterising relational constraints under which TBox reasoning in EL is tractable. We obtain P vs. coNP-hardness dichotomies for tabular cons...
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 ...
Nadeschda Nikitina, Sebastian Rudolph, Birte Glimm
We show that deciding conjunctive query inseparability for OWL 2 QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by exp...
Boris Konev, Roman Kontchakov, Michel Ludwig, Thom...
We introduce an extension of Description Logics (DLs) for representing and reasoning about contextualized knowledge. Our formalism is inspired by McCarthy’s theory of formalizing...
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...