Understanding and Extending Incremental Determinization for 2QBF
Logic in Computer Science
2019-06-03 v1 Formal Languages and Automata Theory
Programming Languages
Abstract
Incremental determinization is a recently proposed algorithm for solving quantified Boolean formulas with one quantifier alternation. In this paper, we formalize incremental determinization as a set of inference rules to help understand the design space of similar algorithms. We then present additional inference rules that extend incremental determinization in two ways. The first extension integrates the popular CEGAR principle and the second extension allows us to analyze different cases in isolation. The experimental evaluation demonstrates that the extensions significantly improve the performance.
Cite
@article{arxiv.1905.13411,
title = {Understanding and Extending Incremental Determinization for 2QBF},
author = {Markus N. Rabe and Leander Tentrup and Cameron Rasmussen and Sanjit A. Seshia},
journal= {arXiv preprint arXiv:1905.13411},
year = {2019}
}