A refined superposition calculus is sound and complete for synthesizing recursion-free programs under realizability assumptions if a computable solution exists.
It follows trivially for D ▽ LL, too and we set tL∨L = tL
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Completeness of Synthesis under Realizability Assumptions using Superposition
A refined superposition calculus is sound and complete for synthesizing recursion-free programs under realizability assumptions if a computable solution exists.