Imperative Program Synthesis from Answer Set Programs
Symbolic Computation
2019-09-20 v1 Logic in Computer Science
Abstract
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.
Cite
@article{arxiv.1909.09058,
title = {Imperative Program Synthesis from Answer Set Programs},
author = {Sarat Chandra Varanasi},
journal= {arXiv preprint arXiv:1909.09058},
year = {2019}
}
Comments
In Proceedings ICLP 2019, arXiv:1909.07646