Coinductive Logic Programming with Negation
Coinductive Logic Programming with Negation
复制标题
带否定的共归纳逻辑编程
DOI：
10.1007/978-3-642-12592-8_8
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
G. Gupta
中科院分区：
文献类型：
--
作者：
Richard Min;G. Gupta
我们通过共归纳SLDNF（co-SLDNF）解析将否定引入共归纳逻辑编程（co-LP）。我们提出了co-SLDNF归结的声明语义和操作语义，并在合理性约束下给出了它们的等价性。Co-LP与co-SLDNF归结为Fitting的Kripke-Kleene三值逻辑提供了一个强大的、实用的、高效的操作语义。此外，还讨论和说明了Co-SLDNF分辨率的应用，其中Co-SLDNF分辨率允许开发模态逻辑的优雅实现。此外，它提供了非单调推理的能力（例如，谓词答案集编程），可用于开发新颖有效的一阶模态非单调推理引擎。
We introduce negation into coinductive logic programming (co-LP) via what we termCoinductive SLDNF (co-SLDNF)resolution. We present declarative and operational semantics of co-SLDNF resolution and present their equivalence under the restriction of rationality. Co-LP with co-SLDNF resolution provides a powerful, practical and efficient operational semantics for Fitting’s Kripke-Kleene three-valued logic with restriction of rationality. Further, applications of co-SLDNF resolution are also discussed and illustrated where Co-SLDNF resolution allows one to develop elegant implementations of modal logics. Moreover it provides the capability of non-monotonic inference (e.g., predicate Answer Set Programming) that can be used to develop novel and effective first-order modal non-monotonic inference engines.