New approaches to boolean quantifier elimination

Authors:
Christoph Zengler;Andreas Kübler;Wolfgang Küchlin
Affiliations:
University of Tübingen, Tübingen, Germany;University of Tübingen, Tübingen, Germany;University of Tübingen, Tübingen, Germany
Venue:
ACM Communications in Computer Algebra
Year:
2011

Citing 3
Cited 0

Decomposable negation normal form

Journal of the ACM (JACM)
Solution Enumeration for Projected Boolean Search Problems

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Resolve and expand

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present four different approaches for existential Boolean quantifier elimination, based on model enumeration, resolution, knowledge compilation with projection, and substitution. We point out possible applications in the area of verification and we present preliminary benchmark results of the different approaches.