5 citations · 6 across the 7 of their papers we have counts for
3 papers · 1 filter
UpMax: User partitioning for MaxSAT
Pedro Orvalho, Vasco Manquinho, Ruben Martins
It has been shown that Maximum Satisfiability (MaxSAT) problem instances can be effectively solved by partitioning the set of soft clauses into several disjoint sets. The partition…
Relating Complexity-theoretic Parameters with SAT Solver Performance
Edward Zulkoski, Ruben Martins, Christoph Wintersteiger +4
Over the years complexity theorists have proposed many structural parameters to explain the surprising efficiency of conflict-driven clause-learning (CDCL) SAT solvers on a wide va…
Exploiting Resolution-based Representations for MaxSAT Solving
Miguel Neves, Ruben Martins, Mikoláš Janota +2
Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver in order to find an optimal solution. In particular, several algorithms take advantage of the ability of…