Browse > Article

Optimal CNF Encoding for Representing Adjacency in Boolean Cardinality Constraints  

Park, Sa-Choun (경기대학교 컴퓨터과학과)
Kwon, Gi-Hwon (경기대학교 컴퓨터과학과)
Publication Information
Journal of KIISE:Software and Applications / v.35, no.11, 2008 , pp. 661-670 More about this Journal
Abstract
In some applications of software engineering such as the verification of software model or embedded program, SAT solver is used. To practical use a SAT solver, a problem is encoded to a CNF formula, but because the formula has lower expressiveness than software models or source codes, optimal CNF encoding is required. In this paper, we propose optimal encoding techniques for the problem of "Selecting adjacent $k{\leq}n$ among n objects," Through experimental results we show the proposed constraint is efficient and correct to solve Japanese puzzle. As we know, this paper is the first study about CNF encoding for adjacency in BCC.
Keywords
Satisfiability Checking; Boolean Cardinality Constraint; Adjacency;
Citations & Related Records
연도 인용수 순위
  • Reference
1 E. M. Clarke, O. Grumberg and D. Peled, Model Checking, MIT Press, 1999
2 A. Biere, A. Cimatti, E. Clarke, Ofer Strichman, and Y. Zhu, "Bounded Model Checking," Vol. 58 of Advances in Computers, 2003
3 http://en.wikipedia.org/wiki/Nonogram
4 M.W. Moskewicz, C. Madigan, Y. Zhao, L. Zhang and S. Malik, "Chaff: Engineering an Efficient SAT Solver," In Proceedings of Design Automation Conference, 2001.
5 O.Bailleux and Y. Boufkhad, "Efficient CNF encoding of Boolean cardinality constraints," in Proceedings of the CP 2003, vol. 2833, LNCS, 2003
6 http://alloy.mit.edu/
7 G.J. Holzmann, The SPIN Model Checker, Addsion Wesley, 2004
8 M. Merritt, A. Orda, and S.R. Sachs, "Formal Verification of a Distributed Computer System," In Formal Methods in System Design Journal, Kluwer Academic Publisher, vol. 10, pp. 93-125, 1997
9 B. Benhamou, L. Sais and P. Siegel, "Two proof procedures for a cardinality based language in propositional calculus," in Proceedings of the STACS94, vol. 775, LNCS, 1994
10 http://www.cs.chalmers.se/Cs/Research/For-malMethods/MiniSat/
11 C. Sinz, "Towards an optimal CNF encoding of Boolean cardinality constraints," In Proceedings of the CP 2005, vol. 3709, LNCS, 2005
12 S.M. Suhaib and D. BernerM, "Extreme Modeling in PROMELA: Formal Modeling and Verification of a Smart Building Control System," FERMAT Lab Technical Report No. 2003-11. Virginia Tech, Blacksburg, VA, December 2003
13 B. J. Batenburg and W. A. Kosters, "A discrete tomography approach to Japanese puzzles," in Proceedings of the Belgian-Dutch Conf. Artificial Intelligence, 2004
14 G. Kwon and W. Klieber, "Efficient CNF Encoding for Selecting 1 from N Objects," In the Proceeding of CFV07, 2007