Local Search for Unsatisfiability

DOI10.1007/11814948_28zbMATH Open1187.68561OpenAlexW1552098422MaRDI QIDQ5756575FDOQ5756575

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

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

Mathematics Subject Classification ID

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

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
• Title not available (Why is that?)
• The Relation Between Complete and Incomplete Search
• 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)