Sciweavers

Share
SAT
2015
Springer
44views Hardware» more  SAT 2015»
3 years 7 months ago
Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances
Very large MaxSAT instances, comprising 1020 clauses and beyond, commonly arise in a variety of domains. We present VOLT, a framework for solving such instances, using an iterative...
Ravi Mangal, Xin Zhang, Aditya V. Nori, Mayur Naik
SAT
2015
Springer
23views Hardware» more  SAT 2015»
3 years 7 months ago
Mining Backbone Literals in Incremental SAT - A New Kind of Incremental Data
Abstract. In incremental SAT solving, information gained from previous similar instances has so far been limited to learned clauses that are still relevant, and heuristic informati...
Alexander Ivrii, Vadim Ryvchin, Ofer Strichman
SAT
2015
Springer
35views Hardware» more  SAT 2015»
3 years 7 months ago
SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers
In this paper, we present SATGraf, a tool for visualizing the evolution of the structure of a Boolean SAT formula in real time as it is being processed by a conflict-driven clause...
Zack Newsham, William Lindsay, Vijay Ganesh, Jia H...
SAT
2015
Springer
38views Hardware» more  SAT 2015»
3 years 7 months ago
Evaluating CDCL Variable Scoring Schemes
Abstract. The VSIDS (variable state independent decaying sum) decision heuristic invented in the context of the CDCL (conflict-driven clause learning) SAT solver Chaff, is consid...
Armin Biere, Andreas Fröhlich
SAT
2015
Springer
21views Hardware» more  SAT 2015»
3 years 7 months ago
HordeSat: A Massively Parallel Portfolio SAT Solver
A simple yet successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio of) SAT solvers on the input problem at the same time until one...
Tomas Balyo, Peter Sanders, Carsten Sinz
SAT
2015
Springer
24views Hardware» more  SAT 2015»
3 years 7 months ago
Search-Space Partitioning for Parallelizing SMT Solvers
Antti E. J. Hyvärinen, Matteo Marescotti, Nat...
books