Difference unification

Authors:
David A. Basin;Toby Walsh
Affiliations:
Max-Planck-Institut fur Informatik, Saarbrücken, Germany;Dept. of AI, University of Edinburgh, Edinburgh, Scotland
Venue:
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Year:
1993

Citing 7
Cited 4

NP-completeness of the set unification and matching problems

Proc. of the 8th international conference on Automated deduction
Rippling: a heuristic for guiding inductive proofs

Artificial Intelligence
The Use of Explicit Plans to Guide Inductive Proofs

Proceedings of the 9th International Conference on Automated Deduction
Guiding Induction Proofs

Proceedings of the 10th International Conference on Automated Deduction
Difference Matching

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
The Use of Proof Plans to Sum Series

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Partial Unification for Graph Based Equational Reasoning

Proceedings of the 9th International Conference on Automated Deduction

Strategic Issues, Problems and Challenges in Inductive Theorem Proving

Electronic Notes in Theoretical Computer Science (ENTCS)
Heuristic-biased stochastic sampling

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Improved limited discrepancy search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Automatic deductive synthesis of lisp programs in the system ALISA

JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend work on difference identification and reduction as a technique for automated reasoning. We generalise unification so that terms are made equal not only by finding substitutions for variables but also by hiding term structure. This annotation of structural differences serves to direct rippling, a kind of rewriting designed to remove differences in a controlled way. On the technical side, we give a rule-based algorithm for difference unification, and analyze its correctness, completeness, and complexity. On the practical side, we present a novel search strategy for efficiently applying these rules. Finally, we show how this algorithm can be used in new ways to direct rippling and how it can play an important role in theorem proving and other kinds of automated reasoning.