Basic Techniques for Creating an Efficient CSP Solver
Many computationally difficult problems from areas like planning and scheduling are easily modelled as constraint satisfaction problems (CSP). In order to have an uniform practical approach of these, a new programming paradigm emerged in the form of constraint programming, providing the opportunity...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Alexandru Ioan Cuza University of Iasi
2007-12-01
|
| Series: | Scientific Annals of Computer Science |
| Online Access: | http://www.info.uaic.ro/bin/download/Annals/XVII/XVII_3.pdf |