preprint
وصول مفتوح
Imperative Program Synthesis from Answer Set Programs
Research footprint
At a glance
- الاستشهادات
- 0
- المراجع
- 0
- Comments
- 0
Paper overview
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.
Record transparency
Publication details
- DOI
- 10.48550/arxiv.1909.09058
- OpenAlex
- W2982487535
- Document type
- preprint
- Language
- EN
- Source
- arXiv (Cornell University)
- Last metadata update
Comments
تسجيل الدخول للانضمام إلى النقاش.