BibTeX
CSL-JSON
MLA
Harvard
Imperative Program Synthesis from Answer Set Programs
release_2bvdhciyvfblfodk2fhzymdymu
by
Sarat Chandra Varanasi
Released
as a article
.
2019
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.
In text/plain
format
Archived Files and Locations
application/pdf 83.4 kB
file_nwinkffxqfhdtac2frnobbjghy
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1909.09058v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links