Premium
On the discovery of mathematical concepts
Author(s) -
Epstein S. L.
Publication year - 1988
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.4550030205
Subject(s) - computer science , knowledge base , theoretical computer science , bipartite graph , generalization , base (topology) , construct (python library) , class (philosophy) , generator (circuit theory) , knowledge extraction , graph , artificial intelligence , mathematics , programming language , mathematical analysis , power (physics) , physics , quantum mechanics
Abstract The Graph Theorist (GT) is a system intended to perform mathematical research in graph theory. This paper focuses upon GT's ability to discover new mathematical concepts by varying the definitions in its input knowledge base. Each new definition is a correct and complete generator for a class of graphs. the new concepts arise from the specialization of an existing concept, the generalization of an existing concept, and the merger of two or more existing concepts. Discovery is driven both by examples (specific graphs) and by definitional form (algorithms). GT explores new concepts either to develop an area of knowledge or to link a newly‐acquired concept into a pre‐existing knowledge base. From an initial knowledge base containing only the definition of “graph,” GT discovers such concepts as acyclic graphs, connected graphs and bipartite graphs. Given an input concept, such as “star,” GT discovers “trees” while searching for the appropriate links to integrate star into its knowledge base. the discovery processes construct a semantic net linking frames for all of GT's concepts together.