Sciweavers

Share
SAT
2015
Springer

Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances

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, lazy grounding approach. In each iteration, VOLT grounds a subset of clauses in the MaxSAT problem, and solves it using an off-the-shelf MaxSAT solver. VOLT provides a common ground to compare and contrast different lazy grounding approaches for solving large MaxSAT instances. We cast four diverse approaches from the literature on information retrieval and program analysis as instances of VOLT. We have implemented VOLT and evaluate its performance under different state-of-the-art MaxSAT solvers.
Ravi Mangal, Xin Zhang, Aditya V. Nori, Mayur Naik
Added 17 Apr 2016
Updated 17 Apr 2016
Type Journal
Year 2015
Where SAT
Authors Ravi Mangal, Xin Zhang, Aditya V. Nori, Mayur Naik
Comments (0)
books