Results 1  10
of
357
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
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
Hyper Tableaux
, 1996
"... This paper introduces a variant of clausal normal form tableaux that we call "hyper tableaux". Hyper tableaux keep many desirable features of analytic tableaux while taking advantage of the central idea from (positive) hyper resolution, namely to resolve away all negative literals of a cla ..."
Abstract

Cited by 84 (20 self)
 Add to MetaCart
This paper introduces a variant of clausal normal form tableaux that we call "hyper tableaux". Hyper tableaux keep many desirable features of analytic tableaux while taking advantage of the central idea from (positive) hyper resolution, namely to resolve away all negative literals of a
The Hyper Tableaux Calculus with Equality and an Application to Finite Model Computation
, 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

Cited by 3 (2 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
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
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
Equality Elimination for Semantic Tableaux
, 1994
"... We introduce the equality elimination method for semantic tableaux with equality. The method combines topdown tableau rules with bottomup equation solving. The equality elimination method enjoys three features no other tableau method with equality has. First, the method is local, i.e. one can clos ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
We introduce the equality elimination method for semantic tableaux with equality. The method combines topdown tableau rules with bottomup equation solving. The equality elimination method enjoys three features no other tableau method with equality has. First, the method is local, i.e. one can
Adding Equality to Semantic Tableaux
 Proceedings, 3rd Workshop on Theorem Proving with Analytic
, 1994
"... . This paper tries to identify the basic problems encountered in handling equality in the semantic tableau framework, and to describe the state of the art in solving these problems. The two main paradigms for handling equality are compared: adding new tableau expansion rules and using Eunification ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
. This paper tries to identify the basic problems encountered in handling equality in the semantic tableau framework, and to describe the state of the art in solving these problems. The two main paradigms for handling equality are compared: adding new tableau expansion rules and using E
Results 1  10
of
357