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 |
| id |
doaj-cc6558048fb848dba6c1c02071553a61 |
|---|---|
| record_format |
Article |
| spelling |
doaj-cc6558048fb848dba6c1c02071553a612020-11-25T01:52:46ZengAlexandru Ioan Cuza University of IasiScientific Annals of Computer Science1843-81212248-26952007-12-01XVII83112Basic Techniques for Creating an Efficient CSP SolverC. FrăsinaruMany 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 of having declarative descriptions of CSP instances and also obtaining their solutions in reasonable computational time. This paper presents from both theoretical and practical points of view the design of a general purpose CSP solver. The solver we have created is called OmniCS (Omni Constraint Solver) and is freely available at http://omnics.sourceforge.nethttp://www.info.uaic.ro/bin/download/Annals/XVII/XVII_3.pdf |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
C. Frăsinaru |
| spellingShingle |
C. Frăsinaru Basic Techniques for Creating an Efficient CSP Solver Scientific Annals of Computer Science |
| author_facet |
C. Frăsinaru |
| author_sort |
C. Frăsinaru |
| title |
Basic Techniques for Creating an Efficient CSP Solver |
| title_short |
Basic Techniques for Creating an Efficient CSP Solver |
| title_full |
Basic Techniques for Creating an Efficient CSP Solver |
| title_fullStr |
Basic Techniques for Creating an Efficient CSP Solver |
| title_full_unstemmed |
Basic Techniques for Creating an Efficient CSP Solver |
| title_sort |
basic techniques for creating an efficient csp solver |
| publisher |
Alexandru Ioan Cuza University of Iasi |
| series |
Scientific Annals of Computer Science |
| issn |
1843-8121 2248-2695 |
| publishDate |
2007-12-01 |
| description |
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 of having declarative descriptions of CSP instances and also obtaining their solutions in reasonable computational time.
This paper presents from both theoretical and practical points of view the design of a general purpose CSP solver. The solver we have created is called OmniCS (Omni Constraint Solver) and is freely available at http://omnics.sourceforge.net |
| url |
http://www.info.uaic.ro/bin/download/Annals/XVII/XVII_3.pdf |
| work_keys_str_mv |
AT cfrasinaru basictechniquesforcreatinganefficientcspsolver |
| _version_ |
1724993146641711104 |