SAT race 2015
From MaRDI portal
Publication:334795
DOI10.1016/j.artint.2016.08.007zbMath1392.68381OpenAlexW2508838091WikidataQ59065435 ScholiaQ59065435MaRDI QIDQ334795
Carsten Sinz, Markus Iser, Armin Biere, Tomáš Balyo
Publication date: 1 November 2016
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2016.08.007
Related Items
Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way, On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers, On black-box optimization in divide-and-conquer SAT solving, Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems, Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations, SAT competition 2020, The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17), The \textsc{MergeSat} solver
Uses Software
Cites Work
- Optimal speedup of Las Vegas algorithms
- Blocked Clause Decomposition
- Inprocessing Rules
- Lazy Clause Exchange Policy for Parallel SAT Solvers
- PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
- Recognition of Nested Gates in CNF Formulas
- Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
- Automated Benchmarking of Incremental SAT and QBF Solvers
- Blocked Clause Elimination
- GRASP: a search algorithm for propositional satisfiability
- Improving Resource-Unaware SAT Solvers
- Theory and Applications of Satisfiability Testing
- Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
- The complexity of theorem-proving procedures
- Computer Aided Verification
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
