Browse > Article

Comparative Analysis on CNF Encodings for Boolean Cardinality Constraints  

Lee, Min (경기대학교 컴퓨터과학과)
Kwon, Gi-Hwon (경기대학교 컴퓨터과학과)
Publication Information
Journal of KIISE:Software and Applications / v.35, no.2, 2008 , pp. 81-90 More about this Journal
Abstract
BCC(Boolean Cardinality Constraint) is to select one boolean variable from n different variables. It is widely used in many areas including software engineering. Thus, many efficient encoding techniques of BCC into CNF have been studied extensively In this paper we analyze some representative encodings with respect to flexibility as well as efficiency. In addition we use a visualization tool to draw the CNF clauses generated from each encodings. Visualizing the clauses exposes a hidden structure in encodings and makes to compare each encodings on the structure level, which is one of the prominent achievement in our work compared to other works. And we apply our analysis on the pigeon-hole problems to have confidence. In our experimental settings, the commander encoding shows the best performance.
Keywords
SAT problem; CNF encoding; Visualization; Encoding criteria;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 M. Huth and M. Ryan, Logic in Computer Science, Cambridge university Press, 2004
2 권기현, 'SAT 처리기를 위한 수도쿠 퍼즐의 최적화된 인코딩', 정보과학회논문지: 소프트웨어 및 응용, 정보과학회, 제34권 제7호, pp. 616-624, 2007   과학기술학회마을
3 I. Lynce and J. Ouaknine, 'Sudoku as a SAT problem,' in The Proceedings of AIMATH, 2006
4 Will Klieber and G. Kwon, 'Efficient CNF Encoding for Selecting 1 from N Objects,' in Proceedings of CFV'07, 2007
5 M. Davis, G. Logemann and D. Loveland, 'A Machine Program for Theorem Proving,' Communications of the ACM 5 (7): 394-397, 1962   DOI
6 Alloy tool (웹 사이트 http://alloy.mit.edu/)
7 From http://www.satlib.org/Benchmarks/SAT/satformat.ps
8 C. Sinz, 'Towards an Optimal CNF Encoding of Boolean Cardinality Constraints,' in Proceedings of CP 2005, pp. 827-831, 2005
9 C. Sinz and E.M. Dieringer, 'DPvis - a Tool to Visualize Structured SAT Instances,' in Proceedings of SAT 2005, pp. 257-268, 2005
10 T. Latvala, A. Biere, K.Heljanko, and T. Junttila, 'Simple Bounded LTL Model Checking,' in Proceedings of FMCAD'2004, pp. 186-200, 2004
11 N. Een and N. Sorensson, 'An Extensible SAT Solver,' in Proceedings of SAT'03, 2003
12 M.N. Velev, 'Tuning SAT for Formal Verification and Testing,' Journal of Universal Computer Science Vol.10, Issue 12, pp. 1559-1561, 2006
13 F.A. Aloul, K.A. Sakallah, and I.L. Markov, 'Efficient Symmetry Breaking for Boolean Satisfiability,' IEEE Transactions on Computer, Vol.55, No.5, pp. 549-558, 2006   DOI
14 J.P. Silva and K.A. Sakallah, 'GRAPS: A Search Algorithm for Propositional Satisfiability,' IEEE Trans. Computers, Vol.48, No.5, pp. 506-521, 1999   DOI   ScienceOn
15 F. Ivancic, et.al., 'F-Soft: Software Verification Platform,' in Proceedings of the International Conference on Computer Aided Verification (CAV), July 2005
16 J.P. Warners, 'A Linear-time Transformation of Linear Inequalities into Conjunctive Normal Form,' Information Processing Letter, Vol.68, pp. 63-69, 1998   DOI   ScienceOn
17 M.W. Moskewicz, et.al., 'Chaff: Engineering an Efficient SAT Solver,' in Proceedings of DAC'01. 2001
18 M. Sheeran and G. Stalmarck, 'A Tutorial on Stalmarck's Proof Procedure for Propositional Logic,' in Proceedings of FMCAD'98, pp. 82-99, 1998
19 I. Lynce and J.P. Silva, 'Efficient data structures for backtrack search SAT solvers,' Journal of Annual Mathematics Artificial Intelligence, Vol.43, No.1, pp. 137-152, 2005   DOI
20 O. Baileux and Y. Boufkhad, 'Efficient CNF Encoding of Boolean Cardinality Constraints,' in Proceedings of CP 2003, pp. 108-122, 2003