Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-10T17:26:35.987Z Has data issue: false hasContentIssue false
  • English
  • Français

Epistemic foundation of stable model semantics

Published online by Cambridge University Press:  21 June 2006

YANN LOYER  and
UMBERTO STRACCIA
YANN LOYER
Affiliation:
Laboratoire PRiSM, Université de Versailles Saint Quentin, Versailles, France (e-mail: Yann.Loyer@prism.uvsq.fr)
UMBERTO STRACCIA
Affiliation:
Istituto di Scienza e Tecnologie dell'Informazione “A. Faedo”, Consiglio Nazionale delle Ricerche, Pisa, Italy (e-mail: straccia@isti.cnr.it)
Get access Rights & Permissions [Opens in a new window]

Abstract

Stable model semantics has become a very popular approach for the management of negation in logic programming. This approach relies mainly on the closed world assumption to complete the available knowledge and its formulation has its basis in the so-called Gelfond–Lifschitz transformation. The primary goal of this work is to present an alternative and epistemic-based characterization of stable model semantics, to the Gelfond-Lifschitz transformation. In particular, we show that stable model semantics can be defined entirely as an extension of the Kripke-Kleene semantics. Indeed, we show that the closed world assumption can be seen as an additional source of ‘falsehood’ to be added cumulatively to the Kripke-Kleene semantics. Our approach is purely algebraic and can abstract from the particular formalism of choice as it is based on monotone operators (under the knowledge order) over bilattices only.

Keywords

BilatticesFixed-point semanticsLogic programsStable model semanticsNon-monotonic reasoning
Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 6 , Issue 4 , July 2006 , pp. 355 - 393
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)