We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
We address the problem of reasoning with instances of heterogeneously formalized ontologies. Given a set of semantic mappings, reconciling conceptual and instance level heterogenei...
Abstract. To make ABox reasoning scalable for large ABoxes in description logic (DL) knowledge bases, we develop a method for partitioning the ABox so that specific kinds of reaso...
Absorptions are generally employed in Description Logics (DL) reasoners in a uniform way regardless of the structure of an input knowledge base. In this paper we present an approac...
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...