SAT competition 2020
From MaRDI portal
Publication:2060693
DOI10.1016/j.artint.2021.103572zbMath1478.68320OpenAlexW3193251185MaRDI QIDQ2060693
Nils Froleyks, Marijn J. H. Heule, Markus Iser, Matti Järvisalo, Martin Suda
Publication date: 13 December 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2021.103572
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
Related Items
Eliminating models during model elimination, 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, SAT competition 2020, Hard satisfiable 3-SAT instances via autocorrelation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SAT race 2015
- Chronological backtracking
- SAT competition 2020
- Scalable SAT solving in the cloud
- Incremental inprocessing in SAT solving
- CrystalBall: gazing in the black box of SAT solving
- Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
- Clause vivification by unit propagation in CDCL SAT solvers
- Planning as satisfiability: parallel plans and algorithms for plan search
- 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. Proceedings
- Trail saving on backtrack
- Designing new phase selection heuristics
- Improved Static Symmetry Breaking for SAT
- Learning Rate Based Branching Heuristic for SAT Solvers
- Lazy Clause Exchange Policy for Parallel SAT Solvers
- Ultimately Incremental SAT
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Truth Assignments as Conditional Autarkies
- PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF
- HordeSat: A Massively Parallel Portfolio SAT Solver
- Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
- Algorithms for computing backbones of propositional formulae
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Concurrent Clause Strengthening
- Determining computational complexity from characteristic ‘phase transitions’
- Theory and Applications of Satisfiability Testing
- Computer Aided Verification
