Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
Abstract. We present a lightweight, automated tool for specificationbased testing of declarative programs written in the functional logic programming language Curry and emphasize t...
We propose a method to compare semantically two natural language texts. The process is realized in two steps, the first translates the texts into description logics terminologies...
We consider two recently proposed definitions of the expressive power of description logics, one due to Baader, the other due to Kurtonina and de Rijke. The proposals are non-equi...
It has recently been shown that proofs in which some symbols are colored (e.g. local or split proofs and symbol-eliminating proofs) can be used for a number of applications, such a...