Adaptive Restart Strategies for Conflict Driven SAT Solvers

DOI10.1007/978-3-540-79719-7_4zbMath1138.68533OpenAlexW1485011986MaRDI QIDQ3502690

Armin Biere

Publication date: 27 May 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-79719-7_4

Mathematics Subject Classification ID

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

Related Items (12)

What we can learn from conflicts in propositional satisfiability ⋮ Between SAT and UNSAT: The Fundamental Difference in CDCL SAT ⋮ Evaluating CDCL Variable Scoring Schemes ⋮ A column generation approach and new bounds for the car sequencing problem ⋮ Multistage robust discrete optimization via quantified integer programming ⋮ Learning from conflicts in propositional satisfiability ⋮ Empirical Study of the Anatomy of Modern Sat Solvers ⋮ Accelerating backtrack search with a best-first-search strategy ⋮ Learning Rate Based Branching Heuristic for SAT Solvers ⋮ Deep cooperation of CDCL and local search for SAT ⋮ On dedicated CDCL strategies for PB solvers ⋮ Leveraging GPUs for effective clause sharing in parallel SAT solving

Uses Software

• Chaff
• PicoSAT
• RSat

Cites Work

• Optimal speedup of Las Vegas algorithms
• Theory and Applications of Satisfiability Testing
• Unnamed Item

This page was built for publication: Adaptive Restart Strategies for Conflict Driven SAT Solvers