Local Search for Unsatisfiability

DOI10.1007/11814948_28MaRDI QIDQ5756575zbMATH OpenOpenAlexFDO

Authors Steven Prestwich, Inês Lynce

Publication date 4 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11814948_28

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• SAT local search algorithms: Worst-case study
• SAT local search algorithms: Worst-case study
• Local search algorithms for SAT: Worst-case analysis
• scientific article; zbMATH DE number 956863
• scientific article; zbMATH DE number 956858

Cited in

(9)

• Proving unsatisfiability of CNFs locally
• Proving unsatisfiability of CNFs locally
• Improvements to Hybrid Incremental SAT Algorithms
• An overview of parallel SAT solving
• The Relation Between Complete and Incomplete Search
• scientific article; zbMATH DE number 956863 (Why is no real title available?)
• Theorem proving as constraint solving with coherent logic
• Finding the hardest formulas for resolution
• Local Symmetry Breaking During Search in CSPs

This page was built for publication: Local Search for Unsatisfiability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756575)