摘要 : Substitutability and interchangeability in constraint satisfaction problems (CSPs) have been used as a basis for search heuristics, solution adaptation and abstraction techniques. In this paper, we consider how the same concepts c... 展开
作者 | S. Bistarelli B. Faltings N. Neagu |
---|---|
作者单位 | |
期刊名称 | 《Annals of Mathematics and Artificial Intelligence》 |
页码/总页数 | 123-163 / 41 |
语种/中图分类号 | 英语 / TP3 |
关键词 | Constraint satisfaction Soft constraints Constraint optimization Interchangeability |
DOI | 10.1007/s10472-013-9348-8 |
馆藏号 | TP-216 |