Quantified Maximum Satisfiability:

DOI10.1007/978-3-642-39071-5_19zbMath1390.68598OpenAlexW2221194109MaRDI QIDQ5326468

Mikoláš Janota, Alexey Ignatiev, João P. 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

Mathematics Subject Classification ID

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

Related Items (5)

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

This page was built for publication: Quantified Maximum Satisfiability: