Partial quantifier elimination enables structure-aware computing for three verification problems and can itself benefit from SAT-based structure-aware techniques.
Existential quantification as incremental sat
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Structure-Aware Computing, Partial Quantifier Elimination And SAT
Partial quantifier elimination enables structure-aware computing for three verification problems and can itself benefit from SAT-based structure-aware techniques.