Knowledge compilation produces normal forms for alternating safety automata that support uniform, efficient projection for both existential and universal quantifiers, enabling quantifier elimination without complementation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Knowledge Compilation for Quantification in Alternating Automata
Knowledge compilation produces normal forms for alternating safety automata that support uniform, efficient projection for both existential and universal quantifiers, enabling quantifier elimination without complementation.