Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
From MaRDI portal
Publication:2385178
Recommendations
Cites work
- scientific article; zbMATH DE number 5139165 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1149437 (Why is no real title available?)
- scientific article; zbMATH DE number 1882048 (Why is no real title available?)
- scientific article; zbMATH DE number 1414299 (Why is no real title available?)
- BerkMin: A fast and robust SAT-solver
- Local-search techniques for propositional logic extended with cardinality constraints
- Stochastic local search. Foundations and applications.
Cited in
(11)- scientific article; zbMATH DE number 956863 (Why is no real title available?)
- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
- scientific article; zbMATH DE number 5139165 (Why is no real title available?)
- Tools for modeling and solving search problems
- scientific article; zbMATH DE number 5139168 (Why is no real title available?)
- Incomplete dynamic backtracking for linear pseudo-Boolean problems
- Search techniques for SAT-based Boolean optimization
- scientific article; zbMATH DE number 5139167 (Why is no real title available?)
- scientific article; zbMATH DE number 2084740 (Why is no real title available?)
- Reformulation based MaxSat robustness
- Local-search techniques for propositional logic extended with cardinality constraints
This page was built for publication: Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385178)