2 RESULTS IN TERM REWRITING THEOREM-PROVING

被引：0
|
作者：
HSIANG, J
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1985年 / 202卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：301 / 324
页数：24
相关论文
共 50 条
  • [41] LAMBEK THEOREM-PROVING AND FEATURE UNIFICATION
    VANDERLINDEN, EJ
    FOURTH CONFERENCE OF THE EUROPEAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, 1989, : 190 - 196
  • [42] THEOREM-PROVING VERIFICATION FOR ASYNCHRONOUS CIRCUITS
    Nishimura, Shunji
    Amagasaki, Motoki
    Kuga, Morihiro
    Iida, Masahiro
    Sueyoshi, Toshinori
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2016, 12 (03): : 761 - 778
  • [43] THE KARLSRUHE INDUCTION THEOREM-PROVING SYSTEM
    BIUNDO, S
    HUMMEL, B
    HUTTER, D
    WALTHER, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 230 : 672 - 674
  • [44] Catagenesis condition for approximate theorem-proving
    Du, X.N.
    Li, L.
    Lanzhou Daxue Xuebao/Journal of Lanzhou University, 2001, 37 (03):
  • [45] PLATO: A tool to assist programming as term rewriting and theorem proving
    Sampaio, AJ
    Haeberer, AM
    Prates, CT
    Ururahy, CD
    Frias, MF
    Albuquerque, NC
    TAPSOFT '95: THEORY AND PRACTICE OF SOFTWARE DEVELOPMENT, 1995, 915 : 797 - 798
  • [46] A NOTE ON INTERACTIVE THEOREM-PROVING WITH THEOREM CONTINUATION FUNCTIONS
    CHOU, CT
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1993, 20 : 59 - 69
  • [47] OR-PARALLEL THEOREM-PROVING WITH RANDOM COMPETITION
    ERTEL, W
    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 624 : 226 - 237
  • [48] THEOREM-PROVING IN INTERMEDIATE AND MODAL-LOGICS
    ZAKHARYASHCHEV, MV
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 278 : 492 - 496
  • [49] RECONSTRUCTION OF POLYHEDRA BY A MECHANICAL THEOREM-PROVING METHOD
    KOH, K
    DEGUCHI, K
    MORISHITA, I
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1993, E76D (04) : 437 - 445
  • [50] HUMAN ORIENTED LOGIC FOR AUTOMATIC THEOREM-PROVING
    NEVINS, AJ
    JOURNAL OF THE ACM, 1974, 21 (04) : 606 - 621
12345