Quantifier elimination by Dependency Sequents

We consider the problem of existential quantifier elimination for Boolean CNF formulas. We present a new method for solving this problem called Derivation of Dependency-Sequents (DDS). A Dependency-sequent (D-sequent) is used to record that a set of quantified variables is redundant under a partial...

Full description

Saved in:
Bibliographic Details
Published in2012 Formal Methods in Computer-Aided Design (FMCAD) pp. 34 - 43
Main Authors Goldberg, E., Manolios, P.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2012
Subjects
Algorithm design and analysis
Design automation
Hardware
Merging
Optimization
Redundancy
Semantics
Online AccessGet full text

Cover

More Information
Summary:We consider the problem of existential quantifier elimination for Boolean CNF formulas. We present a new method for solving this problem called Derivation of Dependency-Sequents (DDS). A Dependency-sequent (D-sequent) is used to record that a set of quantified variables is redundant under a partial assignment. We introduce the join operation that produces new D-sequents from existing ones. We show that DDS is compositional, i.e., if our input formula is a conjunction of independent formulas, DDS automatically recognizes and exploits this information. We introduce an algorithm based on DDS and present experimental results demonstrating its potential.
ISBN:1467348325
9781467348324