AUTOMATIC LOGIC PROGRAMMING BASED ON FIRST ORDER MANY SORTED THEORY
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    In order to build a theory of automatic logic programming, Lakatos' discovery logic based on the method of falsification was used in the typed first order theory (closed) to form the open typed first order theory. Two critical concepts, proof calculus and hypothesis calculus, were introduced in this paper as key algorithms of machine discover.An experimental system ALP(Automatic Logic Programming) was built up on sun workstation,and this system can auto-design some complicate programs, such as: list permutation,list combination,insert sort,some set calculations, etc.

    Reference
    Related
    Cited by
Get Citation

姜涛,孙怀民.基于类型一阶理论的逻辑自动编程.软件学报,1994,5(11):50-58

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 07,1992
  • Revised:June 18,1992
  • 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