Theory and Applications of Satisfiability Testing

DOI10.1007/11527695MaRDI QIDQ5714768zbMATHOpenAlexFDO

Authors Marijn J. H. Heule, Mark Dufour, Joris van Zwieten, Hans van Maaren

Publication date 16 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11527695

Mathematics Subject Classification ID

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

Recommendations

• Present and Future of Practical SAT Solving
• March\_dl: adding adaptive heuristics and a new branching strategy
• Theory and Applications of Satisfiability Testing
• Effective Incorporation of Double Look-Ahead Procedures
• scientific article; zbMATH DE number 1903342

Cited in

(15)

• March\_dl: adding adaptive heuristics and a new branching strategy
• Theory and Applications of Satisfiability Testing
• Logical cryptanalysis with WDSat
• Exploiting the real power of unit propagation lookahead
• On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\)
• March_eq
• The SAT-based approach to separation logic
• How to apply SAT-solving for the equivalence test of monotone normal forms
• Revisiting hyper binary resolution
• Generating SAT instances with community structure
• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• Popularity-similarity random SAT formulas
• Automatic construction of parallel portfolios via algorithm configuration
• Present and Future of Practical SAT Solving
• Equivalent literal propagation in the DLL procedure

This page was built for publication: Theory and Applications of Satisfiability Testing

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