RC2: an Efficient MaxSAT Solver

  • Ignatiev A
  • Morgado A
  • Marques-Silva J
N/ACitations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

Recent work proposed a toolkit PySAT aiming at fast and easy prototyping with propo-sitional satisfiability (SAT) oracles in Python, which enabled one to exploit the power of the original implementations of the state-of-the-art SAT solvers in Python. Maximum sat-isfiability (MaxSAT) is a well-known optimization version of SAT, which can be solved with a series of calls to a SAT oracle. Based on this fact and motivated by the ideas underlying the PySAT toolkit, this paper describes and evaluates RC2 (stands for relaxable cardinality constraints), a new core-guided MaxSAT solver written in Python, which won both unweighted and weighted categories of the main track of MaxSAT Evaluation 2018.

Cite

CITATION STYLE

APA

Ignatiev, A., Morgado, A., & Marques-Silva, J. (2019). RC2: an Efficient MaxSAT Solver. Journal on Satisfiability, Boolean Modeling and Computation, 11(1), 53–64. https://doi.org/10.3233/sat190116

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free