Hybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in computer science and artificial intelligence: it provides a common framework for many theoretical problems as well as for many real-life applications. Soft constraint problems are a generalisation of the CSP which allow the us...
Autors principals: | , |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
2010
|