Accepting the natural order of rules in a logic program with preferences

Author Alexander Šimko

Thumbnail PDF


  • Filesize: 259 kB
  • 6 pages

Document Identifiers

Author Details

Alexander Šimko

Cite AsGet BibTex

Alexander Šimko. Accepting the natural order of rules in a logic program with preferences. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 284-289, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


Preference is a natural part of common sense reasoning. It allows us to select preferred conclusions from broader range of alternative conclusions. It is typically specified on parts of conclusions or on rules. Different semantics have been proposed that deal with preference on rules. None fully meets our requirements. We are interested in a descriptive approach to preference handling in logic programs under answer set semantics that always selects preferred answer set when standard one exists. Existing semantics that meet this criterion also give non intuitive conclusions on some programs. We think this kind of problem is related to the problem of not accepting natural order of rules induced by underlying answer set semantics. Our goal is to define semantics that would always select preferred answer set when standard one exists, accept natural order on rules, and satisfy principles for preference handling.
  • non-monotonicreasoning
  • knowledgerepresentation
  • answersetsemantics
  • preference handling
  • preferred answer set


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads