Abstract. Modern description logic (DL) reasoners are known to be less efficient for DLs with inverse roles. The current loss of performance is largely due to the missing applicabi...
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
We describe a mechanism that can be used to drive interfaces from a description logic (DL) model of the domain. A simple layer with limited expressivity sits on top of the DL, wit...
Using quantitative models of simple mechanisms as an example domain, we show how the basic principles of consistency-based diagnosis can be implemented using description logics wi...
Abstract. The Event Calculus is a narrative based formalism for reasoning about actions and change originally proposed in logic programming form by Kowalski and Sergot. In this pap...