Extending Answer Set Programming using Generalized Possibilistic Logic
Didier Dubois, Henri M. Prade, Steven Schockaert · ORCA Online Research @Cardiff (Cardiff University) · 2015
Answer set programming (ASP) is a form of logic programming in which negation-as-failure is de-fined in a purely declarative way, based on the no-tion of a stable model. This short paper briefly ex-plains how a recent generalization of possibilistic logic (GPL) can be used to characterize the seman-tics of answer set programming. This characteriza-tion has several advantages over existing character-izations of the stable model semantics. First, un-like reduct-based approaches, it does not rely on a syntactic procedure: we can directly characterize answer sets based on the minimally specific mod-els of a GPL theory. Second, GPL enables us to study extensions of ASP in an intuitive way: unlike in existing generalizations of ASP such as equilib-rium logic and autoepistemic logic, all formulas in GPL have a meaning which is intuitively clear. Fi-nally, being based on possibilistic logic, GPL offers a natural way of dealing with uncertainty in answer set programs. 1