Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 215-219.
Abstract
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all three kinds of information. We therefore propose a framework, based on both CP-nets and soft constraints, that handles both hard and soft constraints as well as conditional preferences efficiently and uniformly. We study the complexity of testing the consistency of preference statements, and show how soft constraints can faithfully approximate the semantics of conditional preference statements whilst improving the computational complexity.
@inproceedings{ijcai2003p31,
title = {Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques},
author = {Domshlak, Carmel and Rossi, Francesca and Venable, Kristen Brent and Walsh, Toby},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {215--219},
year = {2003},
url = {https://ijcai.org/proceedings/2003/31},
}
TY - CPAPER TI - Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques AU - Domshlak, Carmel AU - Rossi, Francesca AU - Venable, Kristen Brent AU - Walsh, Toby T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 215 EP - 219 UR - https://ijcai.org/proceedings/2003/31 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
