Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
From MaRDI portal
Publication:899436
DOI10.1016/j.artint.2015.10.002zbMath1344.68208OpenAlexW2194300440MaRDI QIDQ899436
Craig E. Larson, Nicolas Van Cleemput
Publication date: 28 December 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2015.10.002
automated conjecture-makingautomated conjecturingautomated scientific discoveryDalmatian heuristicmathematical discovery
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Bootstrap percolation via automated conjecturing ⋮ Zeta types and Tannakian symbols as a method for representing mathematical knowledge ⋮ Automated conjecturing. III. Property-relations conjectures
Uses Software
Cites Work
- A characterization of the graphs in which the transversal number equals the matching number
- The critical independence number and an independence decomposition
- Graphs with equal independence and annihilation numbers
- On conjectures of Graffiti
- Facet defining inequalities among graph invariants: The system graphedron
- GrInvIn in a nutshell
- Ear-decompositions of matching-covered graphs
- Maximum induced trees in graphs
- INGRID: A graph invariant manipulator
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Independence and the Havel-Hakimi residue
- The sandwich theorem
- 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
- König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- A new lower bound on the independence number of graphs
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Automated conjecture making in number theory using HR, Otter and Maple
- Verifying the Goldbach conjecture up to 4⋅10¹⁴
- A characterization of radius-critical graphs
- Toward Mechanical Mathematics
- AutoGraphiX: a survey
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- Average distance and maximum induced forest
- The average distance and the independence number
- On the residue of a graph
- Updating the hamiltonian problem—A survey
- A Curious Nim-Type Game
- On the Shannon capacity of a graph
- On the notion of interestingness in automated mathematical discovery
- Heuristic Problem Solving: The Next Advance in Operations Research
- Towards computerized proofs of identities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
