QRATPre+: effective QBF preprocessing via strong redundancy properties

DOI10.1007/978-3-030-24258-9_14zbMath1441.68229arXiv1904.12927OpenAlexW3103634278MaRDI QIDQ2181932

Uwe Egly, Florian Lonsing

Publication date: 20 May 2020

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

Mathematics Subject Classification ID

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

Related Items (3)

Truth Assignments as Conditional Autarkies ⋮ Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations ⋮ Planning with Incomplete Information in Quantified Answer Set Programming

Uses Software

• QRATPre+

This page was built for publication: QRATPre+: effective QBF preprocessing via strong redundancy properties