Sciweavers

22 search results - page 2 / 5
» cade 2001
Sort
View
CADE
2001
Springer
14 years 5 months ago
STRIP: Structural Sharing for Efficient Proof-Search
The STRIP system is a theorem prover for intuitionistic propositional logic with two main characteristics: it deals with the duplication of formulae during proof-search from a fine...
Didier Galmiche, Dominique Larchey-Wendling, Domin...
CADE
2001
Springer
14 years 5 months ago
RACER System Description
RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized s...
Ralf Möller, Volker Haarslev
CADE
2001
Springer
14 years 5 months ago
A New Meta-complexity Theorem for Bottom-Up Logic Programs
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...
Harald Ganzinger, David A. McAllester
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
2001
Springer
14 years 5 months ago
JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
Abstract. JProver is a first-order intuitionistic theorem prover that creates sequent-style proof objects and can serve as a proof engine in interactive proof assistants with expre...
Stephan Schmitt, Lori Lorigo, Christoph Kreitz, Al...