2019/09/19 by Sarat Chandra Varanasi
Computer Science · #cs.LO #cs.SC
paper · pdf · doi:10.4204/eptcs.306.55
published as EPTCS 306, 2019, pp. 413-417 · In Proceedings ICLP 2019, arXiv:1909.07646
arxiv created 2019/09/19 · arxiv updated 2019/09/20
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.