An Abstract Machine for Fixed-Order Dynamically Stratified Programs

Sagonas, K; Swift, T; Warren, D

dc.contributor.author	Sagonas, K	en
dc.contributor.author	Swift, T	en
dc.contributor.author	Warren, D	en
dc.date.accessioned	2014-03-01T02:48:21Z
dc.date.available	2014-03-01T02:48:21Z
dc.date.issued	1996	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33761
dc.subject	Abstract Machine	en
dc.subject	Left To Right	en
dc.subject	Logic Programs	en
dc.subject	Stratification	en
dc.subject	Well Founded Semantics	en
dc.title	An Abstract Machine for Fixed-Order Dynamically Stratified Programs	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/3-540-61511-3_98	en
heal.identifier.secondary	http://dx.doi.org/10.1007/3-540-61511-3_98	en
heal.publicationDate	1996	en
heal.abstract	It is known that a fixed computation rule, such as used in most logic programming systems, does not suffice for normal logic programs. For instance, SLS resolution, which evaluates programs according to the well-founded semantics, makes use of an oracle to determine the next literal to select in [5], and of ideal parallelism in [8]. Given these limits, it is	en
heal.journalName	Conference on Automated Deduction	en
dc.identifier.doi	10.1007/3-540-61511-3_98	en