Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming
<|reference_start|>Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming: Most recently, Answer Set Programming (ASP) is attracting interest as a new paradigm for problem solving. An important aspect which needs to be supported is the handling of preferences between rules, for which several approaches have been presented. In this paper, we consider the problem of implementing preference handling approaches by means of meta-interpreters in Answer Set Programming. In particular, we consider the preferred answer set approaches by Brewka and Eiter, by Delgrande, Schaub and Tompits, and by Wang, Zhou and Lin. We present suitable meta-interpreters for these semantics using DLV, which is an efficient engine for ASP. Moreover, we also present a meta-interpreter for the weakly preferred answer set approach by Brewka and Eiter, which uses the weak constraint feature of DLV as a tool for expressing and solving an underlying optimization problem. We also consider advanced meta-interpreters, which make use of graph-based characterizations and often allow for more efficient computations. Our approach shows the suitability of ASP in general and of DLV in particular for fast prototyping. This can be fruitfully exploited for experimenting with new languages and knowledge-representation formalisms.<|reference_end|>
@article{eiter2002computing,
    title={Computing Preferred Answer Sets by Meta-Interpretation in Answer Set
  Programming},
    author={Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer},
    journal={Theory and Practice of Logic Programming 3(4/5):463-498, 2003},
    year={2002},
    doi={10.1017/S1471068403001753},
    archivePrefix={arXiv},
    eprint={cs/0201013},
    primaryClass={cs.LO cs.AI}
}