Computational experience with an interior point algorithm on the satisfiability problem
From MaRDI portal
Recommendations
Cites work
- A Computing Procedure for Quantification Theory
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
- A mathematical programming approach to inference with the capability of implementing default rules
- A method for the solution of certain non-linear problems in least squares
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- An interior point algorithm to solve computationally difficult set covering problems
- Branch-and-cut solution of inference problems in propositional logic
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- Modeling and integer programming techniques applied to propositional calculus
- Resolution vs. cutting plane solution of inference problems: Some computational experience
- Some results and experiments in programming techniques for propositional logic
- The complexity of theorem-proving procedures
Cited in
(21)- An intelligent algorithm for mixed-integer programming models
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
- New methods for computing inferences in first order logic
- Generating logical expressions from positive and negative examples via a branch-and-bound approach
- Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
- Resolution and the integrality of satisfiability problems
- Potential reduction algorithms for structured combinatorial optimization problems
- A potential reduction approach to the frequency assignment problem
- A BDD SAT solver for satisfiability testing: An industrial case study
- Experimental complexity analysis of continuous constraint satisfaction problems.
- Solving satisfiability problems using elliptic approximations -- effective branching rules
- Differential approximation for optimal satisfiability and related problems
- Matrix representation and gradient flows for NP-hard problems
- An approach to guided learning of Boolean functions
- On the minimum number of logical clauses inferred from examples
- The Multi-SAT algorithm
- The state of SAT
- Some pitfalls for experimenters with random SAT
- A continuous approach to inductive inference
- Interior-point algorithms for global optimization
- Differential approximation of MIN SAT, MAX SAT and related problems
This page was built for publication: Computational experience with an interior point algorithm on the satisfiability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753688)
