An abstract machine for efficiently computing queries to well-founded models

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:49:08Z
dc.date.available	2014-03-01T01:49:08Z
dc.date.issued	2000	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25696
dc.subject	Abstract Machine	en
dc.subject	Deductive Databases	en
dc.subject	Logic Programs	en
dc.subject	non-monotonic reasoning	en
dc.subject	Stable Models	en
dc.subject	Warren Abstract Machine	en
dc.subject	Well Founded Semantics	en
dc.title	An abstract machine for efficiently computing queries to well-founded models	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/S0743-1066(00)00005-4	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0743-1066(00)00005-4	en
heal.publicationDate	2000	en
heal.abstract	The well-founded semantics has gained wide acceptance partly because it is a skeptical se- mantics. That is, the well-founded model posits as unknown atoms which are deemed true or false in other formalisms such as stable models. This skepticism makes the well-founded model not only useful in itself, but also suitable as a basis for other forms of non-monotonic reason-	en
heal.journalName	Journal of Logic Programming	en
dc.identifier.doi	10.1016/S0743-1066(00)00005-4	en