Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
type: Item
instance of: scholarly article
title: Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
zbMATH Open document ID: 1344.68208
published in: Artificial Intelligence
publication date: 2015-12-28T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6524434
zbMATH Keywords: automated conjecturing
zbMATH Keywords: automated conjecture-making
zbMATH Keywords: mathematical discovery
zbMATH Keywords: automated scientific discovery
zbMATH Keywords: Dalmatian heuristic
author: Craig E. Larson
author: Nico Van Cleemput
describes a project that uses: SageMath
describes a project that uses: INGRID
describes a project that uses: HR
describes a project that uses: GRAFFITI
describes a project that uses: AutoGraphiX
describes a project that uses: nauty
describes a project that uses: GrInvIn
describes a project that uses: GRAPH
describes a project that uses: GraPHedron
MaRDI profile type: Publication
full work available at URL: j.artint.2015.10.002
OpenAlex ID: W2194300440
cites work: Q4871155
cites work: Q5477956
cites work: Heuristic Problem Solving: The Next Advance in Operations Research
cites work: Solution of the Robbins problem
cites work: Toward Mechanical Mathematics
cites work: On conjectures of Graffiti
cites work: Q3197866
cites work: Q3197865
cites work: Q3211357
cites work: Q5477957
cites work: Q5477970
cites work: Q3938537
cites work: Q4233444
cites work: Q3006508
cites work: Automated conjecture making in number theory using HR, Otter and Maple
cites work: Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
cites work: Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
cites work: AutoGraphiX: a survey
cites work: Facet defining inequalities among graph invariants: The system graphedron
cites work: Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
cites work: Q3318779
cites work: INGRID: A graph invariant manipulator
cites work: Towards computerized proofs of identities
cites work: Q4444454
cites work: The average distance and the independence number
cites work: Maximum induced trees in graphs
cites work: A characterization of radius-critical graphs
cites work: On the residue of a graph
cites work: Independence and the Havel-Hakimi residue
cites work: Average distance and maximum induced forest
cites work: Q2724744
cites work: Q5477976
cites work: GrInvIn in a nutshell
cites work: Q3856819
cites work: Verifying the Goldbach conjecture up to \(4\cdot 10^{14}\)
cites work: Q5317673
cites work: Q4368728
cites work: Graphs with equal independence and annihilation numbers
cites work: Q4198056
cites work: Q5441574
cites work: The critical independence number and an independence decomposition
cites work: A new lower bound on the independence number of graphs
cites work: On the Shannon capacity of a graph
cites work: The sandwich theorem
cites work: Q4407449
cites work: Q4223159
cites work: Random graphs.
cites work: A Curious Nim-Type Game
cites work: Q3510980
cites work: Updating the hamiltonian problem—A survey
cites work: Advances on the Hamiltonian problem -- a survey
cites work: Independence numbers of graphs - an extension of the Koenig-Egervary theorem

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (cites work)
cites work: A characterization of the graphs in which the transversal number equals the matching number

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (cites work)
cites work: Ear-decompositions of matching-covered graphs

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (cites work)
cites work: König-Egerváry graphs, 2-bicritical graphs and fractional matchings

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (cites work)
cites work: Q5779778

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (cites work)
cites work: On the notion of interestingness in automated mathematical discovery

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (DOI)
DOI: 10.1016/J.ARTINT.2015.10.002

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Recommended article)
Recommended article: Automated conjecturing. III. Property-relations conjectures
Similarity Score: 0.8202345
Recommender Run: Recommender Run 3

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Recommended article)
Recommended article: Q3709920
Similarity Score: 0.8193677
Recommender Run: Recommender Run 3

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Recommended article)
Recommended article: Automated Conjecturing II: Chomp and Reasoned Game Play
Similarity Score: 0.8181688
Recommender Run: Recommender Run 3

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Recommended article)
Recommended article: The automation of syllogistic. II: Optimization and complexity issues
Similarity Score: 0.81635725
Recommender Run: Recommender Run 3

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Recommended article)
Recommended article: Q3738607
Similarity Score: 0.81011397
Recommender Run: Recommender Run 3

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Recommended article)
Recommended article: Automatic theorem proving and fuzzy situational search for decisions
Similarity Score: 0.80833554
Recommender Run: Recommender Run 3

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Recommended article)
Recommended article: Automating automated reasoning. The case of two generic automated reasoning tools
Similarity Score: 0.8022224
Recommender Run: Recommender Run 3

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Recommended article)
Recommended article: Q4903911
Similarity Score: 0.8017494
Recommender Run: Recommender Run 3

Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Recommended article)
Recommended article: Q4941841
Similarity Score: 0.8015423
Recommender Run: Recommender Run 3