Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
Abstract. In this paper, we propose an approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve thi...
Abstract. Many activities related to semantically annotated resources can be enabled by a notion of similarity among them. We propose a method for defining a family of semi-distan...
Abstract. Conjunctive query answering is an important DL reasoning task. Although this task is by now quite well-understood, tight complexity bounds for conjunctive query answering...
Abstract. We show that subsumption problems in EL and related description logics can be expressed as uniform word problems in classes of semilattices with monotone operators. We us...