Abstract
In this paper, we present a SAT solver based on the combination of DPLL (Davis Putnam Logemann and Loveland) algorithm and Failed Literal Detection (FLD), one of the advanced reasoning techniques. We propose a Dynamic Filtering method that consists of two restriction rules for FLD: internal and external filtering. The method reduces the number of tested literals in FLD and its computational time while maintaining the ability to find most of the failed literals in each decision level. Unlike the pre-defined criteria, literals are removed dynamically in our approach. In this way, our FLD can adapt itself to different real-life benchmarks. Many useless tests are therefore avoided and as a consequence it makes FLD fast. Some other static restrictions are also added to further improve the efficiency of FLD. Experiments show that our optimized FLD is much more efficient than other advanced reasoning techniques.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Burch, J. R., Singhal, V., Tight integration of combinational verification methods, in Proceedings of IEEE/ACM International Conference on Computer-Aided Design, New York: The Association for Computing Machinery Inc., 1998, 570–576.
Biere, A., Cimatti, A., Clarke, E. M. et al., Symbolic model checking using SAT procedure instead of BDDs, In Proceedings of Design Automation Conference, New York: The Association for Computing Machinery Inc., 1999, 317–320.
Selman, B., Levesque, H., Mitchell, D., A new method for solving hard satisfiability problems, In Proceedings of the 10th National Conference on Artificial (AAAI), Intelligence American Association for Artificial Intelligence Press, 1992, 440–446.
Selman, B., Kautz, H. A., Cohen, B., Noise strategies for improving local search, In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI), American Association for Artificial Intelligence Press, 1994, 337–343.
Zhang, L., Madigan, C., Moskewicz, M. et al., Efficient conflict driven learning in a Boolean satisfiability solver, In Proceedings of the 2001 International Conference on Computer-Aided Design, New York: The Association for Computing Machinery Inc., 2001, 279–285.
Marques-Silva, J., Sakallah, K., GRASP: A search algorithm for propositional satisfiability, IEEE Transactions on Computers, Los Alamitos: IEEE Computer Society, 1999, 48: 506–521.
Bacchus, F., Enhancing Davis Putnam with extended binary clause reasoning, In Proceedings of 18th National Conference on Artificial Intelligence (AAAI), American Association for Artificial Intelligence Press, 2002, 613–619.
Li, C. M., Anbulagan, Heuristics based on unit propagation for satisfiability problems, In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), San Fransisco: Morgan Kaufmann Publisher, 1997, 366–371.
Hooker, J. N., Vinay, V., Branch rules for satisfiability, Journal of Automated Reasoning, 1995, 15(3): 359–383.
Moskewicz, M., Madigan, C., Zhao, Y. et al., Chaff: Engineering an efficient SAT solver, In Proceedings of 38th Conference on Design Automation, New York: The Association for Computing Machinery Inc., 2001, 530–535.
Goldberg, E., Novikov, Y., BerkMin: a fast and robust sat-solver, In Proceedings of Design, Automation and Test in Europe Conference and Exhibition (DATE), Los Alamitos: IEEE Computer Society, 2002, 142–149.
Lu, F., Wang, L.-C., Cheng, K.-T. et al., A circuit SAT solver with signal correlation guided learning, In Proceedings of Design, Automation and Test in Europe Conference and Exhibition (DATE), Los Alamitos: IEEE Computer Society, 2003, 892–897.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ding, M., Tang, P. & Zhou, D. Integrating advanced reasoning into a SAT solver. Sci China Ser F 48, 366–378 (2005). https://doi.org/10.1360/04yf0171
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1360/04yf0171