No label defined (Q3216155)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3881899
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3881899

      Statements

      0 references
      1984
      0 references
      survey
      0 references
      historical development of automated theorem proving
      0 references
      logic approach
      0 references
      human simulation approach
      0 references
      resolution
      0 references
      connection graph
      0 references
      rewrite-rule systems
      0 references
      AURA
      0 references
      PLANNER-system
      0 references
      Markgraf Karl system
      0 references
      program verification
      0 references
      PROLOG
      0 references
      [For the entire collection see Zbl 0545.00023.] The author, himself an important representative of automated theorem proving, presents a survey of the historical development of automated theorem proving since its beginning in the fifties. He distinguishes two main lines, the ''logic approach'' and the ''human simulation approach''. In the early publications, the first approach is represented (inter alia) by \textit{H. Wang} [IBM J. Res. Develop. 4, 2-27 (1960; Zbl 0097.004)], the second by \textit{A. Newell, J. C. Shaw} and \textit{H. A. Simon} [Proc. Western Joint Comput. Conf., 218-239 (1956)]. In the further development, the resolution principle, the connection graph method and the rewrite- rule systems belong to the logic approach; as important representative, the Wos-group with the program AURA is mentioned. Furthermore, the author cites the PLANNER-system and the systems of Bledsoe lying on the side of the human simulation approach. There are systems that can be classified as being between the two poles, such as the Markgraf Karl system in Karlsruhe. Finally, the author reports on the application of TP-methods on program verification and on the development of PROLOG.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references