The international SAT Competitions web page. The purpose of the competition is to identify new challenging benchmarks and to promote new solvers for the propositional satisfiability problem (SAT) as well as to compare them with state-of-the-art solvers. We strongly encourage people thinking about SAT-based techniques in their area (planning, hardware or software verification, etc.) to submit benchmarks to be used for the competition. The result of the competition will be a good indicator of the current feasibility of such approach. The competition will be completely automated using the SAT-Ex system.
Keywords for this software
References in zbMATH (referenced in 8 articles )
Showing results 1 to 8 of 8.
- Hutter, Frank; Lindauer, Marius; Balint, Adrian; Bayless, Sam; Hoos, Holger; Leyton-Brown, Kevin: The configurable SAT solver challenge (CSSC) (2017)
- Ansótegui, Carlos; Gabàs, Joel; Malitsky, Yuri; Sellmann, Meinolf: MaxSAT by improved instance-specific algorithm configuration (2016)
- KhudaBukhsh, Ashiqur R.; Xu, Lin; Hoos, Holger H.; Leyton-Brown, Kevin: SATenstein: automatically building local search SAT solvers from components (2016)
- Cai, Shaowei; Luo, Chuan; Su, Kaile: CCAnr: a configuration checking based local search solver for non-random satisfiability (2015)
- Schulz, Sven; Blochinger, Wolfgang: Parallel SAT solving on peer-to-peer desktop grids (2010) ioport
- Bryant, Randal E.; Kroening, Daniel; Ouaknine, Joël; Seshia, Sanjit A.; Strichman, Ofer; Brady, Bryan: An abstraction-based decision procedure for bit-vector arithmetic (2009) ioport
- Järvisalo, Matti; Junttila, Tommi: Limitations of restricted branching in clause learning (2009)
- Sabharwal, Ashish: SymChaff: Exploiting symmetry in a structure-aware satisfiability solver (2009)