Semantics for possibilistic answer set programs: Uncertain rules versus rules with uncertain conclusions
Alternative semantics for possibilistic answer set programming are introduced. The weight associated with each rule can be treated in two dual ways. Existing semantics consider weighted epistemic states. The new semantics consider Boolean epistemic states with varying compatibility. We contrast both views and find the new approach to be computationally more complex.
logic programming non-monotonic reasoning possibility theory uncertainty stable model semantics