Constrained equational reasoning

Authors:
C. Kirchner;H. Kirchner
Affiliations:
LORIA & CRIN, BP239, 54506 Vandoeuvre les Nancy Cedex, France;-
Venue:
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Year:
1989

Citing 14
Cited 4

Properties of substitutions and unifications

Journal of Symbolic Computation
Completion of a set of rules modulo a set of equations

SIAM Journal on Computing
NP-completeness of the set unification and matching problems

Proc. of the 8th international conference on Automated deduction
Schematization of infinite sets of rewrite rules. Application to the divergence of completion processes

on Rewriting techniques and applications
Completion for rewriting modulo a congruence

on Rewriting techniques and applications
Proof methods for equational theories

Proof methods for equational theories
Opening the AC-unification race

Journal of Automated Reasoning
A completion procedure for conditional equations

1st international workshop on Conditional Term Rewriting Systems
An introduction to OBJ 3

1st international workshop on Conditional Term Rewriting Systems
Equational problems anddisunification

Journal of Symbolic Computation
Schematization of infinite sets of rewrite rules generated by divergent completion processes

Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Complete Sets of Reductions for Some Equational Theories

Journal of the ACM (JACM)
Logic Programming with Polymorphically Order-Sorted Types

Proceedings of the International Workshop on Algebraic and Logic Programming
Termination of a Set of Rules Modulo a Set of Equations

Proceedings of the 7th International Conference on Automated Deduction

Constraint solving on terms

Constraints in computational logics
Combining constraint solving

Constraints in computational logics
UNIMOK: A System for Combining Equational Unification Algorithm

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
On unification for bounded distributive lattices

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe and give the foundation for constrained equational reasoning. Equational reasoning is based on replacement of equal by equal and these replacements use substitutions determined as solutions of equations. Constrained equational reasoning takes advantage from the information contained into the equation itself to develop equational reasoning, avoids instantiations as much as possible and solve constraints as late as possible. For theories like associativity-commutativity this can lead to a considerable reduction of the substitution computation overhead, bringing some problems, untractable in practice, to the realm of computational reality.