New approaches to solving constraint satisfaction problems using iterative improvement techniques have been found to be successful on certain, very large problems such as the mill...
Andrew J. Davenport, Edward P. K. Tsang, Chang J. ...
In this paper, we propose a method which can be used to decompose a 2D or 3D constraint problem into a C-tree. With this decomposition, a geometric constraint problem can be reduc...
Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its...
Sabrina Baselice, Piero A. Bonatti, Michael Gelfon...
Recently there has been an upsurge of interest in both, Search– Based Software Testing (SBST), and Dynamic Symbolic Execution (DSE). Each of these two approaches has complementar...
Kiran Lakhotia, Nikolai Tillmann, Mark Harman, Jon...
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...