An abstract machine for efficiently computing queries to well-founded models
2000 (English)In: JOURNAL OF LOGIC PROGRAMMING, ISSN 0743-1066, Vol. 45, no 1-3, 1-41 p.Article in journal (Refereed) Published
The well-founded semantics has gained wide acceptance partly because it is a skeptical semantics. 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 w
Place, publisher, year, edition, pages
ELSEVIER SCIENCE INC , 2000. Vol. 45, no 1-3, 1-41 p.
tabling; WAM; SLG-WAM; SLG resolution; well-founded semantics; deductive databases; non-monotonic reasoning; XSB; implementation; GENERAL LOGIC PROGRAMS; SEMANTICS; RESOLUTION; SYSTEM
IdentifiersURN: urn:nbn:se:uu:diva-36547OAI: oai:DiVA.org:uu-36547DiVA: diva2:64446
Addresses: Sagonas K, Univ Uppsala, Dept Comp Sci, Box 311, S-75105 Uppsala, Sweden. Univ Uppsala, Dept Comp Sci, S-75105 Uppsala, Sweden. Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA. SUNY Stony Brook, Dept Comp Sci, Stony Brook, NY 11794 USA.2008-10-172008-10-172011-01-14