Work

Transpiling Programmable Computable Functions to Answer Set Programs

Year: 2018

Type: preprint

Abstract: 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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1808.07770

Authors: Dasseville, Ingmar, Denecker, Marc

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2951623552

Cites: 12

Cited by:

Related to: 10