首页> 外文期刊>Theory and Practice of Logic Programming >The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments
【24h】

The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments

机译:具有约束条件的归纳逻辑编程的CIFF证明程序:理论,实现和实验

获取原文

摘要

We present the CIFF proof procedure for abductive logic programming with constraints, and we prove its correctness. CIFF is an extension of the IFF proof procedure for abductive logic programming, relaxing the original restrictions over variable quantification (allowedness conditions) and incorporating a constraint solver to deal with numerical constraints as in constraint logic programming. Finally, we describe the CIFF system, comparing it with state-of-the-art abductive systems and answer set solvers and showing how to use it to program some applications.
机译:我们提出了带有约束的归纳逻辑编程的CIFF证明程序,并证明了它的正确性。 CIFF是用于归纳逻辑编程的IFF证明程序的扩展,它放宽了对变量量化(允许条件)的原始限制,并像在约束逻辑编程中那样,结合了一个约束求解器来处理数值约束。最后,我们描述了CIFF系统,并将其与最新的绑架系统和答案集求解器进行了比较,并展示了如何使用它对某些应用程序进行编程。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号