Volt: a lazy grounding framework for solving very large MaxSAT instances

DOI10.1007/978-3-319-24318-4_22MaRDI QIDQ3453234zbMATH OpenOpenAlexFDO

Authors Ravi Mangal, Xin Zhang, Aditya V. Nori, Mayur Naik

Publication date 20 November 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-24318-4_22

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Maximum satisfiability in software analysis: applications and techniques
• A logical approach to efficient Max-SAT solving
• A modular approach to MaxSAT modulo theories
• Degrees of laziness in grounding. Effects of lazy-grounding strategies on ASP solving
• An efficient solver for weighted Max-SAT

Cites work

• CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
• Complexity results for classes of quantificational formulas
• Cores in core based MaxSat algorithms: an analysis
• Counterexample-guided abstraction refinement for symbolic model checking

Cited in

(1)

• Maximum satisfiability of mission-time linear temporal logic

Describes a project that uses

Uses Software

• VOLT
• MiFuMax
• Tuffy
• RockIt
• DaCapo
• Alchemy
• CCLS
• MaxHS

This page was built for publication: Volt: a lazy grounding framework for solving very large MaxSAT instances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453234)