scientific article; zbMATH DE number 776082

MaRDI QIDQ4840102zbMATH OpenFDO

Authors J. Gu

Publication date 16 April 1996

zbMATH Keywords

satisfiability problemconjunctive normal form formulas

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Parallel algorithms in computer science (68W10)

Recommendations

• Convergence properties of optimization algorithms for the SAT problem
• scientific article; zbMATH DE number 1113992
• scientific article; zbMATH DE number 828719
• scientific article; zbMATH DE number 1304346
• Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem

Cited in

(17)

• scientific article; zbMATH DE number 1765679 (Why is no real title available?)
• Black-box optimization in an extended search space for SAT solving
• Convergence properties of optimization algorithms for the SAT problem
• Improving Unsatisfiability-Based Algorithms for Boolean Optimization
• A BDD SAT solver for satisfiability testing: An industrial case study
• Major 2 satisfiability logic in discrete Hopfield neural network
• Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem
• Approximating minimal unsatisfiable subformulae by means of adaptive core search
• A physical model for the satisfiability problem
• Application of sedimentation algorithm for solving max-sat problem
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• A complete adaptive algorithm for propositional satisfiability
• scientific article; zbMATH DE number 828719 (Why is no real title available?)
• Optimization methods in logic
• Optimal performance evaluation metrics for satisfiability logic representation in discrete Hopfield neural network
• Application of SAT-approach for solving combinatorial problems
• Optimizing with minimum satisfiability

This page was built for publication:

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