Sciweavers

91 search results - page 2 / 19
» Towards Implementing Finite Model Reasoning in Description L...
Sort
View
CADE
2008
Springer
14 years 5 months ago
Towards Fully Automated Axiom Extraction for Finite-Valued Logics
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
Dalmo Mendonca, João Marcos
CADE
2001
Springer
14 years 5 months ago
Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics
This paper investigates optimization techniques and data structures exploiting the use of so-called pseudo models. These techniques are applied to speed up TBox and ABox reasoning ...
Anni-Yasmin Turhan, Ralf Möller, Volker Haars...
CADE
2010
Springer
13 years 6 months ago
Optimized Description Logic Reasoning via Core Blocking
State of the art reasoners for expressive description logics, such as those that underpin the OWL ontology language, are typically based on highly optimized implementations of (hyp...
Birte Glimm, Ian Horrocks, Boris Motik
CSL
2010
Springer
13 years 5 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
CADE
2007
Springer
14 years 5 months ago
Optimized Reasoning in Description Logics Using Hypertableaux
We present a novel reasoning calculus for Description Logics (DLs)--knowledge representation formalisms with applications in areas such as the Semantic Web. In order to reduce the ...
Boris Motik, Rob Shearer, Ian Horrocks