Document Open Access Logo

Possibilistic Nested Logic Programs

Authors Juan Carlos Nieves, Helena Lindgren

Thumbnail PDF


  • Filesize: 386 kB
  • 10 pages

Document Identifiers

Author Details

Juan Carlos Nieves
Helena Lindgren

Cite AsGet BibTex

Juan Carlos Nieves and Helena Lindgren. Possibilistic Nested Logic Programs. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 267-276, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)


We introduce the class of possibilistic nested logic programs. These possibilistic logic programs allow us to use nested expressions in the bodies and the heads of their rules. By considering a possibilistic nested logic program as a possibilistic theory, a construction of a possibilistic logic programing semantics based on answer sets for nested logic programs and the proof theory of possibilistic logic is defined. We show that this new semantics for possibilistic logic programs is computable by means of transforming possibilistic nested logic programs into possibilistic disjunctive logic programs. The expressiveness of the possibilistic nested logic programs is illustrated by scenarios from the medical domain. In particular, we exemplify how possibilistic nested logic programs are expressive enough for capturing medical guidelines which are pervaded of vagueness and qualitative information.
  • Answer Set Programming
  • Uncertain Information
  • Possibilistic Reasoning


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail