Unification in combinations of collapse-free regular theories

Authors:
Katherine A. Yelick
Affiliations:
Laboratory for Computer Science, Massachusetts Institute of Technology 545 Technology Square, Cambridge, Massachusetts 02139, U.S.A.
Venue:
Journal of Symbolic Computation
Year:
1987

Citing 15
Cited 11

Properties of substitutions and unifications

Journal of Symbolic Computation
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Complete Sets of Reductions for Some Equational Theories

Journal of the ACM (JACM)
A Unification Algorithm for Associative-Commutative Functions

Journal of the ACM (JACM)
Deciding Combinations of Theories

Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer experiments with the REVE term rewriting system generator

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Incremental Construction of Unification Algorithms in Equational Theories

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Rewrite Methods for Clausal and Non-Clausal Theorem Proving

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Canonical Forms and Unification

Proceedings of the 5th Conference on Automated Deduction
A General Inductive Completion Algorithm and Application to Abstract Data Types

Proceedings of the 7th International Conference on Automated Deduction
Universal Unification

Proceedings of the 7th International Conference on Automated Deduction
Complete Sets of Unifiers and Matchers in Equational Theories

CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming

Boolean unification - The story so far

Journal of Symbolic Computation
On equational theories, unification, and (Un)decidability

Journal of Symbolic Computation
Unification in a combination of arbitrary disjoint equational theories

Journal of Symbolic Computation
Unification in primal algebras, their powers and their varieties

Journal of the ACM (JACM)
Combining matching algorithms: The regular case

Journal of Symbolic Computation
Higher-order equational logic programming

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Combining constraint solving

Constraints in computational logics
A Methodological View of Constraint Solving

Constraints
Matching with Free Function Symbols - A Simple Extension of Matching?

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Rule-Based Constraint Programming

Fundamenta Informaticae
Hierarchical combination

CADE'13 Proceedings of the 24th international conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a method for combining equational unification algorithms to handle terms containing 'mixed' sets of function symbols. For example, given one algorithm for unifying associative-commutative operators, and another for unifying commutative operators, our algorithm provides a method for unifying terms containing both kinds of operators. As a special case of the combining problem, our algorithm lifts a variable-only case algorithm to the general case with multiple operator instances and free symbols. We restrict our attention to a class of equational theories called the collapse-free regular theories. We give some results characterizing the unification problem in this class of theories, and specifically show the restrictions are necessary and sufficient for the correctness of our algorithm. An implementation has been done as part of a larger system for reasoning about equational theories.