scientific article; zbMATH DE number 776082
From MaRDI portal
Publication:4840102
Recommendations
Cited in
(21)- A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
- A BDD SAT solver for satisfiability testing: An industrial case study
- A discrete Lagrangian-based global-search method for solving satisfiability problems
- Approximating minimal unsatisfiable subformulae by means of adaptive core search
- Optimizing with minimum satisfiability
- A complete adaptive algorithm for propositional satisfiability
- Black-box optimization in an extended search space for SAT solving
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences
- Optimization methods in logic
- scientific article; zbMATH DE number 1113992 (Why is no real title available?)
- scientific article; zbMATH DE number 1114000 (Why is no real title available?)
- Convergence properties of optimization algorithms for the SAT problem
- scientific article; zbMATH DE number 1765679 (Why is no real title available?)
- scientific article; zbMATH DE number 828719 (Why is no real title available?)
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- Optimal performance evaluation metrics for satisfiability logic representation in discrete Hopfield neural network
- Major 2 satisfiability logic in discrete Hopfield neural network
- Application of SAT-approach for solving combinatorial problems
- Application of sedimentation algorithm for solving max-sat problem
- A physical model for the satisfiability problem
- Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem
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)
