Translating LPOD and CR-Prolog2 into Standard Answer Set Programs

TL;DR

This paper presents methods to translate LPOD and CR-Prolog2, extensions of answer set programming that handle preferences and consistency restoring rules, into standard ASP, facilitating better understanding and implementation.

Contribution

It provides systematic reductions of LPOD and CR-Prolog2 into standard ASP, enabling their features to be understood within the traditional ASP framework.

Findings

Reductions enable interpretation of LPOD and CR-Prolog2 in standard ASP

Facilitates implementation and understanding of preference handling in ASP

Bridges the gap between extended and standard answer set programming

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-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.