Lifting Transformations

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5970

Full metadata record

DC Field	Value	Language
dc.creator	McAllester, David	-
dc.creator	Siskind, Jeffrey	-
dc.date	2004-10-04T14:24:23Z	-
dc.date	2004-10-04T14:24:23Z	-
dc.date	1991-12-01	-
dc.date.accessioned	2013-10-09T02:42:09Z	-
dc.date.available	2013-10-09T02:42:09Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-1343	-
dc.identifier	http://hdl.handle.net/1721.1/5970	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	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.	-
dc.format	17 p.	-
dc.format	1469265 bytes	-
dc.format	1157218 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-1343	-
dc.subject	lifting	-
dc.subject	search	-
dc.subject	programming language semantics	-
dc.subject	snondeterministic programming	-
dc.subject	automated reasoning	-
dc.subject	Lisp	-
dc.title	Lifting Transformations	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI