Knowledge representation for mathematical discovery: Three experiments in graph theory

DOI10.1007/BF00117743zbMath0768.68198OpenAlexW2093170717WikidataQ114827408 ScholiaQ114827408MaRDI QIDQ1183372

N. S. Sridharan, Susan L. Epstein

Publication date: 28 June 1992

Published in: Applied Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00117743

zbMATH Keywords

graph theoryknowledge representationrecursive algorithmmathematical knowledgeformal grammarsmathematical discoverymachine simulationthought experiment

Mathematics Subject Classification ID

Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Grammars and rewriting systems (68Q42) Graph theory (05C99)

Related Items (1)

Computers and discovery in algebraic graph theory

Cites Work

• Asymptotic behaviour of particle motion under repulsive forces
• Recursive Graphs, Recursive Labelings and Shortest Paths
• Node-and edge-deletion NP-complete problems
• A language extension for graph processing and its formal semantics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Knowledge representation for mathematical discovery: Three experiments in graph theory