Doing arithmetic with diagrams

Authors:
Alan Bundy
Affiliations:
Department of Computational Logic, University of Edinburgh, Edinburgh, Scotland
Venue:
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Year:
1973

Citing 2
Cited 2

Realization of a geometry-theorem proving machine

Computers & thought
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)

Knowledge and reasoning in program synthesis

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Biological, computational and robotic connections with Kant's theory of mathematical knowledge

AI Communications - ECAI 2012 Turing and Anniversary Track

Quantified Score

Hi-index	0.00

Visualization

Abstract

A theorem prover for part of arithmetic in described which proves theorems by representing them in the form of a diagram or network. The nodes of this network represent 'ideal integers', i.e. objects which have all the properties of integers, without being any particular intoger. The links in the network represent relationships between 'ideal integers'. The procedures which draw these diagrams make elementary deductions based on their built-in knowledge of the functions and predicates of arithmetic. This theorem prover is intended as a model of some kinds of human problem-solving behaviour.