Imperative Program Synthesis from Answer Set Programs
Sarat Chandra Varanasi

TL;DR
This paper explores a novel method for synthesizing imperative programs from Answer Set Programming specifications, leveraging negation-as-failure to transform declarative specifications into executable imperative code.
Contribution
It introduces a new approach to generate imperative programs from ASP specifications by converting negation into computational steps, enabling program synthesis from declarative sources.
Findings
Proposed a method to translate ASP negation into imperative computations
Demonstrated the feasibility of synthesizing imperative code from declarative specs
Opened a new pathway for program synthesis from executable specifications
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Multi-Agent Systems and Negotiation · Logic, programming, and type systems
