论文信息 - A General Complete E-Unification Procedure - 字舞流文

A General Complete E-Unification Procedure

Wayne Snyder | Jean H. Gallier

[1] Corrado Moiso,et al. An Algorithm for Unification in Equational Theories , 1986, SLP.

[2] Claude Kirchner. Computing Unification Algorithms , 1986, LICS.

[3] Dexter Kozen. Communication: Positive First-Order Logic is NP-Complete , 1981, IBM J. Res. Dev..

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

[5] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

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

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

[8] Jean H. Gallier,et al. Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[9] Jörg H. Siekmann,et al. Universal Unification , 1982, GWAI.

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

[11] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .

[12] Wayne Snyder,et al. Theorem Proving Using Rigid E-Unification Equational Matings , 1987, LICS.