Transpiling Programmable Computable Functions to Answer Set Programs
Ingmar Dasseville, Marc Denecker
TL;DR
This paper presents a translation method from PCF, a foundational functional programming language, to ASP, enabling the specification of search problems within PCF's framework.
Contribution
It introduces a novel translation from PCF to ASP, bridging functional programming and answer set programming for search problem specification.
Findings
Enables specifying search problems using PCF.
Provides a formal translation from PCF to ASP.
Facilitates leveraging ASP solvers for PCF-based problems.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Logic, programming, and type systems · Semantic Web and Ontologies