Introduces parallelizable, theory-agnostic methods for complete theory-lemma enumeration in SMT that scale better than classic eager encodings on complex instances.
J Artif Intell Res17(1), 229–264 (2002)
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
years
2026 4representative citing papers
Quokka# is a Python library that converts quantum circuit analysis tasks into #SAT problems, offering multiple encodings, approximate equivalence checking, and depth-optimal synthesis.
The thesis proposes specialized algebraic, logical, and geometric methods to enable scalable reasoning over imprecise attributes, probabilistic triples, and incomplete schemas in knowledge graphs.
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.
-
Quokka#: Quantum Computing with #SAT
Quokka# is a Python library that converts quantum circuit analysis tasks into #SAT problems, offering multiple encodings, approximate equivalence checking, and depth-optimal synthesis.
-
Scalable Uncertainty Reasoning in Knowledge Graphs
The thesis proposes specialized algebraic, logical, and geometric methods to enable scalable reasoning over imprecise attributes, probabilistic triples, and incomplete schemas in knowledge graphs.
- d-DNNF Modulo Theories: A General Framework for Polytime SMT Queries