We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Boundary representation models reconstructed from 3D range data suffer from various inaccuracies caused by noise in the data and the model building software. Such models can be im...
Frank C. Langbein, A. David Marshall, Ralph R. Mar...
In this paper, we describe an approach for automatically generating configurations for complex applications. Automated generation of system co nfigurations is required to allow lar...
Tim Hinrichs, Nathaniel Love, Charles J. Petrie, L...
Many decision problems can be modelled as adversarial constraint satisfaction, which allows us to integrate methods from AI game playing. In particular, by using the idea of oppone...