Transpiling Programmable Computable Functions to Answer Set Programs

08/23/2018
by   Ingmar Dasseville, et al.
0

Programming Computable Functions (PCF) is a simplified programming language which provides the theoretical basis of modern functional programming languages. Answer set programming (ASP) is a programming paradigm focused on solving search problems. In this paper we provide a translation from PCF to ASP. Using this translation it becomes possible to specify search problems using PCF.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/20/2011

Translation-based Constraint Answer Set Solving

We solve constraint satisfaction problems through translation to answer ...
research
02/19/2022

ValAsp: a tool for data validation in Answer Set Programming

The development of complex software requires tools promoting fail-fast a...
research
08/18/2011

Solving puzzles described in English by automated translation to answer set programming and learning how to do that translation

We present a system capable of automatically solving combinatorial logic...
research
08/05/2022

A Preliminary Data-driven Analysis of Common Errors Encountered by Novice SPARC Programmers

Answer Set Programming (ASP), a modern development of Logic Programming,...
research
12/05/2011

Extending Object-Oriented Languages by Declarative Specifications of Complex Objects using Answer-Set Programming

Many applications require complexly structured data objects. Developing ...
research
01/14/2022

Specifying and Reasoning about CPS through the Lens of the NIST CPS Framework

This paper introduces a formal definition of a Cyber-Physical System (CP...
research
08/23/2018

FMS: Functional Programming as a Modelling Language

In this paper we introduce the Functional Modelling System (FMS). The sy...

Please sign up or login with your details

Forgot password? Click here to reset