Aggregates in answer set optimization

Authors:
Emad Saad;Gerhard Brewka
Affiliations:
Gulf University for Science and Technology, Mishref, Kuwait;University of Leipzig, Augustusplatz, Leipzig
Venue:
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Year:
2011

Citing 7
Cited 1

Prioritized logic programming and its application to commonsense reasoning

Artificial Intelligence
Logic programming with ordered disjunction

Eighteenth national conference on Artificial intelligence
Well-founded and stable semantics of logic programs with aggregates

Theory and Practice of Logic Programming
Answer set optimization

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A comparative study of logic programs with preference

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Semantics and complexity of recursive aggregates in answer set programming

Artificial Intelligence
LPOD answer sets and nash equilibria

ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday

Algorithms for solving satisfiability problems with qualitative preferences

Correct Reasoning

Quantified Score

Hi-index	0.00

Visualization

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.