You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

MaxSAT Evaluation 2018: New Developments and Detailed Results

Issue title: SAT 2018 Competitions and Evaluations

Guest editors: Martina Seidl and Luca Pulina

Article type: Research Article

Authors: Bacchus, Fahiema | Järvisalo, Mattib; * | Martins, Rubenc; **

Affiliations: [a] Department of Computer Science, University of Toronto, Canada. E-mail: [email protected] | [b] HIIT, Department of Computer Science, University of Helsinki, Finland. E-mail: [email protected] | [c] Department of Computer Science, Carnegie Mellon University, USA. E-mail: [email protected]

Note: [*] Financially supported by Academy of Finland (grants 276412 and 312662).

Note: [**] Financially supported by NSF (grant 1762363) and CMU-Portugal (grant CMU/AIR/0022/2017).

Keywords: MaxSAT, maximum satisfiability, empirical evaluation, solvers, benchmarks

DOI: 10.3233/SAT190119

Journal: Journal on Satisfiability, Boolean Modeling and Computation, vol. 11, no. 1, pp. 99-131, 2019

Received 1 November 2018
|
Revision received 1 March 2019
|
Published: 1 September 2019
Get PDF open access

Abstract

The series of MaxSAT Evaluations, organized yearly since 2006, has been the main forum for evaluating the state of the art in solvers for the Boolean optimization paradigm of maximum satisfiability (MaxSAT). This article provides an overview of the 2018 MaxSAT Evaluation, including a description of the main changes made in 2017 under a new organizing team, an overview of the solvers and benchmarks submitted in 2018, and detailed results of the 2018 evaluation.

Show more