Representing Logic Programs with Ordered Disjunction Using asprin

Logic Programs with Ordered Disjunction (LPOD) is an extension of standard answer set programs to handle preference using the high-level construct of ordered disjunction whereas asprin is a recently proposed, general, flexible, and extensible framework that provides low-level constructs for representing preference in answer set programming. We present an encoding of LPOD in the language of asprin and the implementation of LPOD called LPOD 2 ASPRIN based on the encoding. Unlike the known method that applies only to a fragment of LPOD, our translation is general, direct, and simpler. It also leads to more efficient computation of LPOD using asprin.

Authors

• Joohyung Lee
• Zhun Yang

Keywords

No keywords are indexed for this paper.