Automated conjecturing. III. Property-relations conjectures
From MaRDI portal
Publication:1688717
DOI10.1007/s10472-017-9559-5zbMath1379.68275OpenAlexW2738258633WikidataQ122982473 ScholiaQ122982473MaRDI QIDQ1688717
Nicolas Van Cleemput, Craig E. Larson
Publication date: 11 January 2018
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-017-9559-5
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Bootstrap percolation via automated conjecturing ⋮ Boolean-arithmetic equations: acquisition and uses
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Facet defining inequalities among graph invariants: The system graphedron
- INGRID: A graph invariant manipulator
- Independence and the Havel-Hakimi residue
- Solution of the Robbins problem
- Advances on the Hamiltonian problem -- a survey
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Hamilton cycles and eigenvalues of graphs
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Automated conjecture making in number theory using HR, Otter and Maple
- A note on Hamiltonian circuits
- Even-hole-free graphs part I: Decomposition theorem
- Toward Mechanical Mathematics
- AutoGraphiX: a survey
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- On the residue of a graph
- Updating the hamiltonian problem—A survey
- A Curious Nim-Type Game
- Heuristic Problem Solving: The Next Advance in Operations Research
- Towards computerized proofs of identities
This page was built for publication: Automated conjecturing. III. Property-relations conjectures
