Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
Possibilistic Answer Set Programming Revisited
Kim Bauters, Steven Schockaert, Martine De Cock, Dirk Vermeir
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.
Pages: 48-55
PS Link:
PDF Link: /papers/10/p48-bauters.pdf
AUTHOR = "Kim Bauters and Steven Schockaert and Martine De Cock and Dirk Vermeir",
TITLE = "Possibilistic Answer Set Programming Revisited",
BOOKTITLE = "Proceedings of the Twenty-Sixth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-10)",
ADDRESS = "Corvallis, Oregon",
YEAR = "2010",
PAGES = "48--55"

hosted by DSL   •   site info   •   help