Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2008.15-D.6.777

Extracting Subsequence of Boolean Variables using SAT-solver  

Park, Sa-Choun (경기대학교 전산학과)
Kwon, Gi-Hwon (경기대학교 정보과학부)
Publication Information
The KIPS Transactions:PartD / v.15D, no.6, 2008 , pp. 777-784 More about this Journal
Abstract
Recently in the field of model checking, to overcome the state explosion problem, the method of using a SAT-solver is mainly researched. To use a SAT-solver, the system to be verified is translated into CNF and the Boolean cardinality constraint is widely used in translating the system into CNF. In BCC it is dealt with set of boolean variables, but there is no translating method of the sequence among Boolean variables. In this paper, we propose methods for translating the problem, which is extracting a subsequence with length k from a sequence of Boolean variables, into CNF formulas. Through experimental results, we show that our method is more efficient than using only BCC.
Keywords
Formal Verification; Satisfiability; Boolean Cardinality Constraints; Extracting Subsequence; Solving Puzzle;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Marques-Silva, J. P., and Sakallah, K. A., “GRASP: A Search Algorithm for Propositional Satisfiability,” IEEE Transactions on Computers, Vol.48, pp.506-521, 1999   DOI   ScienceOn
2 K. J. Batenburg, An evolutionary algorithm for discrete tomography, Discrete Applied Mathematics, 2004
3 A. Biere, A. Cimatti, E. Clarke, Ofer Strichman, and Y. Zhu, “Bounded Model Checking,” Vol.58 of Advances in Computers, 2003
4 T. Latvala, A. Biere, K. Heljanko, and T. Junttila, “Simple Is Better: Efficient Bounded Model Checking for Past LTL,” the Proceedings of VMCAI 2005, Vol.3385, LNCS, 2005
5 G. Kwon and H. Jain, “Optimized CNF Encoding for Sudoku Puzzles,” The Proceedings of LPAR06, 2006
6 M.W. Moskewicz, C. Madigan, Y. Zhao, L. Zhang and S. Malik, “Chaff: Engineering an Efficient SAT Solver,” Proceedings of Design Automation Conference, 2001
7 O.Bailleux and Y. Boufkhad, “Efficient CNF encoding of Boolean cardinality constraints,” Proceedings of the CP 2003, Vol.2833, LNCS, 2003
8 C. Sinz, “Towards an optimal CNF encoding of Boolean cardinality constraints,” Proceedings of the CP 2005, Vol.3709, LNCS, 2005   DOI   ScienceOn
9 E. M. Clarke, O. Grumberg and D. Peled, Model Checking, MIT Press, 1999
10 M. Davis, G. Logemann, and D. Loveland, “A Machine Program for Theorem Proving.” Communications of the ACM 5 (7): 394–397, 1962   DOI
11 http://www.cs.chalmers.se/Cs/Research/For-malMethods/MiniSat/
12 H. Kautz and B. Selman. “Planning as satisfiability,” Proceedings of the ECAI'92, pages 359–363. John Wiley & Sons, Inc., 1992
13 B. J. Batenburg and W. A. Kosters, “A discrete tomography approach to Japanese puzzles,” Proceedings of the Belgian-Dutch Conf. Artificial Intelligence, 2004
14 http://en.wikipedia.org/wiki/Nonogram