umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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
Extending Well-Founded Semantics with Clark's Completion for Disjunctive Logic Programs
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2018 (English)In: Scientific Programming, ISSN 1058-9244, E-ISSN 1875-919X, article id 4157030Article in journal (Refereed) Published
Abstract [en]

In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable semantics (STABLE). For normal programs, this semantics is based on suitable integration of the well-founded semantics (WFS) and the Clark's completion. D3-WFS-DCOMhas the following appealing properties: First, it agrees with STABLE in the sense that it never defines a nonminimal model or a nonminimal supported model. Second, for normal programs it extends WFS. Third, every stable model of a disjunctive program.. is a D3-WFS-DCOM model of P. Fourth, it is constructed using transformation rules accepted by STABLE. We also introduce second semantics that we call D2-WFS-DCOMP. We show that D2-WFS-DCOMP is equivalent to D3-WFS-DCOMP for normal programs but this is not the case for disjunctive programs. We also introduce third new semantics that supports the use of implicit disjunctions. We illustrate how these semantics can be extended to programs including explicit negation, default negation in the head of a clause, and a lub operator, which is a generalization of the aggregation operator setof over arbitrary complete lattices.

Place, publisher, year, edition, pages
Hindawi Publishing Corporation, 2018. article id 4157030
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:umu:diva-146463DOI: 10.1155/2018/4157030ISI: 000427608000001OAI: oai:DiVA.org:umu-146463DiVA, id: diva2:1196661
Available from: 2018-04-10 Created: 2018-04-10 Last updated: 2018-06-09Bibliographically approved

Open Access in DiVA

fulltext(1526 kB)65 downloads
File information
File name FULLTEXT01.pdfFile size 1526 kBChecksum SHA-512
bb08c4309803a1986eb6b249d5474417cae574b9e7433ce229264978df3c7d28a5a92c280f5553fcad56627ede149cb1a7341748048bb3b4dfa320fcb44ea9aa
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Nieves, Juan Carlos

Search in DiVA

By author/editor
Nieves, Juan Carlos
By organisation
Department of Computing Science
In the same journal
Scientific Programming
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 65 downloads
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

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 180 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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