Introduces parallelizable, theory-agnostic methods for complete theory-lemma enumeration in SMT that scale better than classic eager encodings on complex instances.
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
-
Beyond Eager Encodings: A Theory-Agnostic Approach to Theory-Lemma Enumeration in SMT
Introduces parallelizable, theory-agnostic methods for complete theory-lemma enumeration in SMT that scale better than classic eager encodings on complex instances.