Aggregates in answer set optimization

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Answer set optimization (ASO) is a flexible framework for qualitative optimization in answer set programming (ASP). The approach uses a generating program to construct the space of problem solutions, and a preference program to assess the quality of solutions. In this short paper we generalize the approach by introducing aggregates in preference programs. This allows the user to express preferences which are based on minimization or maximization of some numerical criteria. We introduce the new language of preference programs, define its semantics and give an example illustrating its use. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Saad, E., & Brewka, G. (2011). Aggregates in answer set optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6645 LNAI, pp. 211–216). https://doi.org/10.1007/978-3-642-20895-9_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free