.png){kind=icon}
返回
Compiling constraint satisfaction problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0004-3702(99)00077-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many tasks requiring intelligence, in particular scheduling and planning, must be solved under time constraints. This is difficult to achieve because of the combinatorial nature of such tasks. While search heuristics can give good average performance, they cannot give any performance guarantees for a particular instance. Fortunately, the tasks are often very similar. Therefore, compiling partial solutions is one way in which better performance guarantees for on-line problem solving could be achieved. We consider constraint satisfaction as a general paradigm and describe compilation techniques. General tasks are defined by incomplete CSPs from which instances are generated by adding more constraints. For any such general task, compilation builds a structure which represents all its solutions. in order to represent the space in a compact form, it exploits clustering and interchangeability techniques. Search for solutions can then be Limited to a usually much smaller, precomputed space. When search criteria involve only single variables, solutions can be guaranteed to be found in linear time in the size of the compiled structure. (C) 1999 Elsevier Science B.V. All rights reserved.
Keyword:
constraint-based reasoning
compilation
interchangeability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容