Skip to Main content Skip to Navigation
New interface
Conference papers

Acquiring Maps of Interrelated Conjectures on Sharp Bounds

Abstract : To automate the discovery of conjectures on combinatorial objects, we introduce the concept of a map of sharp bounds on characteristics of combinatorial objects, that provides a set of interrelated sharp bounds for these combinatorial objects. We then describe a Bound Seeker, a CP-based system, that gradually acquires maps of conjectures. The system was tested for searching conjectures on bounds on characteristics of digraphs: it constructs sixteen maps involving 431 conjectures on sharp lower and upper-bounds on eight digraph characteristics.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03789045
Contributor : Nicolas Beldiceanu Connect in order to contact the contributor
Submitted on : Tuesday, September 27, 2022 - 11:04:07 AM
Last modification on : Thursday, December 1, 2022 - 10:54:03 AM

File

LIPIcs-CP-2022-6.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Nicolas Beldiceanu, Jovial Cheukam-Ngouonou, Rémi Douence, Ramiz Gindullin, Claude-Guy Quimper. Acquiring Maps of Interrelated Conjectures on Sharp Bounds. CP 2022 - 28th International Conference on Principles and Practice of Constraint Programming, Jul 2022, Haifa, Israel. pp.1-18, ⟨10.4230/LIPIcs.CP.2022.6⟩. ⟨hal-03789045⟩

Share

Metrics

Record views

32

Files downloads

3