Abstract
In order to leverage the capacities of non-linear constraint solvers, we propose a reformulation of SAT into a box-constrained optimization problem where the objective function is polynomial. We prove that any optimal solution of the numerical problem corresponds to a solution of the Boolean formula, and demonstrate a stopping criterion that can be used with a numerical solver.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. SSORFE. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68913-5
Chen, J., Qian, P.Z.G.: Latin hypercube designs with controlled correlations and multi-dimensional stratification. Biometrika 101(2), 319–332 (2014)
Cont, R., Heidari, M.: Optimal rounding under integer constraints. CoRR, abs/1501.00014 (2015)
Dressler, M., Iliman, S., de Wolff, T.: An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming. J. Symb. Comput. 91, 149–172 (2019)
Duda, J.: P =? NP as minimization of degree 4 polynomial, or Grassmann number problem. CoRR, abs/1703.04456 (2017)
Fang, C., Liu, A.: A linear algebra formulation for boolean satisfiability testing. CoRR, abs/1701.02401 (2017)
Gu, J.: Global optimization for satisfiability (SAT) problem. IEEE Trans. Knowl. Data Eng. 6(3), 361–381 (1994)
Inala, J.P., Gao, S., Kong, S., Solar-Lezama, A.: REAS: combining numerical optimization with SAT solving. CoRR, abs/1802.04408 (2018)
R. M. Karp. Reducibility among Combinatorial Problems, pages 85–103. Springer, US, Boston, MA, 1972
Li, Z.: Polynomial optimization problems. PhD thesis, The Chinese University of Hong Kong (2011)
Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7(4), 308–313 (1965)
Ruder, S.: An overview of gradient descent optimization algorithms. CoRR, abs/1609.04747 (2016)
Thengade, A., Dondal, R.: Genetic algorithm - survey paper. In: IJCA Proceeding National Conference on Recent Trends in Computing, NCRTC, 5, January 2012
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Jacquet, S., Hallé, S. (2020). Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem. In: Dongol, B., Troubitsyna, E. (eds) Integrated Formal Methods. IFM 2020. Lecture Notes in Computer Science(), vol 12546. Springer, Cham. https://doi.org/10.1007/978-3-030-63461-2_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-63461-2_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-63460-5
Online ISBN: 978-3-030-63461-2
eBook Packages: Computer ScienceComputer Science (R0)