Computing preferred answer sets by meta-interpretation in Answer Set Programming

  • Authors:

  • Thomas Eiter;Wolfgang Faber;Nicola Leone;Gerald Pfeifer

  • Affiliations:

  • Institut für Informationssysteme 184/3, TU Wien Favoritenstr. 9-11, 1040 Wien, Austria (e-mail: eiter@kr.tuwien.ac.at);Institut für Informationssysteme 184/3, TU Wien Favoritenstr. 9-11, 1040 Wien, Austria (e-mail: faber@kr.tuwien.ac.at);Department of Mathematics, University of Calabria 87030 Rende (CS), Italy (e-mail: leone@unical.it);Institut für Informationssysteme 184/2, TU Wien Favoritenstr. 9-11, 1040 Wien, Austria (e-mail: pfeifer@dbai.tuwien.ac.at)

  • Venue:
  • Theory and Practice of Logic Programming
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Most recently, Answer Set Programming (ASP) has been attracting interest as a new paradigm for problem solving. An important aspect, for which several approaches have been presented, is the handling of preferences between rules. 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.