PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Loyer Y., Straccia U. Any-World Assumptions in Logic Programming. In: Theoretical Computer Science, vol. 342 (2-3) pp. 351 - 381. Elsevier Science Publishers Ltd, 2005.
 
 
Abstract
(English)
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} assignmen (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.
Subject Logic programming
Non-monotonic reasoning
I.2.3 Deduction and Theorem Proving. Logic programming


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional