Logical Algorithms
Logical Algorithms
复制标题
逻辑算法
DOI：
--
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
David A. McAllester
中科院分区：
文献类型：
--
作者：
H. Ganzinger;David A. McAllester
人们普遍认为，许多算法可以简洁、清晰地表达为逻辑推理规则。然而，逻辑编程一直不适合研究算法的运行时间，因为逻辑程序的运行时间还没有一个清晰而精确的模型。我们提出了一种适用于研究各种算法的运行时间的逻辑编程计算模型。
It is widely accepted that many algorithms can be concisely and clearly expressed as logical inference rules. However, logic programming has been inappropriate for the study of the running time of algorithms because there has not been a clear and precise model of the run time of a logic program. We present a logic programming model of computation appropriate for the study of the run time of a wide variety of algorithms.