SAT Competition 2018

Issue title: SAT 2018 Competitions and Evaluations

Guest editors: Martina Seidl and Luca Pulina

Article type: Research Article

Authors: Heule, Marijn J. H.^{a; *} | Järvisalo, Matti^{b; **} | Suda, Martin^{c; ***}

Affiliations: [a] Computer Science Department, Carnegie Mellon University, Pittsburgh, United States. E-mail: [email protected] | [b] HIIT, Department of Computer Science, University of Helsinki, Finland. E-mail: [email protected] | [c] Czech Institute of Informatics, Robotics, and Cybernetics, Czech Technical University in Prague, Czech Republic. E-mail: [email protected]

Note: [*] Supported by the National Science Foundation (NSF) under grant CCF-1813993.

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

Note: [***] Supported by the ERC Consolidator grant AI4REASON 649043, ERC Starting grant SYMCAR 639270, and the Austrian research project FWF S11409-N23.

Keywords: SAT, Boolean satisfiability, empirical evaluation, solvers, benchmarks

DOI: 10.3233/SAT190120

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