Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem

DOI10.1007/978-3-030-63461-2_21MaRDI QIDQ6487934zbMATH OpenFDO

Authors Stéphane Jacquet, S. Hallé

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-63461-2_21

Mathematics Subject Classification ID

Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 776082
• scientific article; zbMATH DE number 1759715
• Convergence properties of optimization algorithms for the SAT problem
• Search techniques for SAT-based Boolean optimization
• scientific article; zbMATH DE number 1336257

Cited in

(4)

• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
• Convergence properties of optimization algorithms for the SAT problem
• scientific article; zbMATH DE number 1759715 (Why is no real title available?)
• scientific article; zbMATH DE number 776082 (Why is no real title available?)

This page was built for publication: Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487934)