Pattern-Directed Invocation with Changing Equations

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

Full metadata record

DC Field	Value	Language
dc.creator	Feldman, Yishai A.	-
dc.creator	Rich, Charles	-
dc.date	2004-10-04T14:57:52Z	-
dc.date	2004-10-04T14:57:52Z	-
dc.date	1988-05-01	-
dc.date.accessioned	2013-10-09T02:45:38Z	-
dc.date.available	2013-10-09T02:45:38Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-1017	-
dc.identifier	http://hdl.handle.net/1721.1/6484	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	The interaction of pattern-directed invocation with equality in an automated reasoning system gives rise to a completeness problem. In such systems, a demon needs to be invoked not only when its pattern exactly matches a term in the reasoning data base, but also when it is possible to create a variant that matches. An incremental algorithm has been developed which solves this problem without generating all possible variants of terms in the database. The algorithm is shown to be complete for a class of demons, called transparent demons, in which there is a well-behaved logical relationship between the pattern and the body of the demon.	-
dc.format	4504217 bytes	-
dc.format	1752074 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-1017	-
dc.title	Pattern-Directed Invocation with Changing Equations	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI