Using Meta-Interpretation in Answer Set Programming to Handle Preferences

Title: Using Meta-Interpretation in Answer Set Programming to Handle Preferences

Research Question: How can we use meta-interpretation in Answer Set Programming (ASP) to handle preferences between rules?

Methodology: The researchers proposed a method to implement preference handling approaches in ASP using meta-interpretation. They considered three preferred answer set approaches: by Brewka and Eiter, by Delgrande, Schaub, and Tompits, and by Wang, Zhou, and Lin. They used DLV, an efficient engine for ASP, to create meta-interpreters for these semantics. They also presented a meta-interpreter for the weakly preferred answer set approach by Brewka and Eiter, which uses the weak constraint feature of DLV. Additionally, they considered advanced meta-interpreters that use graph-based characterizations for more efficient computations.

Results: The researchers presented suitable meta-interpreters for the preferred answer set approaches using DLV. They showed that ASP and DLV can be used for fast prototyping, allowing for experimentation with new languages and knowledge representation formalisms.

Implications: This research has implications for the field of knowledge representation and reasoning. By using meta-interpretation in ASP, researchers can quickly implement and evaluate different preference semantics. This can lead to a better understanding of how these semantics behave and which one is most suitable for a given problem. Furthermore, the use of ASP and DLV allows for efficient computations, making it possible to handle larger and more complex problems.

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