Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming

Details Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming

2002-01-16

arxiv.org/abs/cs/0201013v1

Theory and Practice of Logic Programming 3(4/5):463-498, 2003

Computer Science

Logic in Computer Science

34 pages, appeared as a Technical Report at KBS of the Vienna University of Technology, see http://www.kr.tuwien.ac.at/researc

Scientific paper

10.1017/S1471068403001753

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.

Affiliated with

Also associated with

No associations

Rating

Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Preferred Answer Sets by Meta-Interpretation in Answer Set Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484430