Skip to content
naulon
Not checkedNot checked for notices yet.

Imperative Program Synthesis from Answer Set Programs

Sarat Chandra Varanasi

Electronic Proceedings in Theoretical Computer Science · 2019

doi:10.4204/eptcs.306.55 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

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.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.