CaVE：一种处理完整性约束的约束存储方法
CaVE: A Constraint Storage Approach to Handling Integrity Constraints
浏览论文内容
中文总结 AI 辅助
研究在稳定Kanren中处理完整性约束的方法，提出CaVE约束存储方法，通过与归结配合支持完整性约束，讨论了其不同版本变体，并用Scheme实现，展示了带完整性约束的示例程序。
中文摘要 AI 辅助
本文提出了约束验证与发射（CaVE），一种用于在稳定Kanren中处理完整性约束的约束存储方法。稳定Kanren是基于扩展合一和归结的正常逻辑程序求解器。完整性约束控制正常逻辑程序中目标的结果，对非单调推理至关重要。目前没有可用于稳定Kanren的基于归结的处理完整性约束的算法。因此设计了CaVE，一种与归结配合支持完整性约束的约束存储。讨论了CaVE在完整性约束方面从命题到基础及谓词版本的变体。用Scheme在稳定Kanren中实现了CaVE，并展示了一系列带有完整性约束的稳定Kanren编写的示例正常程序。
英文摘要
This paper presents Constraints as Verifiers and Emitters (CaVE), a constraint storage approach for handling integrity constraints in stableKanren. stableKanren is a normal logic-program solver based on extended unification and resolution. Integrity constraints control the outcomes of goals in normal logic programs, which is critical for non-monotonic reasoning. There is no resolution-based algorithm for handling integrity constraints that can be used in stableKanren. Therefore, we design Constraints as Verifiers and Emitters (CaVE), a constraint storage that works with resolution to support integrity constraints. We discuss variants of CaVE with respect to the integrity constraints, ranging from propositional to grounded and predicate versions. We implement CaVE using Scheme in stableKanren and show a series of example normal programs written in stableKanren with integrity constraints.
