SYNASP – Synthesizing Answer Set Programs

Prototypical implementation of the approach described in Jan Heuer and Christoph Wernhard: Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic, preprint http://arxiv.org/abs/2402.07696, 2024.

Runs in the PIE (Proving, Interpolating, Eliminating) environment embedded in SWI-Prolog. Also requires Prover9.


Contact: info@christophwernhard.com