论文信息 - Properties of Substitutions and Unifications

Properties of Substitutions and Unifications

In this paper the set of first order substitutions with a partial ordering ''more general than'' is investigated. It is proved that the set of equivalence classes of idempotent substitutions together with an added greatest element is a complete lattice. A simultaneous unification of finitely many finite sets of terms can be reduced to unifying each of the sets of terms separately and to building the supremum of the most general unifiers in this lattice afterwards. This saves time in an automatic proof procedure when combined with the concept of weak unification also introduced in this paper.

Elmar Eder | E. Eder

[1] Alberto Martelli,et al. An Efficient Unification Algorithm , 1982, TOPL.

[2] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[3] François Fages,et al. Complete Sets of Unifiers and Matchers in Equational Theories , 1983, CAAP.

[4] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[5] Mike Paterson,et al. Linear unification , 1976, STOC '76.

[6] Rona B. Stillman. The Concept of Weak Substitution in Theorem-Proving , 1973, JACM.

[7] Gerard Huet,et al. Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).