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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Tabulated resolution for the well-founded semantics
Uppsala University.
Uppsala University.
1998 (English)In: JOURNAL OF LOGIC PROGRAMMING, ISSN 0743-1066, Vol. 34, no 2, 67-109 p.Article in journal (Other scientific) Published
Abstract [en]

Based on the search forest for positive programs as defined by Bol and Degerstedt, we define a tabulation-based framework that is sound and complete (when floundering does not occur) w.r the well-founded semantics. In contrast to SLS-resolution as propose

Place, publisher, year, edition, pages
ELSEVIER SCIENCE INC , 1998. Vol. 34, no 2, 67-109 p.
Keyword [en]
LOGIC PROGRAMS; NEGATION
Identifiers
URN: urn:nbn:se:uu:diva-28386OAI: oai:DiVA.org:uu-28386DiVA: diva2:56282
Note
Addresses: Bol R, Univ Uppsala, CSD, S-75105 Uppsala, Sweden. Univ Uppsala, CSD, S-75105 Uppsala, Sweden. InfoSyst AB, SoftLab, S-11122 Stockholm, Sweden.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-14

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 361 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf