Umeå universitets logga

umu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Possibilistic nested logic programs and strong equivalence
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
2015 (Engelska)Ingår i: International Journal of Approximate Reasoning, ISSN 0888-613X, E-ISSN 1873-4731, Vol. 59, s. 1-19Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

In this paper, the class of possibilistic nested logic programs is introduced. These possibilistic logic programs allow us to use nested expressions in the bodies and heads of their rules. By considering a possibilistic nested logic program as a possibilistic theory, a construction of a possibilistic logic programing semantics based on answer sets for nested logic programs and the proof theory of possibilistic logic is defined. In order to define a general method for computing the possibilistic answer sets of a possibilistic nested program, the idea of equivalence between possibilistic nested programs is explored. By considering properties of equivalence between possibilistic programs, a process of transforming a possibilistic nested logic program into a possibilistic disjunctive logic program is defined. Given that our approach is an extension of answer set programming, we also explore the concept of strong equivalence between possibilistic nested logic programs. To this end, we introduce the concept of poss SE-models. Therefore, we show that two possibilistic nested logic programs are strong equivalents whenever they have the same poss SE-models.

The expressiveness of the possibilistic nested logic programs is illustrated by a scenario from the medical domain. In particular, we exemplify how possibilistic nested logic programs are expressive enough for capturing medical guidelines which are pervaded by vagueness and qualitative information.

Ort, förlag, år, upplaga, sidor
2015. Vol. 59, s. 1-19
Nyckelord [en]
Answer set programming; Uncertain information; Possibilistic reasoning
Nationell ämneskategori
Datorsystem
Identifikatorer
URN: urn:nbn:se:umu:diva-99990DOI: 10.1016/j.ijar.2015.01.004ISI: 000351793300001Scopus ID: 2-s2.0-84927738080OAI: oai:DiVA.org:umu-99990DiVA, id: diva2:789152
Tillgänglig från: 2015-02-17 Skapad: 2015-02-17 Senast uppdaterad: 2023-03-24Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Nieves, Juan CarlosLindgren, Helena

Sök vidare i DiVA

Av författaren/redaktören
Nieves, Juan CarlosLindgren, Helena
Av organisationen
Institutionen för datavetenskap
I samma tidskrift
International Journal of Approximate Reasoning
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 588 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf