Autonomous Search: Towards the Easy Tuning of Constraint Programming Solvers

Broderick Crawford, Ricardo Soto, Rodrigo Olivares, Rodrigo Herrera, Eric Monfroy, Fernando Paredes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


Constraint programming (CP) allows users to solve combinatorial problems by simply launching the corresponding model in a search engine. However, achieving good results may clearly depend on the correct search engine configuration, which demands advanced knowledge from the modeler. Recently, Autonomous Search (AS) appeared as a new technique that enables a given search engine to control and adapt its own configuration based on self-tuning. The goal is to be more efficient without the knowledge of an expert user. In this paper, we illustrate how the integration of AS into CP is carried out, reducing as a consequence the user involvement in solver tuning.

Original languageEnglish
Title of host publicationHCI International 2014 - Posters' Extended Abstracts - International Conference, HCI International 2014, Proceedings
PublisherSpringer Verlag
Number of pages4
ISBN (Print)9783319078564
StatePublished - 2014

Publication series

NameCommunications in Computer and Information Science
Volume434 PART I
ISSN (Print)1865-0929


  • Autonomous Search
  • Constraint Programming
  • Constraint Satisfaction


Dive into the research topics of 'Autonomous Search: Towards the Easy Tuning of Constraint Programming Solvers'. Together they form a unique fingerprint.

Cite this