Abstract The interactive programming system GRAPH for the classification and extension of knowledge in the field of graph theory has been implemented during the period 1980–1984 at the University of Belgrade, Faculty of Electrical Engineering. The system consists of a computerized graph theory bibliography, a system for graph theoretic algorithms and a mechanical theorem prover. This paper describes the theorem prover of the system at a conceptual level and reports first experiences with this system. Important characteristics of the prover are: a special formalization of graph theory, a new way of handling definition instantiations and rewriting by lemmas, and the possibility of using graph theoretic algorithms to test the validity of subgoals on concrete graphs. A complexity measure of a formula is introduced to help the selection of a proper definition or lemma.
[1]
W. W. Bledsoe,et al.
Non-Resolution Theorem Proving
,
1977,
Artif. Intell..
[2]
W. W. Bledsoe,et al.
Splitting and Reduction Heuristics in Automatic Theorem Proving
,
1971,
Artif. Intell..
[3]
David R. Musser,et al.
The AFFIRM Theorem Prover: Proof Forests and Management of Large Proofs
,
1980,
CADE.
[4]
Dragos M. Cvetkovi,et al.
Graph equations for line graphs and total graphs
,
1975
.
[5]
W. W. Bledsoe,et al.
A Man-Machine Theorem-Proving System
,
1973,
IJCAI.
[6]
David A. Plaisted,et al.
Theorem Proving with Abstraction
,
1981,
Artif. Intell..
[7]
Donald W. Loveland,et al.
Automated theorem proving: a logical basis
,
1978,
Fundamental studies in computer science.