NEGATION-AS-FAILURE RULE FOR GENERAL LOGIC PROGRAMS WITH EQUALITY.

被引：0
|
作者：
Le, Van Tu [1 ]
机构：
[1] Canberra Coll of Advanced Education,, Sch of Information Sciences,, Belconnen, Aust, Canberra Coll of Advanced Education, Sch of Information Sciences, Belconnen, Aust
来源：
Journal of Logic Programming | 1985年 / 2卷 / 04期
关键词：
LOGIC PROGRAMS - NEGATION-AS-FAILURE RULE;
D O I：
10.1016/S0743-1066(85)80004-2
中图分类号：
学科分类号：
摘要：
引用
下载
收藏
页码：285 / 294
相关论文
共 50 条
  • [21] Annotated logic and negation as failure
    Nakamatsu, K
    Suzuki, A
    ADVANCES IN LOGIC, ARTIFICIAL INTELLIGENCE AND ROBOTICS, 2002, 85 : 29 - 37
  • [22] COMPILING LOGIC PROGRAMS WITH EQUALITY
    HANUS, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 456 : 387 - 401
  • [23] A Dynamic Epistemic Logic Analysis of the Equality Negation Task
    Goubault, Eric
    Lazic, Marijana
    Ledent, Jeremy
    Rajsbaum, Sergio
    DYNAMIC LOGIC: NEW TRENDS AND APPLICATIONS, DALI 2019, 2020, 12005 : 53 - 70
  • [24] A 2 STEPS SEMANTICS FOR LOGIC PROGRAMS WITH NEGATION
    GABBRIELLI, M
    LEVI, G
    TURI, D
    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 624 : 297 - 308
  • [25] NEGATION AND CONTROL IN AUTOMATICALLY GENERATED LOGIC PROGRAMS
    WIGGINS, GA
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 649 : 250 - 264
  • [26] ELIMINATING NEGATION FROM NORMAL LOGIC PROGRAMS
    KANCHANASUT, K
    STUCKEY, P
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 463 : 217 - 231
  • [27] Combining explicit negation and negation by failure via Belnap's logic
    Ruet, P
    Fages, F
    THEORETICAL COMPUTER SCIENCE, 1997, 171 (1-2) : 61 - 75
  • [28] THE PROLOG NOT-PREDICATE AND NEGATION AS FAILURE RULE
    LING, TW
    NEW GENERATION COMPUTING, 1990, 8 (01) : 5 - 31
  • [29] SEMANTICS FOR DISJUNCTIVE LOGIC PROGRAMS WITH EXPLICIT AND DEFAULT NEGATION
    Minker, Jack
    Ruiz, Carolina
    Fundamenta Informaticae, 1994, 20 (1-3) : 145 - 192
  • [30] Defeasible logic versus Logic Programming without Negation as Failure
    Antoniou, G
    Maher, MJ
    Billington, D
    JOURNAL OF LOGIC PROGRAMMING, 2000, 42 (01): : 47 - 57
12345