Difference Matching

@inproceedings{Basin1992DifferenceM,
  title={Difference Matching},
  author={David A. Basin and Toby Walsh},
  booktitle={CADE},
  year={1992}
}
Difference matching is a generalization of first-order matching where terms are made identical both by variable instantiation and by structure hiding. After matching, the hidden structure may be removed by a type of controlled rewriting, called rippling, that leaves the rest of the term unaltered. Rippling has proved highly successful in inductive theorem proving. Difference matching allows us to use rippling in other contexts, e.g., equational, inequational, and propositional reasoning. We… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Guiding Induction Proofs

CADE • 1990
View 5 Excerpts
Highly Influenced

F

A. Bundy, A. Stevens
van Harmelen, A. Ireland, and A. Smaill. Rippling: A heuristic for guiding inductive proofs. Research Paper 567, Dept. of Artificial Intelligence, Edinburgh • 1991
View 3 Excerpts

Higher-Order Critical Pairs

LICS • 1991
View 1 Excerpt

Digricoli. The management of heuristic search in boolean experiments with RUE resolution

J Vincent
In 9th IJCAI, • 1985
View 1 Excerpt

Similar Papers

Loading similar papers…