These are the slides for the paper "A Comprehensive Study of k-Portfolios of Recent SAT Solvers", presented at the conference [*SAT 2022*](http://satisfiability.org/SAT22/). You can find the paper [here](https://www.doi.org/10.4230/LIPIcs.SAT.2022.2)
Abstract. In recent years, portfolio approaches to solving SAT prob-lems and CSPs have become increa...
Abstract—This paper provides a short system description of our updated portfolio-based solver called...
Designing high-performance solvers for computationally hard problems is a difficult and often time...
Hard combinatorial problems such as propositional satisfiability are ubiquitous. The holy grail are ...
It has been widely observed that there is no single “dominant ” SAT solver; instead, different solve...
Nguyen Dang: is a Leverhulme Early Career Fellow.Competitions such as the MiniZinc Challenges or the...
The SAT Competitions constitute a well-established series of yearly open international algorithm imp...
Revised Selected PapersInternational audienceFor the third consecutive year, a SAT competition was o...
Data for the article Janne I. Kokkala, Jakob Nordström: Using Resolution Proofs to Analyse CDCL SAT ...
The success of portfolio approaches in SAT solving relies on the observation that different SAT solv...
In practical applications, some important classes of problems are NP-complete. Although no worst-cas...
Abstract. Recent research in areas such as SAT solving and Integer Linear Programming has shown that...
This thesis focuses on improving the SAT solving technology. The improvements focus on two major sub...
The success of portfolio approaches in SAT solving relies on the observation that different SAT solv...
Abstract. In recent years, portfolio approaches to solving SAT prob-lems and CSPs have become increa...
Abstract. In recent years, portfolio approaches to solving SAT prob-lems and CSPs have become increa...
Abstract—This paper provides a short system description of our updated portfolio-based solver called...
Designing high-performance solvers for computationally hard problems is a difficult and often time...
Hard combinatorial problems such as propositional satisfiability are ubiquitous. The holy grail are ...
It has been widely observed that there is no single “dominant ” SAT solver; instead, different solve...
Nguyen Dang: is a Leverhulme Early Career Fellow.Competitions such as the MiniZinc Challenges or the...
The SAT Competitions constitute a well-established series of yearly open international algorithm imp...
Revised Selected PapersInternational audienceFor the third consecutive year, a SAT competition was o...
Data for the article Janne I. Kokkala, Jakob Nordström: Using Resolution Proofs to Analyse CDCL SAT ...
The success of portfolio approaches in SAT solving relies on the observation that different SAT solv...
In practical applications, some important classes of problems are NP-complete. Although no worst-cas...
Abstract. Recent research in areas such as SAT solving and Integer Linear Programming has shown that...
This thesis focuses on improving the SAT solving technology. The improvements focus on two major sub...
The success of portfolio approaches in SAT solving relies on the observation that different SAT solv...
Abstract. In recent years, portfolio approaches to solving SAT prob-lems and CSPs have become increa...
Abstract. In recent years, portfolio approaches to solving SAT prob-lems and CSPs have become increa...
Abstract—This paper provides a short system description of our updated portfolio-based solver called...
Designing high-performance solvers for computationally hard problems is a difficult and often time...
DOI
Add to ORKG