INGRID: A graph invariant manipulator
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
With the simple user interface provided by INGRID, even a graph theory novice can often discern properties of a graph that might normally require the capabilities of a well-informed expert.
Abstract
INGRID, a software system for assisting researchers and students of graph theory, is described. It is a partial commutative rule-based system using forward chaining, consists of approximately 1200 production rules, and is written in Berkeley Pascal on a VAX 11/780 under UNIX. INGRID has a data base of 36 graphical invariants and approximately 350 theorems symbolically relating these invariants. A set of one or more user-supplied restrictions upon the values of some invariants is propagated by INGRID, via the theorems, into intervals of possible values for other of the invariants. With the simple user interface provided by INGRID, even a graph theory novice can often discern properties of a graph that might normally require the capabilities of a well-informed expert.