Automated Testing and Debugging of SAT and QBF Solvers

DOI10.1007/978-3-642-14186-7_6zbMath1306.68155OpenAlexW1541238879WikidataQ29012616 ScholiaQ29012616MaRDI QIDQ4930578

Robert Brummayer, Florian Lonsing, Armin Biere

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_6

Mathematics Subject Classification ID

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

Related Items (18)

versat: A Verified Modern SAT Solver ⋮ The reflective Milawa theorem prover is sound (down to the machine code that runs it) ⋮ SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers ⋮ Expressing Symmetry Breaking in DRAT Proofs ⋮ Mining definitions in Kissat with Kittens ⋮ Unnamed Item ⋮ Never trust your solver: certification for SAT and QBF ⋮ Towards Uniform Certification in QBF ⋮ QMaxSATpb: a certified MaxSAT solver ⋮ Efficient benchmarking of algorithm configurators via model-based surrogates ⋮ The configurable SAT solver challenge (CSSC) ⋮ Certified dominance and symmetry breaking for combinatorial optimisation ⋮ New models for generating hard random Boolean formulas and disjunctive logic programs ⋮ SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers ⋮ The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ QBFFam: a tool for generating QBF families from proof complexity

Uses Software

• Unnamed Item
• Unnamed Item
• Unnamed Item
• SMT-LIB
• PicoSAT
• QuickCheck
• Quaffle
• RSat

This page was built for publication: Automated Testing and Debugging of SAT and QBF Solvers