Results 1  10
of
28
Tableau Prover Tatzelwurm: HyperLinks and URResolution
 Johannes Kepler Universität Linz
, 1997
"... this paper, the use of semantic hyperlinking and of URresolution in a tableau based theorem prover is discussed. Semantic hyperlinking, see [5] or [6], can be viewed as a systematic search for a model of a formula X. If this search fails, X has been shown to be unsatisfiable. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
this paper, the use of semantic hyperlinking and of URresolution in a tableau based theorem prover is discussed. Semantic hyperlinking, see [5] or [6], can be viewed as a systematic search for a model of a formula X. If this search fails, X has been shown to be unsatisfiable.
Tableau Prover Tatzelwurm: HyperLinks and URResolution
"... In this paper, the use of semantic hyperlinking and of URresolution in a tableau based theorem prover is discussed. Semantic hyperlinking, see [5] or [6], can be viewed as a systematic search for a model of a formula X. If this search fails, X has been shown to be unsatisfiable. ..."
Abstract
 Add to MetaCart
In this paper, the use of semantic hyperlinking and of URresolution in a tableau based theorem prover is discussed. Semantic hyperlinking, see [5] or [6], can be viewed as a systematic search for a model of a formula X. If this search fails, X has been shown to be unsatisfiable.
Hyper Tableaux with Equality
 PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON AUTOMATED DEDUCTION, NUMBER 4603 IN LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
, 2007
"... In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition in ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition
Constrained Hyper Tableaux
, 2001
"... Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper tableaux are a generalization of hyper tableaux, where branch closing substitutions, from the point of view of model generati ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper tableaux are a generalization of hyper tableaux, where branch closing substitutions, from the point of view of model
The Hyper Tableaux Calculus with Equality
, 2008
"... In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition infe ..."
Abstract
 Add to MetaCart
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition
Debugging Axioms with HyperTableaux
, 1998
"... 3), if the automated theorem prover does not terminate within ressource bounds. Therefore, I propose an approach that inspects partial proofs achieved with a hypertableaux theorem prover and enables the detection of deficient axioms. 2 Theorem Proving with HyperTableaux Hypertableaux constitut ..."
Abstract
 Add to MetaCart
with the hyperinference rule of resolution calculi. Hypertableau derivations are proofconfluent, i.e. it is never necessary to undo inferences, and they either refute the given clause set or construct a partial model for it (cf. [3]). Hypertableaux are trees labeled with atoms where branches can be read
Th.: Adding Semantic HyperLinks and URResolution to the Tableau Prover Tatzelwurm
"... In this paper the adaptation of semantic hyperlinking for a tableau prover is described. Hyperlinking has been introduced in the prover CLINS. See [3] or [4]. It is a systematic search for a model of a formula X. If this search fails, X has been shown to be unsatisfiable. Also proving the unsatis ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper the adaptation of semantic hyperlinking for a tableau prover is described. Hyperlinking has been introduced in the prover CLINS. See [3] or [4]. It is a systematic search for a model of a formula X. If this search fails, X has been shown to be unsatisfiable. Also proving
LoopDetection in HyperTableaux by Powerful Model Generation
, 1999
"... Automated reasoning systems often suffer from redundancy: similar parts of derivations are repeated again and again. This leads us to the problem of loopdetection, which clearly is undecidable in general. Nevertheless, we tackle this problem by extending the hypertableau calculus as proposed in Ba ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Automated reasoning systems often suffer from redundancy: similar parts of derivations are repeated again and again. This leads us to the problem of loopdetection, which clearly is undecidable in general. Nevertheless, we tackle this problem by extending the hypertableau calculus as proposed
Merge Path Improvements for Minimal Model Hyper Tableaux
 In Proc. TABLEAUX’99
, 1999
"... . We combine techniques originally developed for refutational firstorder theorem proving within the clause tree framework with techniques for minimal model computation developed within the hyper tableau framework. This combination generalizes wellknown tableaux techniques like complement split ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
. We combine techniques originally developed for refutational firstorder theorem proving within the clause tree framework with techniques for minimal model computation developed within the hyper tableau framework. This combination generalizes wellknown tableaux techniques like complement
Results 1  10
of
28