Any-world assumptions in logic programming (Articolo in rivista)

Type

• Articolo in rivista (Classe)
• Prodotto della ricerca (Classe)

Label

• Any-world assumptions in logic programming (Articolo in rivista) (literal)

Anno

• 2005-01-01T00:00:00+01:00 (literal)

Alternative label

• Loyer Y.; Straccia U. (2005)
  Any-world assumptions in logic programming
  in Theoretical computer science
  (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

• Loyer Y.; Straccia U. (literal)

Pagina inizio

• 351 (literal)

Pagina fine

• 381 (literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume

• 342 (literal)

Rivista

• Theoretical computer science (Rivista)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note

• Vol. 342 n. 2-3 (2005). Elsevier Science Publishers, 2005. (literal)

Note

• ISI Web of Science (WOS) (literal)

Titolo

• Any-world assumptions in logic programming (literal)

Abstract

• Due to the usual incompleteness of information representation, any approach to assign a semantics to logic programs has to rely on a default assumption on the missing information. The emph{stable model semantics}, that has become the dominating approach to give semantics to logic programs, relies on the Closed World Assumption (CWA), which asserts that by default the truth of an atom is emph{false}. There is a second well-known assumption, called emph{Open World Assumption} (OWA), which asserts that the truth of the atoms is supposed to be emph{unknown} by default. However, the CWA, the OWA and the combination of them are extremal, though important, assumptions over a large variety of possible assumptions on the truth of the atoms, whenever the truth is taken from emph{an arbitrary truth space}. The topic of this paper is to allow emph{any} assignment (ie interpretation), over a truth space, to be a default assumption. Our main result is that our extension is conservative in the sense that under the ``everywhere false' default assumption (CWA) the usual stable model semantics is captured. Due to the generality and the purely algebraic nature of our approach, it abstracts from the particular formalism of choice and the results may be applied in other contexts as well. (literal)

Prodotto di

• Digital Libraries (ICT.P08.010.002) (Modulo)
• Istituto di scienza e tecnologie dell'informazione \"Alessandro Faedo\" (ISTI) (Istituto)

Insieme di parole chiave

• Parole chiave di "Any-world assumptions in logic programming" (Insieme di parole chiave)

Incoming links:

Prodotto

• Istituto di scienza e tecnologie dell'informazione \"Alessandro Faedo\" (ISTI) (Istituto)
• Digital Libraries (ICT.P08.010.002) (Modulo)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi

• Theoretical computer science (Rivista)

Insieme di parole chiave di

• Parole chiave di "Any-world assumptions in logic programming" (Insieme di parole chiave)