Empirical Study of the Anatomy of Modern Sat Solvers

DOI10.1007/978-3-642-21581-0_27zbMath1330.68271OpenAlexW2121341976MaRDI QIDQ3007695

Karem A. Sakallah, Hadi Katebi, João P. Marques-Silva

Publication date: 17 June 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-21581-0_27

Mathematics Subject Classification ID

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

Related Items (6)

Backdoors to Normality for Disjunctive Logic Programs ⋮ Using Community Structure to Detect Relevant Learnt Clauses ⋮ A SAT Approach to Clique-Width ⋮ Backdoors to tractable answer set programming ⋮ Assessing progress in SAT solvers through the Lens of incremental SAT ⋮ The \textsc{MergeSat} solver

Uses Software

• MiniSat
• PiMaG
• RSat
• Velev SAT Benchmarks
• Calysto

Cites Work

• Unnamed Item
• Optimal speedup of Las Vegas algorithms
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• Adaptive Restart Strategies for Conflict Driven SAT Solvers
• SAT Solving for Termination Analysis with Polynomial Interpretations
• Efficiently Calculating Evolutionary Tree Measures Using SAT
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Correct Hardware Design and Verification Methods
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Applications of SAT Solvers to Cryptanalysis of Hash Functions

This page was built for publication: Empirical Study of the Anatomy of Modern Sat Solvers