Abstract
We introduce a flexible framework to specify problem solutions (outcomes) and preferences among them. The proposal combines ideas from answer-set programming (ASP), answer-set optimization (ASO) and CP-nets. The problem domain is structured into components. ASP techniques are used to specify values of components, as well as global (inter-component) constraints among these values. ASO methods are used to describe preferences among the values of a component and CP-net techniques to represent inter-component dependencies and corresponding preferences.
Original language | English |
---|---|
Pages | 596-601 |
Number of pages | 6 |
State | Published - 2005 |
Event | 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05 - Pittsburgh, PA, United States Duration: Jul 9 2005 → Jul 13 2005 |
Conference
Conference | 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05 |
---|---|
Country/Territory | United States |
City | Pittsburgh, PA |
Period | 7/9/05 → 7/13/05 |
ASJC Scopus subject areas
- Software
- Artificial Intelligence