A Framework for Compiling Preferences in Logic Programs

Title: A Framework for Compiling Preferences in Logic Programs

Abstract: This research proposes a methodology and framework for expressing general preference information in logic programming under the answer set semantics. The authors introduce an ordered logic program, an extended logic program that includes named rules and preferences specified by a set of atoms. They develop a specific approach to reasoning with preferences, where the preference ordering specifies the order in which rules are applied. The framework is demonstrated to have wide applicability by showing how other approaches can be captured within it. The result of each transformation is an extended logic program, allowing the use of existing implementations like dlv and smodels. A publicly available compiler is provided as a front-end for these systems.

Main Research Question: How can we develop a framework for expressing and reasoning with preferences in logic programming that is more efficient and flexible than existing approaches?

Methodology: The authors propose an ordered logic program, which is an extended logic program with named rules and preferences specified by a set of atoms. The preferences are dynamic and can appear arbitrarily within the program. They develop a specific approach to reasoning with preferences, where the preference ordering specifies the order in which rules are applied.

Results: The research shows that the proposed framework has wide applicability, as it can capture other existing approaches. The result of each transformation is an extended logic program, allowing the use of existing implementations. A publicly available compiler is provided as a front-end for these systems.

Implications: The research suggests that the proposed framework provides a more efficient and flexible approach to expressing and reasoning with preferences in logic programming. It allows for the use of existing implementations and provides a more intuitive way to specify preferences.

Link to Article: https://arxiv.org/abs/0203005v1 Authors: arXiv ID: 0203005v1