Managing Qualitative Preferences and Constraints in a Dynamic Environment
Abstract
The problem of finding the set of pareto optimals for constraints and qualitative preferences together is of great interest to many application areas. It can be viewed as a preference constrained optimization problem where the goal is to find one or more feasible solutions that are not dominated by other feasible outcomes. Our work aims to enhance the current literature of the problem by providing solving methods targeting the problem in a dynamic environments. We target the problem with an eye on adopting and benefiting from the current constraint satisfaction techniques.
Cite
Text
Alanazi and Mouhoub. "Managing Qualitative Preferences and Constraints in a Dynamic Environment." International Joint Conference on Artificial Intelligence, 2013.Markdown
[Alanazi and Mouhoub. "Managing Qualitative Preferences and Constraints in a Dynamic Environment." International Joint Conference on Artificial Intelligence, 2013.](https://mlanthology.org/ijcai/2013/alanazi2013ijcai-managing/)BibTeX
@inproceedings{alanazi2013ijcai-managing,
title = {{Managing Qualitative Preferences and Constraints in a Dynamic Environment}},
author = {Alanazi, Eisa and Mouhoub, Malek},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2013},
pages = {3203-3204},
url = {https://mlanthology.org/ijcai/2013/alanazi2013ijcai-managing/}
}