A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Human Oriented Logic for Automatic Theorem-Proving
Journal of the ACM (JACM)
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Unification in a combination of arbitrary disjoint equational theories
Journal of Symbolic Computation
Adventures in associative-commutative unification
Journal of Symbolic Computation
Constraints in computational logics
On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Combining Pattern E-Unification Algorithms
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Rule-Based Constraint Programming
Fundamenta Informaticae
| Hi-index | 0.00 |
An important component of mechanical theorem proving systems are unification algorithms which find most genaral substitutions which, when applied to two expresssions, maka them equivalent. Functions which are associative and commutative (such as the arithmetic addition and multiplication functions) are often the subject of mechanical theorem proving. An algorithm which unifies terms whose function is associativa and commutative is presented here The algorithm eliminates the need for axiomatizing the associativity and commutativity properties and returns a complete set of unifiers without recourse to the indefinite generation of vurianU and instances of the terms being unified required by previous solutions to the problem.