Automatic theory formation in graph theory

DOI: 10.1590/S0104-65001999000300003Semantic Scholar

4 Citations•1999•

H. Pistori, Jacques Wainer

J. Braz. Comput. Soc.

SCOT is presented, a system for automatic theory construction in the domain of Graph Theory that takes into account the main processes related to theory construction: concept construction, example production, example analysis, conjecture construction, and conjecture analysis.

Abstract

This paper presents SCOT, a system for automatic theory construction in the domain of Graph Theory. Following on the footsteps of the programs ARE [9], HR [1] and Cyrano [6], concept discovery is modeled as search in a concept space. We propose a classification for discovery heuristics, which takes into account the main processes related to theory construction: concept construction, example production, example analysis, conjecture construction, and conjecture analysis.

Use the desktop version to access all features