On QBF Proofs and Preprocessing

DOI10.1007/978-3-642-45221-5_32zbMath1407.68454arXiv1310.2491OpenAlexW53088276MaRDI QIDQ2870148

Radu Grigore, Mikoláš Janota, João P. Marques-Silva

Publication date: 17 January 2014

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.2491

Mathematics Subject Classification ID

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

Related Items (5)

Quantified maximum satisfiability ⋮ Solution validation and extraction for QBF preprocessing ⋮ Conformant planning as a case study of incremental QBF solving ⋮ Incremental Determinization ⋮ CAQE and QuAbS: Abstraction Based QBF Solvers

Uses Software

• NiVER
• sQueezeBF
• Bloqqer
• Nenofex

This page was built for publication: On QBF Proofs and Preprocessing