Document Open Access Logo

Learning Max-CSPs via Active Constraint Acquisition

Authors Dimosthenis C. Tsouros, Kostas Stergiou

PDF
Thumbnail PDF

File

LIPIcs.CP.2021.54.pdf
  • Filesize: 0.57 MB
  • 18 pages

Document Identifiers

Author Details

Dimosthenis C. Tsouros
  • Dept. of Electrical & Computer Engineering, University of Western Macedonia, Kozani, Greece
Kostas Stergiou
  • Dept. of Electrical & Computer Engineering, University of Western Macedonia, Kozani, Greece

Cite As Get BibTex

Dimosthenis C. Tsouros and Kostas Stergiou. Learning Max-CSPs via Active Constraint Acquisition. In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 210, pp. 54:1-54:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021) https://doi.org/10.4230/LIPIcs.CP.2021.54

Abstract

Constraint acquisition can assist non-expert users to model their problems as constraint networks. In active constraint acquisition, this is achieved through an interaction between the learner, who posts examples, and the user who classifies them as solutions or not. Although there has been recent progress in active constraint acquisition, the focus has only been on learning satisfaction problems with hard constraints. In this paper, we deal with the problem of learning soft constraints in optimization problems via active constraint acquisition, specifically in the context of the Max-CSP. Towards this, we first introduce a new type of queries in the context of constraint acquisition, namely partial preference queries, and then we present a novel algorithm for learning soft constraints in Max-CSPs, using such queries. We also give some experimental results.

Subject Classification

ACM Subject Classification
  • Theory of computation → Constraint and logic programming
Keywords
  • Constraint acquisition
  • modeling
  • learning

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Dana Angluin. Queries and concept learning. Machine learning, 2(4):319-342, 1988. Google Scholar
  2. Nicolas Beldiceanu and Helmut Simonis. A model seeker: Extracting global constraint models from positive examples. In International Conference on Principles and Practice of Constraint Programming, pages 141-157. Springer, 2012. Google Scholar
  3. Christian Bessiere, Remi Coletta, Eugene C Freuder, and Barry O’Sullivan. Leveraging the learning power of examples in automated constraint acquisition. In International Conference on Principles and Practice of Constraint Programming, pages 123-137. Springer, 2004. Google Scholar
  4. Christian Bessiere, Remi Coletta, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Toby Walsh, et al. Constraint acquisition via partial queries. In International Joint Conference on Artificial Intelligence (IJCAI), volume 13, pages 475-481, 2013. Google Scholar
  5. Christian Bessiere, Remi Coletta, Frédéric Koriche, and Barry O’Sullivan. A sat-based version space algorithm for acquiring constraint satisfaction problems. In European Conference on Machine Learning, pages 23-34. Springer, 2005. Google Scholar
  6. Christian Bessiere, Remi Coletta, Barry O'Sullivan, Mathias Paulin, et al. Query-driven constraint acquisition. In International Joint Conference on Artificial Intelligence (IJCAI), volume 7, pages 50-55, 2007. Google Scholar
  7. Christian Bessiere, Abderrazak Daoudi, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Younes Mechqrane, Nina Narodytska, Claude-Guy Quimper, and Toby Walsh. New approaches to constraint acquisition. In Data mining and constraint programming, pages 51-76. Springer, 2016. Google Scholar
  8. Christian Bessiere, Frédéric Koriche, Nadjib Lazaar, and Barry O'Sullivan. Constraint acquisition. Artificial Intelligence, 244:315-342, 2017. Google Scholar
  9. Alessandro Biso, Francesca Rossi, and Alessandro Sperduti. Experimental results on learning soft constraints. KR, 2:435-444, 2000. Google Scholar
  10. Craig Boutilier, Relu Patrascu, Pascal Poupart, and Dale Schuurmans. Regret-based utility elicitation in constraint-based decision problems. In IJCAI, volume 9, pages 929-934, 2005. Google Scholar
  11. Craig Boutilier, Relu Patrascu, Pascal Poupart, and Dale Schuurmans. Constraint-based optimization and utility elicitation using the minimax decision criterion. Artificial Intelligence, 170(8-9):686-713, 2006. Google Scholar
  12. Céline Brouard, Simon de Givry, and Thomas Schiex. Pushing data into cp models using graphical model learning and solving. In International Conference on Principles and Practice of Constraint Programming, pages 811-827. Springer, 2020. Google Scholar
  13. Bertrand Cabon, Simon De Givry, Lionel Lobjois, Thomas Schiex, and Joost P. Warners. Radio link frequency assignment. Constraints, 4(1):79-89, 1999. Google Scholar
  14. Paolo Campigotto, Andrea Passerini, and Roberto Battiti. Active learning of combinatorial features for interactive optimization. In International Conference on Learning and Intelligent Optimization, pages 336-350. Springer, 2011. Google Scholar
  15. Li Chen and Pearl Pu. Survey of preference elicitation methods. Technical report, EPFL, 2004. Google Scholar
  16. Vincent Conitzer. Eliciting single-peaked preferences using comparison queries. Journal of Artificial Intelligence Research, 35:161-191, 2009. Google Scholar
  17. Luc De Raedt, Anton Dries, Tias Guns, and Christian Bessiere. Learning constraint satisfaction problems: An ilp perspective. In Data Mining and Constraint Programming, pages 96-112. Springer, 2016. Google Scholar
  18. Luc De Raedt, Andrea Passerini, and Stefano Teso. Learning constraints from examples. In Proceedings in Thirty-Second AAAI Conference on Artificial Intelligence, 2018. Google Scholar
  19. Carmel Domshlak, Eyke Hüllermeier, Souhila Kaci, and Henri Prade. Preferences in ai: An overview, 2011. Google Scholar
  20. Paolo Dragone, Stefano Teso, and Andrea Passerini. Constructive preference elicitation. Frontiers in Robotics and AI, 4:71, 2018. Google Scholar
  21. Eugene C Freuder. Modeling: the final frontier. In The First International Conference on The Practical Application of Constraint Technologies and Logic Programming (PACLP), London, pages 15-21, 1999. Google Scholar
  22. Eugene C Freuder. Progress towards the holy grail. Constraints, 23(2):158-171, 2018. Google Scholar
  23. Eugene C Freuder and Barry O’Sullivan. Grand challenges for constraint programming. Constraints, 19(2):150-162, 2014. Google Scholar
  24. Eugene C Freuder and Richard J Wallace. Suggestion strategies for constraint-based matchmaker agents. In International Conference on Principles and Practice of Constraint Programming, pages 192-204. Springer, 1998. Google Scholar
  25. Mirco Gelain, Maria Silvia Pini, Francesca Rossi, K Brent Venable, and Toby Walsh. Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies. Artificial Intelligence, 174(3-4):270-294, 2010. Google Scholar
  26. Shengbo Guo and Scott Sanner. Real-time multiattribute bayesian preference elicitation with pairwise comparison queries. In Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, pages 289-296, 2010. Google Scholar
  27. Samuel M Kolb. Learning constraints and optimization criteria. In Workshops at the Thirtieth AAAI Conference on Artificial Intelligence, 2016. Google Scholar
  28. Mohit Kumar, Samuel Kolb, Stefano Teso, and Luc De Raedt. Learning max-sat from contextual examples for combinatorial optimisation. In AAAI, pages 4493-4500, 2020. Google Scholar
  29. Arnaud Lallouet, Matthieu Lopez, Lionel Martin, and Christel Vrain. On learning constraint problems. In 22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI), volume 1, pages 45-52. IEEE, 2010. Google Scholar
  30. Tom Michael Mitchell. Version spaces: an approach to concept learning. Technical report, Stanford Univ Calif Dept of Computer Science, 1978. Google Scholar
  31. Barry O'Sullivan. Automated modelling and solving in constraint programming. In AAAI Conference on Artificial Intelligence, pages 1493-1497, 2010. Google Scholar
  32. Steven D Prestwich. Robust constraint acquisition by sequential analysis. Frontiers in Artificial Intelligence and Applications, 325:355-362, 2020. Google Scholar
  33. Jean-Francois Puget. Constraint programming next challenge: Simplicity of use. In International Conference on Principles and Practice of Constraint Programming, pages 5-8. Springer, 2004. Google Scholar
  34. Francesca Rossi and Alessandro Sperduti. Learning solution preferences in constraint problems. Journal of Experimental & Theoretical Artificial Intelligence, 10(1):103-116, 1998. Google Scholar
  35. Francesca Rossi and Allesandro Sperduti. Acquiring both constraint and solution preferences in interactive constraint systems. Constraints, 9(4):311-332, 2004. Google Scholar
  36. Francesca Rossi, Kristen Brent Venable, and Toby Walsh. Preferences in constraint satisfaction and optimization. AI magazine, 29(4):58-58, 2008. Google Scholar
  37. Kostyantyn Shchekotykhin and Gerhard Friedrich. Argumentation based constraint acquisition. In Ninth IEEE International Conference on Data Mining, pages 476-482. IEEE, 2009. Google Scholar
  38. Atena M Tabakhi. Preference elicitation in dcops for scheduling devices in smart buildings. In Thirty-First AAAI Conference on Artificial Intelligence, 2017. Google Scholar
  39. Atena M Tabakhi, Tiep Le, Ferdinando Fioretto, and William Yeoh. Preference elicitation for dcops. In International Conference on Principles and Practice of Constraint Programming, pages 278-296. Springer, 2017. Google Scholar
  40. Dimosthenis C Tsouros and Kostas Stergiou. Efficient multiple constraint acquisition. Constraints, 25(3):180-225, 2020. Google Scholar
  41. Dimosthenis C Tsouros, Kostas Stergiou, and Christian Bessiere. Structure-driven multiple constraint acquisition. In International Conference on Principles and Practice of Constraint Programming, pages 709-725. Springer, 2019. Google Scholar
  42. Dimosthenis C. Tsouros, Kostas Stergiou, and Panagiotis G. Sarigiannidis. Efficient methods for constraint acquisition. In 24th International Conference on Principles and Practice of Constraint Programming, 2018. Google Scholar
  43. Paolo Viappiani. Preference modeling and preference elicitation: An overview. In DMRS, pages 19-24, 2014. Google Scholar
  44. Paolo Viappiani and Christian Kroer. Robust optimization of recommendation sets with the maximin utility criterion. In International Conference on Algorithmic DecisionTheory, pages 411-424. Springer, 2013. Google Scholar
  45. Xuan-Ha Vu and Barry O'Sullivan. Semiring-based constraint acquisition. In 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), volume 1, pages 251-258. IEEE, 2007. Google Scholar
  46. Xuan-Ha Vu and Barry O’Sullivan. Generalized constraint acquisition. In International Symposium on Abstraction, Reformulation, and Approximation, pages 411-412. Springer, 2007. Google Scholar
  47. Xuan-Ha Vu and Barry O’Sullivan. A unifying framework for generalized constraint acquisition. International Journal on Artificial Intelligence Tools, 17(05):803-833, 2008. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact