Translating LPOD and CR-Prolog2 into Standard Answer Set Programs

Abstract

Logic Programs with Ordered Disjunction (LPOD) is an extension of standard answer set programs to handle preference using the construct of ordered disjunction, and CR-Prolog 2 is an extension of standard answer set programs with consistency restoring rules and LPOD-like ordered disjunction. We present reductions of each of these languages into the standard ASP language, which gives us an alternative way to understand the extensions in terms of the standard ASP language. (The paper is under consideration for acceptance in TPLP.) ⊥ ← hotel (2), not med ⊥ ← hotel (2), not star3 ⊥ ← hotel(3), not tooF ar ⊥ ← hotel(3), not star4 Π 2 has 4 × 3 split programs but only the following three programs are consistent (The regular part of Π 2 is not listed).close med ← not close star2 ← not star4, not star3 star3 ← not star4 tooF ar ← not close, not med, not f ar star4

Translating LPOD and CR-Prolog2into standard answer set programs

“…Section 3 reviews CR-Prolog 2 and presents a translation that turns CR-Prolog 2 into standard answer set programs. The complete proofs are in the supplementary material at the TPLP archives (Lee and Yang 2018).…”