Skip to Main content Skip to Navigation
Conference papers

Extending Answer Set Programming using Generalized Possibilistic Logic

Abstract : Answer set programming (ASP) is a form of logic programming in which negation-as-failure is defined in a purely declarative way, based on the notion of a stable model. This short paper briefly explains how a recent generalization of possibilistic logic (GPL) can be used to characterize the semantics of answer set programming. This characterization has several advantages over existing characterizations of the stable model semantics. First, unlike reduct-based approaches, it does not rely on a syntactic procedure: we can directly characterize answer sets based on the minimally specific models 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 equilibrium logic and autoepistemic logic, all formulas in GPL have a meaning which is intuitively clear. Finally, being based on possibilistic logic, GPL offers a natural way of dealing with uncertainty in answer set programs.
Keywords : Logic
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Monday, March 14, 2016 - 10:16:41 AM
Last modification on : Wednesday, June 15, 2022 - 4:16:53 AM
Long-term archiving on: : Sunday, November 13, 2016 - 5:55:11 PM


Files produced by the author(s)


  • HAL Id : hal-01287713, version 1
  • OATAO : 15503


Didier Dubois, Henri Prade, Steven Schockaert. Extending Answer Set Programming using Generalized Possibilistic Logic. IJCAI Workshop 13 Ontologies and Logic Programming for Query Answering (ONTOLP 2015), Jul 2015, Buenos Aires, Argentina. pp. 8-12. ⟨hal-01287713⟩



Record views


Files downloads