Browse > Article

Effect on Preprocessing in SAT with Sudoku Puzzle  

Kwon, Gi-Hwon (경기대학교 컴퓨터과학과)
Publication Information
Journal of Information Technology Services / v.7, no.2, 2008 , pp. 127-135 More about this Journal
Abstract
The concept of preprocessing is widely used in various computer science area such as compiler and software engineering for the purpose of macro processing and optimization. In addition, preprocessing is also used in SAT solvers in order to eliminate redundant literals and clauses to speed up its solving time before searching the state space. However, there is an unexpected run-time error such as stack-overflow during this step, in case the size of a given set of clauses is huge which impedes SAT solvers. In this case, the preprocessing should be applied at the encoding time to optimize its size. In this paper this idea is applied to several Sudoku problems. As a result, significant improvements are obtained with respect to the number of variables and clauses as well as the solving time compared to the previous works.
Keywords
Satisfiability; Clause; Preprocessing; Sudoku;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Huth, M. and M. Ryan, Logic in Computer Science, Cambridge university Press, 2004
2 Subbarayan, S. and D. Pradhan, 'NiVER： Non increasing Variable Elimination Resolution for Preprocessing SAT Instances', in the Proceedings of SAT, 2004
3 Velev, M. N., 'Tuning SAT for Formal Verification and Testing', Journal of Universal Computer Science, Vol.10, No.12 (2006), pp.1559-1561
4 Davis, M., G. Logemann, and D. Loveland, 'A Machine Program for Theorem Proving', Communications of the ACM, Vol.5, No.7(1962), pp.394-397   DOI
5 Een, N. and N. Sorensson, 'An Extensible SAT Solver', in The Proceedings of SAT, 2003
6 Sinz, C. and E. M. Dieringer, 'DPvis - a Tool to Visualize Structured SAT Instances', in the Proceedings of SAT, (2005), pp. 257-268
7 Lynce, I. and J. Ouaknine, 'Sudoku as a SAT problem', in the Proceedings of AI MATH, 2006
8 Weber, T., 'A SAT-based Sudoku Solver', in the Proceedings of LPAR, (2005), pp.11- 15
9 Kwon, G. and H. Jain, Optimized CNF Encoding for Sudoku Puzzles, in the Proceedings of LPAR, 2006