Theory and Applications of Satisfiability Testing
From MaRDI portal
Publication:5325882
DOI10.1007/b95238zbMath1204.68203OpenAlexW2494235144WikidataQ56039662 ScholiaQ56039662MaRDI QIDQ5325882
Daniel Le Berre, Laurent Simon
Publication date: 24 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95238
Related Items
The 2013 evaluation of SMT-COMP and SMT-LIB, The state of SAT, Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005), Answer set programming based on propositional satisfiability, The SAT-based approach to separation logic, Symbolic techniques in satisfiability solving, New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability, On variable-weighted exact satisfiability problems, Visualizing SAT instances and runs of the DPLL algorithm, Careful Ranking of Multiple Solvers with Timeouts and Ties, Extreme Cases in SAT Problems, SAT competition 2020, \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver, Present and Future of Practical SAT Solving
Uses Software
