Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Weak and strong disjunction in possibilistic ASP

Bauters, Kim, Schockaert, Steven ORCID:, De Cock, Martine and Vermeir, Dirk 2011. Weak and strong disjunction in possibilistic ASP. Presented at: SUM 2011: 5th International Conference on Scalable Uncertainty Management, Dayton, OH, USA, 10-13 October 2011. Published in: Benferhat, S. and Grant, J. eds. Scalable Uncertainty Management: 5th International Conference, SUM 2011, Dayton, OH, USA, October 10-13, 2011. Proceedings. Lecture Notes in Computer Science. Lecture Notes in Computer Science , vol.6929 Berlin and Heidelberg: Springer, pp. 475-488. 10.1007/978-3-642-23963-2_37

Full text not available from this repository.


Possibilistic answer set programming (PASP) unites answer set programming (ASP) and possibilistic logic (PL) by associating certainty values with rules. The resulting framework allows to combine both non-monotonic reasoning and reasoning under uncertainty in a single framework. While PASP has been well-studied for possibilistic definite and possibilistic normal programs, we argue that the current semantics of possibilistic disjunctive programs are not entirely satisfactory. The problem is twofold. First, the treatment of negation-as-failure in existing approaches follows an all-or-nothing scheme that is hard to match with the graded notion of proof underlying PASP. Second, we advocate that the notion of disjunction can be interpreted in several ways. In particular, in addition to the view of ordinary ASP where disjunctions are used to induce a non-deterministic choice, the possibilistic setting naturally leads to a more epistemic view of disjunction. In this paper, we propose a semantics for possibilistic disjunctive programs, discussing both views on disjunction. Extending our earlier work, we interpret such programs as sets of constraints on possibility distributions, whose least specific solutions correspond to answer sets.

Item Type: Conference or Workshop Item (Paper)
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Publisher: Springer
ISSN: 0302-9743
Last Modified: 25 Oct 2022 09:42

Citation Data

Cited 6 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item