Results 1  10
of
5,095,308
An Improved General EUnification Method
 J. Symbolic Computation
, 1994
"... This paper considers the problem of Eunification for arbitrary equational theories E, and presents an inference rule approximating Paramodulation and leading to a complete Eunification procedure which generalizes Narrowing. This sheds some light on the boundary between arbitrary Eunification situ ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
This paper considers the problem of Eunification for arbitrary equational theories E, and presents an inference rule approximating Paramodulation and leading to a complete Eunification procedure which generalizes Narrowing. This sheds some light on the boundary between arbitrary Eunification
GoalDirected EUnification
 In RTA
"... We give a general goal directed method for solving the E unification problem. Our inference system is a generalization of the inference rules for Syntactic Theories, except that our inference system is proved complete for any equational theory. We also show how to easily modify our inference sy ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We give a general goal directed method for solving the E unification problem. Our inference system is a generalization of the inference rules for Syntactic Theories, except that our inference system is proved complete for any equational theory. We also show how to easily modify our inference
Rigid EUnification Revisited
"... This paper presents a sound and complete set of abstract transformation rules for rigid Eunification. Abstract congruence closure, syntactic unification and paramodulation are the three main components of the proposed method. The method obviates the need for using any complicated term orderings and ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This paper presents a sound and complete set of abstract transformation rules for rigid Eunification. Abstract congruence closure, syntactic unification and paramodulation are the three main components of the proposed method. The method obviates the need for using any complicated term orderings
Approximating EUnification
, 2001
"... We give a set of inference rules for solving Eunification. We prove the completeness with Eager Merging for linear theories and goals with no repeated variables. If the theory is further restricted to have no repeated variables, we show that Eunification is decidable and has linear complexity ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We give a set of inference rules for solving Eunification. We prove the completeness with Eager Merging for linear theories and goals with no repeated variables. If the theory is further restricted to have no repeated variables, we show that Eunification is decidable and has linear complexity
RIGID EUNIFICATION
"... By replacing syntactical unification with rigid Eunification, equality handling ..."
Abstract
 Add to MetaCart
By replacing syntactical unification with rigid Eunification, equality handling
Rigid Eunification
 Automated Deduction – A Basis for Applications, volume I
, 1998
"... By replacing syntactical unification with rigid Eunification, equality handling can be added to rigid variable calculi for firstorder logic, including ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
By replacing syntactical unification with rigid Eunification, equality handling can be added to rigid variable calculi for firstorder logic, including
Implementing Rigid Eunification
"... Rigid Eunification problems arise naturally in automated theorem provers that deal with equality. While there is a lot of theory about rigid Eunification, only few implementations exist. Since the problem is NPcomplete, direct implementations of the theory are slow. In this paper we discuss how to ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Rigid Eunification problems arise naturally in automated theorem provers that deal with equality. While there is a lot of theory about rigid Eunification, only few implementations exist. Since the problem is NPcomplete, direct implementations of the theory are slow. In this paper we discuss how
Simultaneous Rigid EUnification is Undecidable
 Computer Science Logic. 9th International Workshop, CSL'95
, 1995
"... Simultaneous rigid Eunification has been introduced in the area of theorem proving with equality. It is used in extension procedures, like the tableau method or the connection method. Many articles in this area assume the existence of an algorithm for simultaneous rigid Eunification. There were se ..."
Abstract

Cited by 18 (9 self)
 Add to MetaCart
Simultaneous rigid Eunification has been introduced in the area of theorem proving with equality. It is used in extension procedures, like the tableau method or the connection method. Many articles in this area assume the existence of an algorithm for simultaneous rigid Eunification. There were
HigherOrder Rigid EUnification
 5th International Conference on Logic Programming and Automated Reasoning', number 822 in `Lecture Notes in Artificial Intelligence
"... . Higherorder Eunification, i.e. the problem of finding substitutions that make two simply typed terms equal modulo fi or fij equivalence and a given equational theory, is undecidable. We propose to rigidify it, to get a resourcebounded decidable unification problem (with arbitrary high bound ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
bounds), providing a complete higherorder Eunification procedure. The techniques are inspired from Gallier's rigid Eunification and from Dougherty and Johann's use of combinatory logic to solve higherorder Eunification problems. We improve their results by using general equational theories
EUnification for Subsystems of S4
, 1998
"... This paper is concerned with the unification problem in the path logics associated by the optimised functional translation method with the propositional modal logics K, KD, KT, KD4, S4 and S5. It presents improved unification algorithms for certain forms of the right identity and associativity laws. ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
This paper is concerned with the unification problem in the path logics associated by the optimised functional translation method with the propositional modal logics K, KD, KT, KD4, S4 and S5. It presents improved unification algorithms for certain forms of the right identity and associativity laws
Results 1  10
of
5,095,308