{"type":"ScholarlyArticle","title":"Induction of Concepts in the Predicate Calculus","authors":[{"name":"S. Vera","slug":"s-vera","given":"S.","family":"Vera","affiliation":""}],"abstract":"Positive and negative instances of a concept are assumed to be described by a conjunction of literals in the predicate calculus, with terms limited to constants and universally quantified variables. A ~raph representation of a conjunction of literals, called a \"product graph\", is introduced. It is desirable to merge positive instances by generalization, while maintaining discrimination against negative instances. This is accomplished by an induction procedure which operates on the product graph form of these positive and negative instances. The correctness of the procedure is proven, together with several related results of direct practical significance. This work is directed to the goal of providing a formal model for the inductive processes which are observed in artificial intelligence studies in specialized areas.","doi":null,"url":"https://ijcai.org/proceedings/1975/43","pdf":"https://ijcai.org/proceedings/1975/0043.pdf","markdown":"https://ijcai.org/proceedings/1975/43.md","bibtex":"https://ijcai.org/proceedings/1975/bibtex/43","volume":{"slug":"1975","title":"Proceedings of the Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1975","url":"https://ijcai.org/proceedings/1975/","year":1975,"location":"Tbilisi, Georgia, USSR","dates":"","editors":"Patrick Winston and Carl Hewitt","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Learning Debugging And Automatic Programming","track":"Learning Debugging And Automatic Programming","number":43,"pages":{"first":281,"last":286},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}