In this paper, logics are conceived as two-sorted first-order structures, and we argue that this broad definition encompasses a wide class of logics with theoretical interest as w...
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
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...
The development of ontologies involves continuous but relatively small modifications. However, existing ontology reasoners do not take advantage of the similarities between differe...
Bernardo Cuenca Grau, Christian Halaschek-Wiener, ...
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...