Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming
Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming
复制标题
逻辑编程中并行推导策略的代数语义
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
J. Power
中科院分区：
文献类型：
--
作者：
Ekaterina Komendantskaya;G. McCusker;J. Power
逻辑编程是一种基于一阶逻辑的一类编程语言，为面向目标的证明搜索提供了简单有效的工具。逻辑编程支持递归计算，一些逻辑程序类似于用功能编程语言编写的归纳或共同传感定义。在本文中，我们为逻辑编程提供了煤层语义。我们表明，地面逻辑程序可以通过set上的PFPF -Coalgebras或PF ListCoalgebras建模。我们分析了逻辑编程中使用的不同种类的推导策略和衍生树（验证树，SLD-Trees和 - 或平行树），并展示如何通过煤层建模它们。
Logic programming, a class of programming languages based on first-order logic, provides simple and efficient tools for goal-oriented proof-search. Logic programming supports recursive computations, and some logic programs resemble the inductive or coinductive definitions written in functional programming languages. In this paper, we give a coalgebraic semantics to logic programming. We show that ground logic programs can be modelled by either PfPf -coalgebras or Pf Listcoalgebras on Set. We analyse different kinds of derivation strategies and derivation trees (proof-trees, SLD-trees, and-or parallel trees) used in logic programming, and show how they can be modelled coalgebraically.