Theory and Applications of Satisfiability Testing
From MaRDI portal
(Redirected from Theory and Applications of Satisfiability Testing)
Theory and Applications of Satisfiability Testing (scientific article; zbMATH DE number 5586646)
Theory and Applications of Satisfiability Testing (scientific article; zbMATH DE number 5586646)
Recommendations
Cited in
(21)- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
- SAT competition 2020
- Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)
- On variable-weighted exact satisfiability problems
- Visualizing SAT instances and runs of the DPLL algorithm
- The state of SAT
- SATLIB: An online resource for research on SAT
- Controlling a solver execution with the runsolver Tool
- Extreme cases in SAT problems
- The 2013 evaluation of SMT-COMP and SMT-LIB
- Careful ranking of multiple solvers with timeouts and ties
- SAT race 2015
- The first and second Max-SAT evaluations
- Present and Future of Practical SAT Solving
- Theory and Applications of Satisfiability Testing
- Promoting robust black-box solvers through competitions
- 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
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 Q5325882)
