Induction of Concepts in the Predicate Calculus
Proceedings of the Fourth International Joint Conference on Artificial Intelligence. Learning Debugging And Automatic Programming. Pages 281-286.
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.
@inproceedings{ijcai1975p43,
title = {Induction of Concepts in the Predicate Calculus},
author = {Vera, S.},
booktitle = {Proceedings of the Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-75}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Patrick Winston and Carl Hewitt},
pages = {281--286},
year = {1975},
note = {Learning Debugging And Automatic Programming},
url = {https://ijcai.org/proceedings/1975/43},
}
TY - CPAPER TI - Induction of Concepts in the Predicate Calculus AU - Vera, S. T2 - Proceedings of the Fourth International Joint Conference on Artificial Intelligence, IJCAI-75 PB - International Joint Conferences on Artificial Intelligence PY - 1975 SP - 281 EP - 286 UR - https://ijcai.org/proceedings/1975/43 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
