Possibilistic Answer Set Programming Revisited

Kim Bauters, Steven Schockaert, Martine De Cock, Dirk Vermeir

Research output: Chapter in Book/Report/Conference proceedingConference contribution

25 Citations (Scopus)

Abstract

Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an application point of view, existing semantics are not well-motivated, and do not always yield intuitive results. To develop a more suitable semantics, we first introduce a characterization of answer sets of classical ASP programs in terms of possibilistic logic where an ASP program specifies a set of constraints on possibility distributions. This characterization is then naturally generalized to define answer sets of PASP programs. We furthermore provide a syntactic counterpart, leading to a possibilistic generalization of the well-known Gelfond-Lifschitz reduct, and we show how our framework can readily be implemented using standard ASP solvers.
Original languageEnglish
Title of host publicationProceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010)
EditorsPeter Grünwald, Peter Spirtes
PublisherAUAI Press
Number of pages8
ISBN (Print)9780974903965
Publication statusPublished - 2010
EventThe 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010) - Catalina Island, California, United States
Duration: 08 Jul 201011 Jul 2010

Conference

ConferenceThe 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010)
CountryUnited States
CityCalifornia
Period08/07/201011/07/2010

Fingerprint

Syntactics
Semantics

Cite this

Bauters, K., Schockaert, S., Cock, M. D., & Vermeir, D. (2010). Possibilistic Answer Set Programming Revisited. In P. Grünwald, & P. Spirtes (Eds.), Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010) AUAI Press.
Bauters, Kim ; Schockaert, Steven ; Cock, Martine De ; Vermeir, Dirk. / Possibilistic Answer Set Programming Revisited. Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010). editor / Peter Grünwald ; Peter Spirtes. AUAI Press, 2010.
@inproceedings{19508aac9a2a4f27a7079ae2bc306485,
title = "Possibilistic Answer Set Programming Revisited",
abstract = "Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an application point of view, existing semantics are not well-motivated, and do not always yield intuitive results. To develop a more suitable semantics, we first introduce a characterization of answer sets of classical ASP programs in terms of possibilistic logic where an ASP program specifies a set of constraints on possibility distributions. This characterization is then naturally generalized to define answer sets of PASP programs. We furthermore provide a syntactic counterpart, leading to a possibilistic generalization of the well-known Gelfond-Lifschitz reduct, and we show how our framework can readily be implemented using standard ASP solvers.",
author = "Kim Bauters and Steven Schockaert and Cock, {Martine De} and Dirk Vermeir",
year = "2010",
language = "English",
isbn = "9780974903965",
editor = "Peter Gr{\"u}nwald and Peter Spirtes",
booktitle = "Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010)",
publisher = "AUAI Press",

}

Bauters, K, Schockaert, S, Cock, MD & Vermeir, D 2010, Possibilistic Answer Set Programming Revisited. in P Grünwald & P Spirtes (eds), Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010). AUAI Press, The 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010), California, United States, 08/07/2010.

Possibilistic Answer Set Programming Revisited. / Bauters, Kim; Schockaert, Steven; Cock, Martine De; Vermeir, Dirk.

Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010). ed. / Peter Grünwald; Peter Spirtes. AUAI Press, 2010.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Possibilistic Answer Set Programming Revisited

AU - Bauters, Kim

AU - Schockaert, Steven

AU - Cock, Martine De

AU - Vermeir, Dirk

PY - 2010

Y1 - 2010

N2 - Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an application point of view, existing semantics are not well-motivated, and do not always yield intuitive results. To develop a more suitable semantics, we first introduce a characterization of answer sets of classical ASP programs in terms of possibilistic logic where an ASP program specifies a set of constraints on possibility distributions. This characterization is then naturally generalized to define answer sets of PASP programs. We furthermore provide a syntactic counterpart, leading to a possibilistic generalization of the well-known Gelfond-Lifschitz reduct, and we show how our framework can readily be implemented using standard ASP solvers.

AB - Possibilistic answer set programming (PASP) extends answer set programming (ASP) by attaching to each rule a degree of certainty. While such an extension is important from an application point of view, existing semantics are not well-motivated, and do not always yield intuitive results. To develop a more suitable semantics, we first introduce a characterization of answer sets of classical ASP programs in terms of possibilistic logic where an ASP program specifies a set of constraints on possibility distributions. This characterization is then naturally generalized to define answer sets of PASP programs. We furthermore provide a syntactic counterpart, leading to a possibilistic generalization of the well-known Gelfond-Lifschitz reduct, and we show how our framework can readily be implemented using standard ASP solvers.

M3 - Conference contribution

SN - 9780974903965

BT - Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010)

A2 - Grünwald, Peter

A2 - Spirtes, Peter

PB - AUAI Press

ER -

Bauters K, Schockaert S, Cock MD, Vermeir D. Possibilistic Answer Set Programming Revisited. In Grünwald P, Spirtes P, editors, Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010). AUAI Press. 2010