The Limits of Fixed-Order Computation

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:23Z
dc.date.available	2014-03-01T02:48:23Z
dc.date.issued	1996	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33780
dc.subject	Left To Right	en
dc.subject	non-monotonic reasoning	en
dc.subject	Search Strategy	en
dc.subject	Well Founded Semantics	en
dc.title	The Limits of Fixed-Order Computation	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/BFb0031750	en
heal.identifier.secondary	http://dx.doi.org/10.1007/BFb0031750	en
heal.publicationDate	1996	en
heal.abstract	ormulate the class of left-to-right dynamically strati'ed programs , and show that this class properly includes other classes of!xed-order strati!ed programs. We then introduce SLGstrat, a variant ofSLG resolution that uses a !xed-order computation rule, and prove that it correctly evaluates ground left-to-right dynamically strati!ed programs. Finally, we indicate how SLGstrat can be used as a basis for computing the	en
heal.journalName	Logic in Databases	en
dc.identifier.doi	10.1007/BFb0031750	en