Year: 2019
Type: preprint
Abstract: The aim of this PhD project is to develop fast and robust reasoning tools for dependency quantified Boolean formulas (DQBF). In this paper, we outline two properties, autarkies and symmetries, that potentially can be exploited for pre- and in-processing in the DQBF solving process. DQBF extend quantified Boolean formulas (QBF) with non-linear dependencies between the quantified variables. Automated testing and debugging techniques are an essential part of the solvers tool-chain. For rigorous DQBF solver development, we are working on novel automated testing and debugging techniques as successfully established in SAT and QBF solving. The tool is under development.
Source: arXiv (Cornell University)
Author: Shukla, Ankit
Institution: Johannes Kepler University of Linz
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2978616699