The \textsc{MergeSat} solver
From MaRDI portal
Publication:2118329
DOI10.1007/978-3-030-80223-3_27OpenAlexW3184772779MaRDI QIDQ2118329
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-80223-3_27
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
Related Items
Uses Software
Cites Work
- Unnamed Item
- SAT race 2015
- Paracooba
- Kissat
- Chronological backtracking
- Speeding up assumption-based SAT
- Trail saving on backtrack
- Improving implementation of SAT competitions 2017--2019 winners
- SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
- Empirical Study of the Anatomy of Modern Sat Solvers
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Open-WBO: A Modular MaxSAT Solver,
- HordeSat: A Massively Parallel Portfolio SAT Solver
- Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
- ParamILS: An Automatic Algorithm Configuration Framework
- Improving Resource-Unaware SAT Solvers
- Tools and Algorithms for the Construction and Analysis of Systems
- Theory and Applications of Satisfiability Testing
- Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction