Overview and analysis of the SAT Challenge 2012 solver competition

, , &
Artificial Intelligence 223 (C):120-155 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2015.01.002

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,612

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

The Configurable SAT Solver Challenge.Frank Hutter, Marius Lindauer, Adrian Balint, Sam Bayless, Holger Hoos & Kevin Leyton-Brown - 2017 - Artificial Intelligence 243 (C):1-25.
SAT Competition 2020.Nils Froleyks, Marijn Heule, Markus Iser, Matti Järvisalo & Martin Suda - 2021 - Artificial Intelligence 301 (C):103572.
New width parameters for SAT and #SAT.Robert Ganian & Stefan Szeider - 2021 - Artificial Intelligence 295 (C):103460.
A Different Approach for Clique and Household Analysis in Synthetic Telecom Data Using Propositional Logic.Sandro Skansi, Kristina Šekrst & Marko Kardum - 2020 - In Marko Koričić (ed.), 2020 43rd International Convention on Information, Communication and Electronic Technology (MIPRO). IEEE Explore. pp. 1286-1289.
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving.Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes P. Wallner & Stefan Woltran - 2022 - Artificial Intelligence 307 (C):103697.
CROSS cyclic resource-constrained scheduling solver.Alessio Bonfietti, Michele Lombardi, Luca Benini & Michela Milano - 2014 - Artificial Intelligence 206 (C):25-52.
The multi-engine asp solver me-asp.Marco Maratea, Luca Pulina & Francesco Ricca - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 484--487.
Resolution for Max-SAT.María Luisa Bonet, Jordi Levy & Felip Manyà - 2007 - Artificial Intelligence 171 (8-9):606-618.
SAT Race 2015.Tomáš Balyo, Armin Biere, Markus Iser & Carsten Sinz - 2016 - Artificial Intelligence 241 (C):45-65.
Treewidth-aware reductions of normal ASP to SAT – Is normal ASP harder than SAT after all?Markus Hecher - 2022 - Artificial Intelligence 304 (C):103651.

Analytics

Added to PP
2020-12-22

Downloads
5 (#1,559,732)

6 months
2 (#1,445,320)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

SAT Competition 2020.Nils Froleyks, Marijn Heule, Markus Iser, Matti Järvisalo & Martin Suda - 2021 - Artificial Intelligence 301 (C):103572.

Add more citations

References found in this work

Planning as satisfiability: Heuristics.Jussi Rintanen - 2012 - Artificial Intelligence 193 (C):45-86.

View all 6 references / Add more references