首页> 外文会议>International Workshop on Functional and Constraint Logic Programming >Transpiling Programming Computable Functions to Answer Set Programs
【24h】

Transpiling Programming Computable Functions to Answer Set Programs

机译:编译编程可计算函数以答案集程序

获取原文

摘要

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.
机译:编程可计算函数(PCF)是一种提供的简化编程语言。现代函数式编程语言的理论基础。答案集编程(ASP)是一种专注于解决搜索问题的编程范例。在本文中,我们提供了从PCF到ASP的翻译。使用此翻译,可以使用PCF指定搜索问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号