论文标题
（完整的）约束逻辑编程的理论研究
A Theoretical Study of (Full) Tabled Constraint Logic Programming
论文作者
论文摘要
具有表格和约束（TCLP，表格约束逻辑编程）的逻辑编程已被证明具有更大的表现力，在某些情况下，比LP，CLP或LP更有效。在本文中，我们提供了有关完整TCLP上自上而下的执行策略的语义，正确性，完整性和终止的见解，即TCLP，具有呼叫和答案中的需要检查的TCLP。我们为TCLP提供了自上而下的语义，并表明它等同于FixPoint语义。我们研究程序生成的约束如何有效地影响终止，即使对于不紧凑的约束类别，可以推广以前的结果。我们还介绍了约束投影的不同变体如何影响TCLP实现的正确性和完整性。所有提出的特征均在MOD TCLP中实现（或可以进行实验），Mod TCLP是一个模块化约束逻辑编程的模块化框架，是CIAO Prolog逻辑编程系统的一部分。
Logic programming with tabling and constraints (TCLP, tabled constraint logic programming) has been shown to be more expressive and, in some cases, more efficient than LP, CLP, or LP with tabling. In this paper we provide insights regarding the semantics, correctness, completeness, and termination of top-down execution strategies for full TCLP, i.e., TCLP featuring entailment checking in the calls and in the answers. We present a top-down semantics for TCLP and show that it is equivalent to a fixpoint semantics. We study how the constraints that a program generates can effectively impact termination, even for constraint classes that are not constraint compact, generalizing previous results. We also present how different variants of constraint projection impact the correctness and completeness of TCLP implementations. All of the presented characteristics are implemented (or can be experimented with) in Mod TCLP, a modular framework for Tabled Constraint Logic Programming, part of the Ciao Prolog logic programming system.
