Skip to main content
Conference Proceedings

Transpiling Programming Computable Functions to Answer Set Programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2019) 11285 LNCS 3-17
DOI: 10.1007/978-3-030-16202-3_1
0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Dasseville, I., & Denecker, M. (2019). Transpiling Programming Computable Functions to Answer Set Programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11285 LNCS, pp. 3–17). Springer Verlag. https://doi.org/10.1007/978-3-030-16202-3_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free