Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
Abstract. This paper presents a tableau approach for deciding description logics outside the scope of OWL DL and current state-of-the-art tableau-based description logic systems. I...
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
Abstract This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We...