Lifting Transformations

McAllester, David; Siskind, Jeffrey

Lifting Transformations

Name

AIM-1343.pdf

Size

1.1 MB

Format

Adobe PDF

Checksum (MD5)

e5398e05b89a238ac7663e996eb27f7f

Name

AIM-1343.ps

Size

1.4 MB

Format

PostScript

Checksum (MD5)

0275625bee66601ce4e16d2d97cf027f

Author(s)

McAllester, David

•

Siskind, Jeffrey

Date Issued

December 1, 1991

Series/Report no.

AIM-1343

Abstract

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.

Subjects

lifting

search

programming language semantics

snondeterministic programming

automated reasoning

Lisp

Persistent DSpace Link

http://hdl.handle.net/1721.1/5970