SAT competition 2020
From MaRDI portal
Publication:2060693
Recommendations
- Theory and Applications of Satisfiability Testing
- SAT race 2015
- Theory and Applications of Satisfiability Testing
- Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
- Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)
Cites work
- Algorithms for computing backbones of propositional formulae
- Between SAT and UNSAT: the fundamental difference in CDCL SAT
- Chronological backtracking
- Clause vivification by unit propagation in CDCL SAT solvers
- Computer Aided Verification
- Concurrent clause strengthening
- CrystalBall: gazing in the black box of SAT solving
- Designing new phase selection heuristics
- Determining computational complexity from characteristic ``phase transitions
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Handbook of satisfiability. In 2 parts
- HordeSat: a massively parallel portfolio SAT solver
- Improved static symmetry breaking for SAT
- Incremental inprocessing in SAT solving
- Lazy clause exchange policy for parallel SAT solvers
- Learning rate based branching heuristic for SAT solvers
- ManySAT: a parallel SAT solver
- PBLib -- a library for encoding pseudo-Boolean constraints into CNF
- Planning as satisfiability: parallel plans and algorithms for plan search
- SAT competition 2020
- SAT race 2015
- Scalable SAT solving in the cloud
- Temporal induction by incremental SAT solving
- The fast downward planning system
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
- Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29--April 6, 2008. Procee
- Trail saving on backtrack
- Truth assignments as conditional autarkies
- Ultimately incremental SAT
Cited in
(25)- SAT competition 2020
- Eliminating models during model elimination
- Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)
- The state of SAT
- SAT race 2015
- The first and second Max-SAT evaluations
- Hard satisfiable 3-SAT instances via autocorrelation
- Theory and Applications of Satisfiability Testing
- scientific article; zbMATH DE number 956858 (Why is no real title available?)
- Theory and Applications of Satisfiability Testing
- Machine learning and logic: a new frontier in artificial intelligence
- Intuitive modelling and formal analysis of collective behaviour in foraging ants
- Learning to select SAT encodings for pseudo-Boolean and linear Integer constraints
- Convexity of division property transitions: theory, algorithms and compact models
- Decentralized Online Scheduling of Malleable NP-hard Jobs
- Unsatisfiability proofs for distributed clause-sharing SAT solvers
- Maximum satisfiability of mission-time linear temporal logic
- Trusted scalable SAT solving with on-the-fly LRAT checking
- Global benchmark database
- A verified algorithm for deciding pattern completeness
- Active learning for SAT solver benchmarking. Extended and revised version
- Producing proofs of unsatisfiability with distributed clause-sharing SAT solvers
- Certifying phase abstraction
- A verified algorithm for deciding pattern completeness with optimal asymptotic complexity
- PACE solver description: shadoks approach to minimum hitting set and dominating set
Describes a project that uses
Uses Software
This page was built for publication: SAT competition 2020
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2060693)
