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-01T01:50:59Z
dc.date.available	2014-03-01T01:50:59Z
dc.date.issued	2001	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/26199
dc.subject	Deductive Databases	en
dc.subject	non-monotonic reasoning	en
dc.subject	Search Strategy	en
dc.subject	Stratification	en
dc.subject	Well Founded Semantics	en
dc.title	The limits of fixed-order computation	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0304-3975(99)00341-2	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0304-3975(99)00341-2	en
heal.publicationDate	2001	en
heal.abstract	Abstract: Fixed-order computation rules, used by Prolog and most deductive database systems, do notsuffice to compute the well-founded semantics [29] because they cannot properly resolve loopsthrough negation. This inadequacy is reflected both in formulations of SLS-resolution [17, 23]which is an ideal search strategy, and in more practical strategies like SLG [5], or Well-FoundedOrdered Search [27]. Typically, these practical strategies combine	en
heal.journalName	Theoretical Computer Science	en
dc.identifier.doi	10.1016/S0304-3975(99)00341-2	en