Implementing Preferences with asprin

Loading...
Thumbnail Image
File version

Accepted Manuscript (AM)

Author(s)
Brewka, Gerhard
Delgrande, James
Romero, Javier
Schaub, Torsten
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2015
Size
File type(s)
Location
License
Abstract

asprin offers a framework for expressing and evaluating combinations of quantitative and qualitative preferences among the stable models of a logic program. In this paper, we demonstrate the generality and flexibility of the methodology by showing how easily existing preference relations can be implemented in asprin. Moreover, we show how the computation of optimal stable models can be improved by using declarative heuristics. We empirically evaluate our contributions and contrast them with dedicated implementations. Finally, we detail key aspects of asprin’s implementation.

Journal Title

Lecture Notes in Computer Science

Conference Title
Book Title
Edition
Volume

9345

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 2015 Springer International Publishing AG. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.com.

Item Access Status
Note
Access the data
Related item(s)
Subject

Information and Computing Sciences not elsewhere classified

Persistent link to this record
Citation
Collections