Artificial intelligence and machine learning generated conjectures with TxGraffiti

H.A. Simon, A. Newell, Heuristic problem solving: the next advance in operations research, Oper. Res. , 6(1)

1958

Earlier work this paper cites.

D.B. Lenat, The ubiquity of discovery, Artif. Intell. 9(3)

1977

Earlier work this paper cites.

D.B. Lenat, On automated scientific theory formation: A case study using the am program, Mach. Intell. 9

1979

Earlier work this paper cites.

D.B. Lenat, The nature of heuristics, Artif. Intell. 19(2)

1982

Earlier work this paper cites.

S.L. Epstein, On the discovery of mathematical theorems, IJCAI (1987), 194–197

1987

Earlier work this paper cites.

S.L. Epstein, Learning and discovery: One system’s search for mathematical knowledge, Comput. Intell. 4(1)

1988

Earlier work this paper cites.

S. Fajtlowicz, On conjectures of GRAFFITI, Discret. Math. , 72

1988

Earlier work this paper cites.

H. Wang, Computer theorem proving and artificial intelligence, Computation, Logic, Philosophy , Springer (1990), 63–75

1990

Earlier work this paper cites.

W. McCune, Solution of the Robbins problem, J. Autom. Reason. , 19(3)

1997

Earlier work this paper cites.

S. Colton, A. Bundy and T. Walsh, Automated concept formation in pure mathematics, Proc. of the 16th Int. Jt. Conf. on Artif. Intell., vol. 2, IJCAI’99, Morgan Kaufmann Publishers (1999), 786–791

1999

Earlier work this paper cites.

S. Colton, Refactorable numbers—a machine invention, J. Integer Seq. 2

1999

Earlier work this paper cites.

G. Caporossi and P. Hansen, Variable neighborhood search for extremal graphs: 1 The autographix system, Discrete Math. 212(1–2)

2000

Earlier work this paper cites.

D. Nakamura and A. Tamura, A Revision of Minty’s Algorithm for Finding a Maximum Weight Stable Set of a Claw-Free Graph, J. Oper. Res. Soc. Japan 44

2001

Cited alongside, same era.

S. Colton, Automated Theory Formation in Pure Mathematics, Springer, Heidelberg (2002)

2002

Cited alongside, same era.

G. Caporossi and P. Hansen, Variable neighborhood search for extremal graphs: 5 Three ways to automate finding conjectures, Discrete Math. 276(1–3)

2004

Cited alongside, same era.

A. Turing, Intelligent machinery. The Essential Turing , (2004), 395–432

2004

Cited alongside, same era.

M. Aouchiche, G. Caporossi, P. Hansen, and M. Laffay, Autographix: A survey, Electron. Notes Discrete Math. 22

2005

Cited alongside, same era.

E. Flandrin, R. Faudree, and Z. Ryjáček, Claw-free graph - a survey, Discrete Math. 214

2016

Later among the works it cites.

R. Davila, Total and Zero Forcing in Graphs, University of Johannesburg , PhD Thesis (2019)

2019

Later among the works it cites.

R. Davila and M. A. Henning, Total forcing versus total domination in cubic graphs, Appl. Math. Comput

2019

Later among the works it cites.

Y. Caro, R. Davila, and R. Pepper, New results relating matching and independence, Discuss. Math. Graph Theory

2020

Later among the works it cites.

R. Davila and M.A. Henning, Zero forcing in claw-free cubic graphs, Bull. Malays. Math. Sci. Soc. , 43

2020

Later among the works it cites.

R. Davila and M. A. Henning, Zero forcing versus domination in cubic graphs, J. Comb. Optim. , 41