Computing resolution-path dependencies in linear time ,

Authors:
Friedrich Slivovsky;Stefan Szeider
Affiliations:
Institute of Information Systems, Vienna University of Technology, Vienna, Austria;Institute of Information Systems, Vienna University of Technology, Vienna, Austria
Venue:
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Year:
2012

Citing 11
Cited 0

Resolution for quantified Boolean formulas

Information and Computation
Propositional Logic: Deduction and Algorithms

Propositional Logic: Deduction and Algorithms
QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Variable Dependencies of Quantified CSPs

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Backdoor Sets of Quantified Boolean Formulas

Journal of Automated Reasoning
A Compact Representation for Syntactic Dependencies in QBFs

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Bounded universal expansion for preprocessing QBF

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Variable independence and resolution paths for quantified boolean formulas

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Resolve and expand

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Integrating dependency schemes in search-based QBF solvers

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The alternation of existential and universal quantifiers in a quantified boolean formula (QBF) generates dependencies among variables that must be respected when evaluating the formula. Dependency schemes provide a general framework for representing such dependencies. Since it is generally intractable to determine dependencies exactly, a set of potential dependencies is computed instead, which may include false positives. Among the schemes proposed so far, resolution path dependencies introduce the fewest spurious dependencies. In this work, we describe an algorithm that detects resolution-path dependencies in linear time, resolving a problem posed by Van Gelder (CP 2011).