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...
| Main Authors: | , |
|---|---|
| 格式: | Journal article |
| 語言: | English |
| 出版: |
2010
|