Skip to Main Content (Press Enter)

Logo CNR
  • ×
  • Home
  • People
  • Outputs
  • Organizations
  • Expertise & Skills

UNI-FIND
Logo CNR

|

UNI-FIND

cnr.it
  • ×
  • Home
  • People
  • Outputs
  • Organizations
  • Expertise & Skills
  1. Outputs

Any-world assumptions in logic programming

Academic Article
Publication Date:
2005
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.
Iris type:
01.01 Articolo in rivista
Keywords:
Deduction and Theorem Proving; Logic programming
List of contributors:
Straccia, Umberto
Authors of the University:
STRACCIA UMBERTO
Handle:
https://iris.cnr.it/handle/20.500.14243/37380
Published in:
THEORETICAL COMPUTER SCIENCE
Journal
  • Use of cookies

Powered by VIVO | Designed by Cineca | 26.5.0.0 | Sorgente dati: PREPROD (Ribaltamento disabilitato)