Complete sets of transformations for general E-unification
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Foundations of Equational Logic Programming
Foundations of Equational Logic Programming
Lazy narrowing: strong completeness and eager variable elimination
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Term rewriting and all that
Undecidable Properties of Syntactic Theories
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Decidability and Complexity of Finitely Closable Linear Equational Theories
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Decidability and Complexity of Finitely Closable Linear Equational Theories
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
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 system into a more restricted inference system for Syntactic Theories, and show that our completeness techniques prove completeness there also.