Imperative Program Synthesis from Answer Set Programs
SC Varanasi�- arXiv preprint arXiv:1909.09058, 2019 - arxiv.org
arXiv preprint arXiv:1909.09058, 2019•arxiv.org
Our research concerns generating imperative programs from Answer Set Programming
Specifications. ASP is highly declarative and is ideal for writing specifications. Further with
negation-as-failure it is easy to succinctly represent combinatorial search problems. We are
currently working on synthesizing imperative programs from ASP programs by turning the
negation into useful computations. This opens up a novel way to synthesize programs from
executable specifications.
Specifications. ASP is highly declarative and is ideal for writing specifications. Further with
negation-as-failure it is easy to succinctly represent combinatorial search problems. We are
currently working on synthesizing imperative programs from ASP programs by turning the
negation into useful computations. This opens up a novel way to synthesize programs from
executable specifications.
Our research concerns generating imperative programs from Answer Set Programming Specifications. ASP is highly declarative and is ideal for writing specifications. Further with negation-as-failure it is easy to succinctly represent combinatorial search problems. We are currently working on synthesizing imperative programs from ASP programs by turning the negation into useful computations. This opens up a novel way to synthesize programs from executable specifications.
arxiv.org