{"type":"ScholarlyArticle","title":"CM-Strategy: A Methodology for Inductive Theorem Proving or Constructive Well-Generalized Proofs","authors":[{"name":"Marta Franová","slug":"marta-franova","given":"Marta","family":"Franová","affiliation":""}],"abstract":"The main problem, when automatically proving theorems by induction is the problern of strategy, or, how to automatically direct deductlons. This is not trivial, and, at present, only a mlxture of complicated strategies have been investigated. The essential contribution of this paper is therefore the proposiog of a new strategy for inductive theorem proving, tnsplred by a new mecanlsm called Constructive Matehing (CM), and used for automatic programmlog [f04]. We also propose a new method for the recognltion of predicates and functions, necessary to prove a theorem by our approach, that are not defined in the knowledge-base (\"Invention\" of new operators). Finally, we illustrate the obtalnement of a sultable generalized Iemma necessary for the proof.","doi":null,"url":"https://ijcai.org/proceedings/1985/245","pdf":"https://ijcai.org/proceedings/1985/0245.pdf","markdown":"https://ijcai.org/proceedings/1985/245.md","bibtex":"https://ijcai.org/proceedings/1985/bibtex/245","volume":{"slug":"1985","title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1985","url":"https://ijcai.org/proceedings/1985/","year":1985,"location":"Los Angeles, California, USA","dates":"","editors":"Aravind Joshi","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Theorem Proving","track":"Theorem Proving","number":245,"pages":{"first":1214,"last":1219},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}