Abstract
A Conditional Preferences network (CP-net) is a known graphical model for representing qualitative preferences. In many real world applications we are often required to manage both constraints and preferences in an efficient way. The goal here is to select one or more scenarios that are feasible according to the constraints while maximizing a given utility function. This problem has been modelled as a CP-net where some variables share a set of constraints. This latter framework is called a Constrained CP-net. Solving the constrained CP-net has been proposed in the past using a variant of the branch and bound algorithm called Search CP. In this paper, we experimentally study the effect of variable ordering heuristics and constraint propagation when solving a constrained CP-net using a backtrack search algorithm. More precisely, we investigate several look ahead strategies as well as the most constrained heuristic for variable ordering during search. The results of the experiments conducted on random Constrained CP-net instances generated through the RB model, clearly show a significant improvement when adopting these techniques for specific graph structures as well as the case where a large number of variables are sharing constraints.











Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Abbasian R, Mouhoub M (2011) An efficient hierarchical parallel genetic algorithm for graph coloring problem. In: GECCO, pp 521–528
Alanazi E, Mouhoub M (2012) Managing qualitative preferences with constraints. In: ICONIP (3), pp 653–662
Boutilier C, Brafman RI, Domshlak C, Hoos HH, Poole D (2004) Cp-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J Artif Intell Res (JAIR) 21:135–191
Boutilier C, Brafman RI, Hoos HH, Poole D (2001) Preference-based constrained optimization with cp-nets. Comput Intell 20:137–157
Dechter R (2003) Constraint processing. Elsevier Morgan Kaufmann
Domshlak C (2002) On recursively directed hypercubes. Electr J Comb 9(1)
Domshlak C, Rossi F, Venable KB, Walsh T (2009) Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques. CoRR arXiv:0905.3766
Boerkoel Jr JC, Durfee EH, Purrington K (2010) Generalized solution techniques for preference-based constrained optimization with cp-nets. In: AAMAS, pp 291–298
Lang J, Mengin J (2009) The complexity of learning separable ceteris paribus preferences. In: IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009. http://ijcai.org/papers09/Papers/IJCAI09-145.pdf, pp 848–853
Mackworth AK (1977) Consistency in networks of relations. Artif Intell 8(1):99–118
Mouhoub M, Jashmi BJ (2011) Heuristic techniques for variable and value ordering in csps. In: GECCO, pp 457–464
Prestwich SD, Rossi F, Venable KB, Walsh T (2005) Constraint-based preferential optimization. In: AAAI, pp 461–466
Xu K, Li W (2000) Exact phase transitions in random constraint satisfaction problems. J Artif Intell Res 12:93–103
Acknowledgments
We thank the anonymous reviewers for their helpful comments over the submitted manuscript. We specially thank the reviewer who suggested the experiment to find more than one Pareto. Eisa Alanazi is supported by Ministry of Education, Saudi Arabia.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Alanazi, E., Mouhoub, M. Variable ordering and constraint propagation for constrained CP-nets. Appl Intell 44, 437–448 (2016). https://doi.org/10.1007/s10489-015-0708-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-015-0708-4