CNF Encodings
CNF Encodings
复制标题
DOI：
10.3233/978-1-58603-929-5-75
复制
发表时间：
2021-02
期刊：
影响因子：
--
通讯作者：
S. Prestwich
中科院分区：
文献类型：
--
作者：
S. Prestwich
在组合问题可以通过当前的SAT方法解决之前，它通常必须以合取范式编码，这便于算法实现并允许问题的公共文件格式。不幸的是，大多数问题都有几种编码方式，并且很少有指导如何在其中进行选择，然而编码的选择与搜索算法的选择一样重要。本章回顾了关于编码方法的理论和实证工作，包括Tseitin编码的使用，外延和内涵约束的编码，编码和搜索算法之间的相互作用，以及一些常见的错误来源。案例研究用于说明。
Before a combinatorial problem can be solved by current SAT methods, it must usually be encoded in conjunctive normal form, which facilitates algorithm implementation and allows a common file format for problems. Unfortunately there are several ways of encoding most problems and few guidelines on how to choose among them, yet the choice of encoding can be as important as the choice of search algorithm. This chapter reviews theoretical and empirical work on encoding methods, including the use of Tseitin encodings, the encoding of extensional and intensional constraints, the interaction between encodings and search algorithms, and some common sources of error. Case studies are used for illustration.