Incremental reconstruction of 3D scenes from multiple, complex images
Artificial Intelligence
Concurrent prolog: collected papers
Concurrent prolog: collected papers
Knowledge Structuring and Constraint Satisfaction: The Mapsee Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
Concurrent constraint programming
Concurrent constraint programming
An Experimental Comparison of Range Image Segmentation Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Interactive Constraint-Based System for Selective Attention in Visual Search
ISMIS '97 Proceedings of the 10th International Symposium on Foundations of Intelligent Systems
Planning while Executing: A Constraint-Based Approach
ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Planning and Execution in Dynamic Environments
AI*IA 01 Proceedings of the 7th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
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 the proposed approach.