Translating LPOD and CR-Prolog2 into Standard Answer Set Programs
This work is incremental, addressing a technical translation problem for researchers in logic programming and answer set semantics.
The paper tackled the problem of translating two extensions of answer set programming (LPOD and CR-Prolog2) into standard ASP, providing reductions that offer an alternative understanding of these extensions.
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-Prolog2 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.