Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
This demonstration presents the concepts, design, and implementation of SCDE, a relational database systems extended with the ability to solve constraint satisfaction problems (CS...
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...