Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMATH Open1122.68599OpenAlexW2483910514MaRDI QIDQ5714768FDOQ5714768

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

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

Mathematics Subject Classification ID

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

Cited In (15)

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

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)