scientific article; zbMATH DE number 776082

zbMATH Open0837.68040MaRDI QIDQ4840102FDOQ4840102

Authors: J. Gu 

Publication date: 16 April 1996

Title of this publication is not available (Why is that?)

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

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)

Cited In (13)

• Convergence properties of optimization algorithms for the SAT problem
• Optimizing with minimum satisfiability
• Optimization methods in logic
• Improving Unsatisfiability-Based Algorithms for Boolean Optimization
• Title not available (Why is that?)
• A physical model for the satisfiability problem
• A complete adaptive algorithm for propositional satisfiability
• Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem
• Approximating minimal unsatisfiable subformulae by means of adaptive core search
• Title not available (Why is that?)
• Black-box optimization in an extended search space for SAT solving
• A BDD SAT solver for satisfiability testing: An industrial case study
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences

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)