Weak and strong disjunction in possibilistic ASP

  • Authors:

  • Kim Bauters;Steven Schockaert;Martine De Cock;Dirk Vermeir

  • Affiliations:

  • Department of Applied Mathematics and Computer Science, Universiteit Gent, Gent, Belgium;Department of Applied Mathematics and Computer Science, Universiteit Gent, Gent, Belgium;Department of Applied Mathematics and Computer Science, Universiteit Gent, Gent, Belgium;Department of Computer Science, Vrije Universiteit Brussel, Brussel, Belgium

  • Venue:
  • SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.