• Home
  • Search
  • An extensible autonomous search framework for constraint programming
  • Cite Icon15
  • https://doi.org/10.5897/ijps11.530Copy DOI Icon

An extensible autonomous search framework for constraint programming

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Constraint programming is a modern programming paradigm devoted to solve constraint-based problems, in particular combinatorial problems. In this paradigm, the efficiency on the solving process is the key, which generally depends on the selection of suitable search strategies. However, determining a good search strategy is quite difficult, as its effects on the solving process are hard to predict. A novel solution to handle this concern is called autonomous search, which is a special feature allowing an automatic reconfiguration of the solving process when a poor performance is detected. In this paper, we present an extensible architecture for performing autonomous search in a constraint programming context. The idea is to carry out an “on the fly” replacement of bad-performing strategies by more promising ones. We report encouraging results where the use of autonomous search in the resolution outperforms the use of individual strategies. Key words: Constraint programming, autonomous search, heuristic search.

Similar Papers
  • Conference Article

Evaluating the efficient of using choice functions to solve CSPs via Autonomous Search

  • Jun 01, 2016
  • Ricardo Soto +3
  • Book Chapter
  • Citations2

Autonomous Search in Constraint Satisfaction via Black Hole: A Performance Evaluation Using Different Choice Functions

  • Jan 01, 2016
  • Ricardo Soto +4
  • Research Article
  • Citations3

Multi-objective evolutionary search strategies in constraint programming

  • Dec 24, 2020
  • Operations Research Perspectives
  • Robert Bennetto +1
  • Single Book
  • Citations1457

Handbook of Constraint Programming

  • Jan 01, 2006
  • Francesca Rossi +2
  • Book Chapter
  • Citations27

A Hyperheuristic Approach for Dynamic Enumeration Strategy Selection in Constraint Satisfaction

  • Jan 01, 2011
  • Broderick Crawford +3
  • Research Article
  • Citations10

Multi-variable distributed backtracking with sessions

  • Jul 09, 2014
  • Applied Intelligence
  • René Mandiau +3
  • Research Article
  • Citations3

A learning Portfolio solver for optimizing the performance of constraint programming problems on multi‐core computing systems

  • Apr 27, 2016
  • Concurrency and Computation: Practice and Experience
  • Tarek Menouer +2
  • Research Article

Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems

  • Sep 01, 2021
  • Proceedings of the International Symposium on Combinatorial Search
  • Hong Xu +3
  • Conference Article
  • Citations18

A new CSP graph-based representation for Ant Colony Optimization

  • Jun 01, 2013
  • Antonio Gonzalez-Pardo +1
  • Conference Article
  • Citations8

Abstract Domains for Constraint Programming, with the Example of Octagons

  • Sep 01, 2010
  • C Truchet +2
  • Book Chapter

Chapter 7 - Exploitation of problem-specific features

  • Jan 01, 1993
  • Foundations of Constraint Satisfaction
  • Edward Tsang
  • Book Chapter
  • Citations6

A High Level Language for Solver Independent Model Manipulation and Generation of Hybrid Solvers

  • Jan 01, 2012
  • Daniel Fontaine +1
  • Book Chapter
  • Citations1

CP-Bench: Evaluating Large Language Models for Constraint Modelling

  • Oct 21, 2025
  • Frontiers in artificial intelligence and applications
  • Kostis Michailidis +2
  • Research Article
  • Citations11

Constraint Programming and Local Search Heuristic: a Matheuristic Approach for Routing and Scheduling Feeder Vessels in Multi-terminal Ports

  • Oct 30, 2020
  • SN Operations Research Forum
  • David Sacramento +2
  • Conference Article

A new algorithm for solving the quasi group completion problem

  • Sep 01, 2011
  • M Srikumar
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.