BACKWARD REDUCTION METHOD FOR AUTOMATED THEOREM PROVING
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Based on algebra and recursive function theory, a key concept of algebraicrecursive predicates is defined in this paper. Based on mathematical induction, a backwardreduction method and its corresponding algorithm reduction are given for proving the universal truth of algebraic recursive predicates. Because the method is reduction based, theefficiency of theorem-proving is improved greatly.

    Reference
    Related
    Cited by
Get Citation

李爱中,黄厚宽,乔佩利.机器定理证明的反向归约方法.软件学报,1996,7(6):354-359

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:March 30,1995
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063