In this paper a representative example is chosen that is meant be fairly simple for illustrating the point that in a very common kind of instance, argument and explanation are mixe...
Unsatisfiable concepts are a major cause for inconsistencies in Description Logics knowledge bases. Popular methods for repairing such concepts aim to remove or rewrite axioms to r...
We show that feature logic extended by functional uncertainty is decidable, even if one admits cyclic descriptions. We present an algorithm, which solves feature descriptions cont...
Presently, there is no specialized language for complex integrity constraints description in XML documents. In this paper we present a language that combines first-order logic toge...
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...