Sciweavers

322 search results - page 19 / 65
» Practical Reasoning for Expressive Description Logics
Sort
View
DLOG
2006
14 years 11 months ago
Tableau Caching for Description Logics with Inverse and Transitive Roles
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...
Yu Ding, Volker Haarslev
74
Voted
LICS
1999
IEEE
15 years 1 months ago
Counting and Addition Cannot Express Deterministic Transitive Closure
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...
Matthias Ruhl
DLOG
2000
14 years 10 months ago
Driving User Interfaces from FaCT
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...
Sean Bechhofer, Ian Horrocks
76
Voted
DLOG
1996
14 years 10 months ago
Using Description Logics for Consistency-based Diagnosis
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...
Gerd Kamp, Holger Wache
ICLP
1995
Springer
15 years 1 months ago
Variants of the Event Calculus
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...
Fariba Sadri, Robert A. Kowalski