Quantified maximum satisfiability: a core-guided approach

DOI10.1007/978-3-642-39071-5_19zbMATH Open1390.68598OpenAlexW2221194109MaRDI QIDQ5326468FDOQ5326468

Authors: A. A. Ignatiev, Mikoláš Janota, Joao Marques-Silva 

Publication date: 5 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39071-5_19

Recommendations

• Quantified maximum satisfiability
• Iterative and core-guided maxsat solving: a survey and assessment
• Improvements to core-guided binary search for MaxSAT
• Generalizing Core-Guided Max-SAT
• Query-guided maximum satisfiability

Mathematics Subject Classification ID

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

Cited In (7)

• Solving QBF with counterexample guided refinement
• SAT-Based Formula Simplification
• Quantified maximum satisfiability
• Computing generating sets of minimal size in finite algebras
• Query-guided maximum satisfiability
• Generalizing Core-Guided Max-SAT
• Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API

This page was built for publication: Quantified maximum satisfiability: a core-guided approach

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