Sciweavers

441 search results - page 48 / 89
» Automated Benchmarking of Description Logic Reasoners
Sort
View
LICS
1999
IEEE
14 years 24 days 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
CADE
2007
Springer
14 years 8 months ago
System Description: E-KRHyper
The E-KRHyper system is a model generator and theorem prover for first-order logic with equality. It implements the new E-hyper tableau calculus, which integrates a superposition-b...
Björn Pelzer, Christoph Wernhard
DEBU
2002
120views more  DEBU 2002»
13 years 8 months ago
DAML+OIL: a Description Logic for the Semantic Web
Ontologies are set to play a key role in the "Semantic Web", extending syntactic interoperability to semantic interoperability by providing a source of shared and precis...
Ian Horrocks
LPAR
2007
Springer
14 years 2 months ago
Preferential Description Logics
In this paper we propose a nonmonotonic extension ALC + Tmin of the Description Logic ALC for reasoning about prototypical properties and inheritance with exception. The logic ALC ...
Laura Giordano, Valentina Gliozzi, Nicola Olivetti...
DLOG
2011
13 years 22 hour ago
Relaxed Abduction: Robust Information Interpretation for Incomplete Models
This paper introduces relaxed abduction, a novel non-standard reasoning task for description logics. Although abductive reasoning over description logic knowledge bases has been ap...
Thomas Hubauer, Steffen Lamparter, Michael Pirker