A Compact and Efficient SAT-Encoding of Finite Domain CSP

DOI Web Site 被引用文献2件 参考文献2件

説明

A (finite) Constraint Satisfaction Problem (CSP) is a combinatorial problem to find an assignment which satisfies all given constraints over finite domains. A SAT-based CSP solver is a program which solves a CSP by encoding it to SAT and searching solutions by SAT solvers. Remarkable improvements in the efficiency of SAT solvers make SAT-based CSP solvers applicable for solving hard and practical problems. A number of SAT encoding methods have been therefore proposed: direct encoding, support encoding, log encoding, log-support encoding, and order encoding.

収録刊行物

被引用文献 (2)*注記

もっと見る

参考文献 (2)*注記

もっと見る

関連プロジェクト

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ