Unification procedures in automated deduction methods based on matings: A survey

@inproceedings{Gallier1992UnificationPI,
  title={Unification procedures in automated deduction methods based on matings: A survey},
  author={Jean H. Gallier},
  booktitle={Tree Automata and Languages},
  year={1992}
}
Unification procedures arising in methods for automated theorem proving based on matings are surveyed. We begin by reviewing some fundamentals of automated deduction, including the Skolem form and the SkolemHerbrand-Gödel theorem. Next, the method of matings for first-order languages without equality due to Andrews and Bibel is presented. Standard unification is described in terms of transformations on systems (following the approach of Martelli and Montanari, anticipated by Herbrand). Some… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

Efficient Functional Unification and Substitution

Atze Dijkstra Arie Middelkoop S. Doaitse Swierstra
2008
View 1 Excerpt

References

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

Linear Unification

J. Comput. Syst. Sci. • 1978
View 3 Excerpts
Highly Influenced

Application au typage polymorphique des objects enregistrements dans les languages fonctionnels." Thkse

Rkmy, Didier, Algkbres Touffues
Universitk Paris VII, • 1990
View 1 Excerpt

Records and variants as a natural extension in ML,

Rkmy, Didier
Sixteenth ACM Annual Symposium on Principles of Programming Languages, Austin Texas, • 1989
View 2 Excerpts

Unification Revisited

J .-L, M. Maher, K. Marriot
Foundations of Deductive Databases and Logic Programming, • 1988

Simple Word Problems in Univeral Algebras," in Computational Problems in Abstract Algebra

D.E, P. B. Bendix
"Complexity of Finitely Presented Algebras," Technical Report T R 76-294, • 1970

Similar Papers

Loading similar papers…