Results 1 
4 of
4
PROTEIN: A PROver with a Theory Extension Interface
 AUTOMATED DEDUCTION  CADE12, VOLUME 814 OF LNAI
, 1994
"... PROTEIN (PROver with a Theory Extension INterface) is a PTTPbased first order theorem prover over builtin theories. Besides various standardrefinements known for model elimination, PROTEIN also offers a variant of model elimination for casebased reasoning and which does not need contrapositives. ..."
Abstract

Cited by 40 (10 self)
 Add to MetaCart
PROTEIN (PROver with a Theory Extension INterface) is a PTTPbased first order theorem prover over builtin theories. Besides various standardrefinements known for model elimination, PROTEIN also offers a variant of model elimination for casebased reasoning and which does not need contrapositives.
A Model Elimination Calculus with Builtin Theories
 Proceedings of the 16th German AIConference (GWAI92
, 1992
"... this paper, we will show how to extend model elimination with theory reasoning. Technically, theory reasoning means to relieve a calculus from explicit reasoning in some domain (e.g. equality, partial orders) by taking apart the domain knowledge and treating it by special inference rules. In an impl ..."
Abstract

Cited by 17 (10 self)
 Add to MetaCart
this paper, we will show how to extend model elimination with theory reasoning. Technically, theory reasoning means to relieve a calculus from explicit reasoning in some domain (e.g. equality, partial orders) by taking apart the domain knowledge and treating it by special inference rules. In an implementation, this results in a universal "foreground" reasoner that calls a specialized "background" reasoner for theory reasoning. Theory reasoning comes in two variants (Sti85) : total and
Consolution as a Framework for Comparing Calculi
 JOURNAL OF SYMBOLIC COMPUTATION
, 1994
"... In this paper, stepwise and nearly stepwise simulation results for a number of firstorder proof calculi are presented and an overview is given that illustrates the relations between these calculi. For this purpose, we modify the consolution calculus in such a way that it can be instantiated to reso ..."
Abstract

Cited by 14 (10 self)
 Add to MetaCart
In this paper, stepwise and nearly stepwise simulation results for a number of firstorder proof calculi are presented and an overview is given that illustrates the relations between these calculi. For this purpose, we modify the consolution calculus in such a way that it can be instantiated to resolution, tableaux model elimination, a connection method and Loveland's model elimination.
Refinements of Theory Model Elimination and a Variant without Contrapositives
 University of Koblenz, Institute for Computer Science
, 1994
"... Theory Reasoning means to buildin certain knowledge about a problem domain into a deduction system or calculus, which is in our case model elimination. Several versions of theory model elimination (TME) calculi are presented and proven complete: on the one hand we have highly restricted versions of ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
Theory Reasoning means to buildin certain knowledge about a problem domain into a deduction system or calculus, which is in our case model elimination. Several versions of theory model elimination (TME) calculi are presented and proven complete: on the one hand we have highly restricted versions of total and partial TME. These restrictions allow (1) to keep fewer path literals in extension steps than in related calculi, and (2) discard proof attempts with multiple occurrences of literals along a path (i.e. regularity holds). On the other hand, we obtain by small modifications to TME versions which do not need contrapositives (a la NearHorn Prolog). We show that regularity can be adapted for these versions. The independence of the goal computation rule holds for all variants. Comparative runtime results for our PTTPimplementations are supplied. 1 Introduction The model elimination calculus (ME calculus) has been developed already in the early days of automated theorem proving [Lovel...