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 条
  • [41] A STRATIFICATION SEMANTICS FOR GENERAL DISJUNCTIVE PROGRAMS
    RAJASEKAR, A
    MINKER, J
    LOGIC PROGRAMMING : PROCEEDINGS OF THE NORTH AMERICAN CONFERENCE, 1989, VOL 1-2, 1989, : 573 - 586
  • [42] Semantics and Completeness for Schematic Logic
    Tatton-Brown, Oliver
    LOGIC AND LOGICAL PHILOSOPHY, 2021, 30 (02) : 227 - 280
  • [43] Disjunctive logic programs with inheritance
    Buccafurri, Francesco
    Faber, Wolfgang
    Leone, Nicola
    Theory and Practice of Logic Programming, 2002, 2 (03) : 293 - 321
  • [44] From Disjunctive to Normal Logic Programs via Unfolding and Shifting
    Zhou, Yi
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 1139 - 1140
  • [45] Completeness for Ancestral Logic via a Computationally-Meaningful Semantics
    Cohen, Liron
    AUTOMATED REASONING WITH ANALYTIC TABLEAUX AND RELATED METHODS, TABLEAUX 2017, 2017, 10501 : 247 - 260
  • [46] Disjunctive logic programs with inheritance
    Buccafurri, F
    Faber, W
    Leone, N
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2002, 2 : 293 - 321
  • [47] Disjunctive logic programs with inheritance
    Buccafurri, F
    Faber, W
    Leone, N
    LOGIC PROGRAMMING: PROCEEDINGS OF THE 1999 INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING, 1999, : 79 - 93
  • [48] Extending Well-Founded Semantics with Clark's Completion for Disjunctive Logic Programs
    Nieves, Juan Carlos
    Osorio, Mauricio
    SCIENTIFIC PROGRAMMING, 2018, 2018
  • [49] On Completeness of Logic Programs
    Drabent, Wlodzimierz
    LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION (LOPSTR 2014), 2015, 8981 : 261 - 278
  • [50] Effective preprocessing with hyper-resolution and equality reduction
    Bacchus, F
    Winter, J
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 341 - 355
12345