Improved local search for circuit satisfiability

DOI10.1007/978-3-642-14186-7_24MaRDI QIDQ4930596zbMATH OpenOpenAlexFDO

Authors Anton Belov, Zbigniew Stachniak

Publication date 29 September 2010

Published in Theory and Applications of Satisfiability Testing – SAT 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14186-7_24

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 956863
• Local search characteristics of incomplete SAT procedures
• SAT local search algorithms: Worst-case study
• Justification-Based Local Search with Adaptive Noise Strategies
• Local search algorithms for SAT: Worst-case analysis

Cited in

(3)

• Propagation based local search for bit-precise reasoning
• scientific article; zbMATH DE number 1941180 (Why is no real title available?)
• Justification-Based Local Search with Adaptive Noise Strategies

Describes a project that uses

Uses Software

• MiniSat
• UnitWalk

This page was built for publication: Improved local search for circuit satisfiability

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