[KSCI] Korea Science Citation Index Service

http://dx.doi.org/10.3745/JIPS.02.0071

An Algorithm Solving SAT Problem Based on Splitting Rule and Extension Rule

Xu, Youjun (College of Computer Science and Information Technology, Daqing Normal University)

Publication Information

Journal of Information Processing Systems / v.13, no.5, 2017 , pp. 1149-1157 More about this Journal

Abstract

The satisfiability problem is always a core problem in artificial intelligence (AI). And how to improve the efficiency of algorithms solving the satisfiability problem is widely concerned. Algorithm IER (Improved Extension Rule) is based on extension rule. The number of atoms and the number of clauses affect the efficiency of the algorithm IER. DPLL rules are helpful to reduce these numbers. Then a complete algorithm CIER based on splitting rule and extension rule is proposed in this paper in order to improve the efficiency. At first, the algorithm CIER (Complete Improved Extension Rule) reduces the scale of a clause set with DPLL rules. Then, the clause set is split into a group of small clause sets. In the end, the satisfiability of the clause set is got from these small clause sets'. A strategy MOAMD (maximum occurrences and maximum difference) for the algorithm CIER is given. With this strategy, a better arrangement of atoms could be got. This arrangement could make the number of small clause sets fewer and the scale of these sets smaller. So, the algorithm CIER will be more efficient.

Keywords

Extension Rule; IER; MOAMD Strategy; Satisfiability Problem; Splitting Rule;

Citations & Related Records

Reference

1	I. Kanja and S. Szeider, "Parameterized and subexponential-time complexity of satisfiability problems and applications," Theoretical Computer Science, vol. 607 (Part 3), pp. 282-295, 2015. DOI
2	J. Han, Z. Jin, and B. Xia, "Proving inequalities and solving global optimization problems via simplified CAD projection," Journal of Symbolic Computation, vol. 72, pp. 206-230, 2016. DOI
3	D. Kaiss, M. Skaba, Z. Hanna, and Z. Khasidashvili, "Industrial strength SAT-based alignability algorithm for hardware equivalence verification," in Proceedings of the Formal Methods in Computer Aided Design, Austin, TX, 2007, pp. 20-26.
4	J. Rintanen, "Planning as satisfiability: heuristics," Artificial Intelligence, vol. 193, pp. 45-86, 2012. DOI
5	C. Carapelle, A. Kartzow, and M. Lohrey, "Satisfiability of ECTL* with constraints," Journal of Computer and System Sciences, vol. 82, no. 5, pp. 826-855, 2016. DOI
6	W. Wu and M. S. Hsiao, "SAT-based state justification with adaptive mining of invariants," in Proceedings of the IEEE International Test Conference, Santa Clara, CA, 2008, pp. 1-10.
7	H. Kurokawa, "Tableaux and hypersequents for justification logics," Annals of Pure and Applied Logic, vol. 163, no. 7, pp. 831-853, 2012. DOI
8	J. A. Robinson, "A machine-oriented logic based on the resolution principle," Journal of the ACM, vol. 12, no. 1, pp. 23-41, 1965. DOI
9	A. R. KhudaBukhsh, L. Xu, H. H. Hoos, and K. Leyton-Brown, "SATenstein: automatically building local search SAT solvers from components," Artificial Intelligence, vol. 232, pp. 20-42, 2016. DOI
10	H. Lin, J. Sun, and Y. Zhang, "Theorem proving based on the extension rule," Journal of Automated Reasoning, vol. 31, no. 1, pp. 11-21, 2003. DOI
11	Y. Li, J. G. Sun, X. Wu, and X. J. Zhu, "Extension rule algorithms based on IMOM and IBOHM heuristics strategies," Journal of Software, vol. 20, no. 6, pp. 1521-1527, 2009. DOI
12	M. Davis and H. Putnam, "A computing procedure for quantification theory," Journal of the ACM, vol. 7, no. 3, pp. 201-215, 1960. DOI
13	M. Davis, G. Logemann, and D. Loveland, "A machine program for theorem-proving," Communications of the ACM, vol. 5, no. 7, pp. 394-397, 1962. DOI
14	X. H. Liu, Automated Reasoning Based on Resolution Methods. Beijing: Science Press, 1994.