人工知能学会論文誌
Online ISSN : 1346-8030
Print ISSN : 1346-0714
速報論文
SAT符号化を用いた釣合い型不完備ブロック計画の構成
松中 春樹丹生 智也番原 睦則田村 直之
著者情報
ジャーナル フリー

2012 年 27 巻 2 号 p. 10-15

詳細
抄録

Propositional Satisfiability (SAT) is fundamental in solving many application problems in Artificial Intelligence and Computer Science. Remarkable improvements in the efficiency of SAT solvers have beenmade over the last decade. Such improvements encourage researchers to solve constraint satisfaction problems by encoding them into SAT (i.e. ``SAT encoding''). Balanced Incomplete Block Design (BIBD) is one of the most typical block designs. BIBDs have been applied in several fields such as design experiments, coding theory, and cryptography. In this paper, we consider the problem of generating BIBDs by SAT encoding. We present a new SAT encoding that is an enhancement of order encoding with the idea of binary tree. It is designed to reduce the number of clauses required for cardinality constraints, compared with order encoding. In our experiments, our encoding was able to give a greater number of solutions than order encoding and state-of-the-art constraint solvers Mistral and choco.

著者関連情報
© 2012 JSAI (The Japanese Society for Artificial Intelligence)
次の記事
feedback
Top