A refined superposition calculus is sound and complete for synthesizing recursion-free programs under realizability assumptions if a computable solution exists.
In: Robinson, A., Voronkov, A
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 2years
2026 2roles
background 1polarities
support 1representative citing papers
SCAN algorithm extended to compute witnesses for second-order quantifiers alongside quantifier elimination on clause sets.
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.
-
Computing Witnesses Using the SCAN Algorithm
SCAN algorithm extended to compute witnesses for second-order quantifiers alongside quantifier elimination on clause sets.