Imperative Program Synthesis from Answer Set Programs

09/19/2019
by   Sarat Chandra Varanasi, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/12/2020

Pointer Data Structure Synthesis from Answer Set Programming Specifications

We develop an inductive proof-technique to generate imperative programs ...
research
07/07/2002

Abduction, ASP and Open Logic Programs

Open logic programs and open entailment have been recently proposed as a...
research
02/18/2018

Heuristic Based Induction of Answer Set Programs: From Default theories to combinatorial problems

Significant research has been conducted in recent years to extend Induct...
research
05/08/2019

Discovering and Proving Invariants in Answer Set Programming and Planning

Answer set programming (ASP) and planning are two widely used paradigms ...
research
12/03/2010

Using ASP with recent extensions for causal explanations

We examine the practicality for a user of using Answer Set Programming (...
research
11/11/2020

GRCNN: Graph Recognition Convolutional Neural Network for Synthesizing Programs from Flow Charts

Program synthesis is the task to automatically generate programs based o...
research
08/29/2011

Nested HEX-Programs

Answer-Set Programming (ASP) is an established declarative programming p...

Please sign up or login with your details

Forgot password? Click here to reset