uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
The limits of fixed-order computation
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. COMPUTING SCIENCE DEPARTMENT.
2001 (English)In: THEORETICAL COMPUTER SCIENCE, ISSN 0304-3975, Vol. 254, no 1-2, 465-499 p.Article in journal (Refereed) Published
Abstract [en]

Fixed-order computation rules, used by Prolog and most deductive database systems, do not suffice to compute the well-founded semantics (Van Gelder ct al., J. ACM 38(3) (1991) 620-650) because they cannot properly resolve loops through negation. This inad

Place, publisher, year, edition, pages
ELSEVIER SCIENCE BV , 2001. Vol. 254, no 1-2, 465-499 p.
Keyword [en]
stratification theories; well-founded semantics; non-monotonic reasoning; tabling; WELL-FOUNDED SEMANTICS; GENERAL LOGIC PROGRAMS; ALTERNATING FIXPOINT; NEGATION; RESOLUTION; SYSTEM; MODEL
URN: urn:nbn:se:uu:diva-36546OAI: oai:DiVA.org:uu-36546DiVA: diva2:64445
Addresses: Sagonas K, Univ Uppsala, Dept Comp Sci, Box 311, S-75105 Uppsala, Sweden. Univ Uppsala, Dept Comp Sci, S-75105 Uppsala, Sweden. SUNY Stony Brook, Dept Comp Sci, Stony Brook, NY 11794 USA.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-13

Open Access in DiVA

No full text

By organisation
Department of Information Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 148 hits
ReferencesLink to record
Permanent link

Direct link