References
- 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. https://doi.org/10.1016/j.tcs.2015.08.029
- 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. https://doi.org/10.1016/j.jsc.2015.02.007
- 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.
- J. Rintanen, "Planning as satisfiability: heuristics," Artificial Intelligence, vol. 193, pp. 45-86, 2012. https://doi.org/10.1016/j.artint.2012.08.001
- 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. https://doi.org/10.1016/j.jcss.2016.02.002
- 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.
- H. Kurokawa, "Tableaux and hypersequents for justification logics," Annals of Pure and Applied Logic, vol. 163, no. 7, pp. 831-853, 2012. https://doi.org/10.1016/j.apal.2011.09.013
- J. A. Robinson, "A machine-oriented logic based on the resolution principle," Journal of the ACM, vol. 12, no. 1, pp. 23-41, 1965. https://doi.org/10.1145/321250.321253
- 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. https://doi.org/10.1016/j.artint.2015.11.002
- 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. https://doi.org/10.1023/A:1027339205632
- 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. https://doi.org/10.3724/SP.J.1001.2009.03420
- M. Davis and H. Putnam, "A computing procedure for quantification theory," Journal of the ACM, vol. 7, no. 3, pp. 201-215, 1960. https://doi.org/10.1145/321033.321034
- 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. https://doi.org/10.1145/368273.368557
- X. H. Liu, Automated Reasoning Based on Resolution Methods. Beijing: Science Press, 1994.