.png){kind=icon}
返回
Planning as satisfiability: Heuristics
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2012.08.001.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Reduction to SAT is a very successful approach to solving hard combinatorial problems in Artificial Intelligence and computer science in general. Most commonly, problem instances reduced to SAT are solved with a general-purpose SAT solver. Although there is the obvious possibility of improving the SAT solving process with application-specific heuristics, this has rarely been done successfully. In this work we propose a planning-specific variable selection strategy for SAT solving. The strategy is based on generic principles about properties of plans, and its performance with standard planning benchmarks often substantially improves on generic variable selection heuristics, such as VSIDS, and often lifts it to the same level with other search methods such as explicit state-space search with heuristic search algorithms. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Planning
SAT
Heuristics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
A STUDY OF SPONTANEOUS MUTATION RATES AT TEN LOCI DETECTABLE BY STARCH GEL ELECTROPHORESIS IN DROSOPHILA MELANOGASTER.png)
Genetics
OAAI
GeneticsIF0
OAAI分享收藏分享收藏分享收藏
查看更多内容