In Constraint Satisfaction Problems (CSPs) values belonging to variable domains should be completely known before the constraint propagation process starts. In many applications, however, the acquisition of domain values is a computational expensive process or some domain values could not be available at the beginning of the computation. For this purpose, we introduce an Interactive Constraint Satisfaction Problem (ICSP) model as extension of the widely used CSP model. The variable domain values can be acquired when needed during the resolution process by means of Interactive Constraints, which retrieve (possibly consistent) information. Experimental results on randomly generated CSPs and for 3D object recognition show the effectiveness of ...
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex...
We introduce a new method, called constraint-directed-generate-and-test (CDGT), for solving constrai...
We propose CABSC, a system that performs Constraint Acquisition Based on Solution Counting. In order...
In Constraint Satisfaction Problems (CSPs) values belonging to variable domains should be completely...
Constraint Satisfaction Problems (CSPs)(17)) are an effective framework for modeling a variety of re...
This paper addresses the 3D object recognition problem modelled as a Constraint Satisfaction Problem...
Constraint satisfaction is a fundamental artificial intelligence technique offering a simple yet pow...
. Real constrained problems often demand specific answers to meet requirements like bounded computat...
Constraint programming techniques are widely used to model and solve interactive decision problems, ...
The Constraint Satisfaction Problem (CSP) is a good framework for dealing with combinatorial proble...
The Constraint Satisfaction Problem (CSP) is ubiquitous in artificial intelligence. It has a wide ap...
Abstract. Complete algorithms for constraint solving typically exploit properties like (in)consisten...
Constraint satisfaction is a powerful approach to solving a wide class of problems. However, as many...
International audienceConstraint satisfaction problems or CSP are very often used to formalize produ...
Complete algorithms for constraint solving typically exploit properties like (in)consistency or inte...
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex...
We introduce a new method, called constraint-directed-generate-and-test (CDGT), for solving constrai...
We propose CABSC, a system that performs Constraint Acquisition Based on Solution Counting. In order...
In Constraint Satisfaction Problems (CSPs) values belonging to variable domains should be completely...
Constraint Satisfaction Problems (CSPs)(17)) are an effective framework for modeling a variety of re...
This paper addresses the 3D object recognition problem modelled as a Constraint Satisfaction Problem...
Constraint satisfaction is a fundamental artificial intelligence technique offering a simple yet pow...
. Real constrained problems often demand specific answers to meet requirements like bounded computat...
Constraint programming techniques are widely used to model and solve interactive decision problems, ...
The Constraint Satisfaction Problem (CSP) is a good framework for dealing with combinatorial proble...
The Constraint Satisfaction Problem (CSP) is ubiquitous in artificial intelligence. It has a wide ap...
Abstract. Complete algorithms for constraint solving typically exploit properties like (in)consisten...
Constraint satisfaction is a powerful approach to solving a wide class of problems. However, as many...
International audienceConstraint satisfaction problems or CSP are very often used to formalize produ...
Complete algorithms for constraint solving typically exploit properties like (in)consistency or inte...
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex...
We introduce a new method, called constraint-directed-generate-and-test (CDGT), for solving constrai...
We propose CABSC, a system that performs Constraint Acquisition Based on Solution Counting. In order...