Completeness of hyper-resolution via the semantics of disjunctive logic programs

被引：1
|
作者：
Nguyen, LA [1 ]
Goré, R
机构：
[1] Australian Natl Univ, RSISE, Canberra, ACT 0200, Australia
[2] Australian Natl Univ, NICTA, Canberra, ACT 0200, Australia
[3] Univ Warsaw, Inst Informat, PL-02097 Warsaw, Poland
来源：
INFORMATION PROCESSING LETTERS | 2005年 / 95卷 / 02期
基金：
澳大利亚研究理事会;
关键词：
fixpoint semantics; automatic theorem proving;
D O I：
10.1016/j.ipl.2005.02.003
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present a proof of completeness of hyper-resolution based on the fixpoint semantics of disjunctive logic programs. This shows that hyper-resolution can be studied from the point of view of logic programming. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：363 / 369
页数：7
相关论文
共 50 条
12345