License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.05171.6
URN: urn:nbn:de:0030-drops-2641
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2005/264/
Go to the corresponding Portal

Nicolas, Pascal ; Garcia, Laurent ; Stéphan, Igor

Possibilistic Stable Models

pdf-format:
05171.NicolasPascal.Other.264.pdf (0.2 MB)

Abstract

We present the main lines of a new framework that we have defined in order to improve the knowledge representation power of Answer Set Programming paradigm.
Our proposal is to use notions from possibility theory to extend the stable model semantics by taking into account a certainty level, expressed in terms of necessity measure, on each rule of a normal logic program.
First of all, we introduce possibilistic definite logic programs and show how to compute the conclusions of such programs both in syntactic and semantic ways. The syntactic handling is done by help of a fix-point operator, the semantic part relies on a possibility distribution on all sets of atoms and the two approaches are shown to be equivalent.
In a second part, we define what is a possibilistic stable model for a normal logic program, with default negation. Again, we define a possibility distribution allowing to determine the stable models.
We end our presentation by showing how we can use our framework to adressing inconsistency in Answer Set Programming.

BibTeX - Entry

@InProceedings{nicolas_et_al:DagSemProc.05171.6,
  author =	{Nicolas, Pascal and Garcia, Laurent and St\'{e}phan, Igor},
  title =	{{Possibilistic Stable Models}},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5171},
  editor =	{Gerhard Brewka and Ilkka Niemel\"{a} and Torsten Schaub and Miroslaw Truszczynski},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2005/264},
  URN =		{urn:nbn:de:0030-drops-2641},
  doi =		{10.4230/DagSemProc.05171.6},
  annote =	{Keywords: Non monotonic reasoning, uncertainty, possibility theory}
}

Keywords: Non monotonic reasoning, uncertainty, possibility theory
Collection: 05171 - Nonmonotonic Reasoning, Answer Set Programming and Constraints
Issue Date: 2005
Date of publication: 14.09.2005

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI