Search techniques for SAT-based Boolean optimization
From MaRDI portal
Publication:2455454
DOI10.1016/j.jfranklin.2006.01.003zbMath1177.90294OpenAlexW1995172234MaRDI QIDQ2455454
Publication date: 24 October 2007
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2006.01.003
Integer programming (90C10) Linear programming (90C05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Dynamic symmetry-breaking for Boolean satisfiability
- BerkMin: A fast and robust SAT-solver
- Complexity Classifications of Boolean Constraint Satisfaction Problems
- Fast search algorithms for the n-queens problem
- GRASP: a search algorithm for propositional satisfiability
- A machine program for theorem-proving