Transpiling Programmable Computable Functions to Answer Set Programs

2018/08/23 by Ingmar Dasseville, Dasseville, Ingmar, Marc Denecker +1
Computer Science · #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Programming Languages (cs.PL) #Semantic Web and Ontologies

paper · pdf · doi:10.48550/arxiv.1808.07770

openalex publication_date 2018/08/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Propositional satisfiability in declarative programming
• Interactive Answer Set Programming - Preliminary Report
• Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), 5th International Workshop, September 4, 2012, Budapest, Hungary
• FMS: Functional Programming as a Modelling Language
• aspps --- an implementation of answer-set programming with propositional schemata