Lifting Transformations

Lifting is a well known technique in resolution theorem proving, logic programming, and term rewriting. In this paper we formulate lifting as an efficiency-motivated program transformation applicable to a wide variety of nondeterministic procedures. This formulation allows the immediate lifting of complex procedures, such as the Davis-Putnam algorithm, which are otherwise difficult to lift. We treat both classical lifting, which is based on unification, and various closely related program transformations which we also call lifting transformations. These nonclassical lifting transformations are closely related to constraint techniques in logic programming, resolution, and term rewriting.

[1]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[2]  Pascal Van Hentenryck Constraint satisfaction in logic programming , 1989, Logic programming.

[3]  David A. McAllester,et al.  Screamer: A Portable Efficient Implementation of Nondeterministic Common LISP , 1993 .

[4]  Tobias Nipkow,et al.  Ordered Rewriting and Confluence , 1990, CADE.

[5]  Robert W. Floyd,et al.  Nondeterministic Algorithms , 1967, JACM.

[6]  E. Hansen,et al.  Nonlinear equations and optimization , 1993 .

[7]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[8]  Christopher T. Haynes,et al.  Logic Continuations , 1986, J. Log. Program..

[9]  John McCarthy,et al.  A BASIS FOR A MATHEMATICAL THEORY OF COMPUTATION 1) , 2018 .

[10]  David A. McAllester,et al.  Systematic Nonlinear Planning , 1991, AAAI.

[11]  Christos H. Papadimitriou,et al.  The complexity of recognizing polyhedral scenes , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[12]  Gerald E. Peterson,et al.  Complete Sets of Reductions with Constraints , 1990, CADE.

[13]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[14]  David A. McAllester,et al.  Nondeterministic Lisp as a Substrate for Constraint Logic Programming , 1993, AAAI.

[15]  B. M. Fulk MATH , 1992 .

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

[17]  David A. McAllester Truth Maintenance , 1990, AAAI.