2015 | OriginalPaper | Chapter
Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances
Authors : Ravi Mangal, Xin Zhang, Aditya V. Nori, Mayur Naik
Published in: Theory and Applications of Satisfiability Testing -- SAT 2015
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Very large MaxSAT instances, comprising 10
20
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.