Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMath1122.68599OpenAlexW2483910514MaRDI QIDQ5714768

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

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)

Related Items

Generating SAT instances with community structure ⋮ The SAT-based approach to separation logic ⋮ On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) ⋮ Popularity-similarity random SAT formulas ⋮ Automatic construction of parallel portfolios via algorithm configuration ⋮ March_eq ⋮ \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver ⋮ Present and Future of Practical SAT Solving ⋮ Logical cryptanalysis with WDSat