Functional description of sequence constraints and synthesis of combinatorial objects

Abstract : Contrary to the standard approach consisting in introducing ad hoc constraints and designing dedicated algorithms for handling their combinatorial aspect, this thesis takes another point of view. On the one hand, it focusses on describing a family of sequence constraints in a compositional way by multiple layers of functions. On the other hand, it addresses the combinatorial aspect of both a single constraint and a conjunction of such constraints by synthesising compositional combinatorial objects, namely bounds, linear inequalities, non-linear constraints and finite automata. These objects are obtained in a systematic way and are not instance-specific: they are parameterised by one or several constraints, by the number of variables in a considered sequence of variables, and by the initial domains of the variables. When synthesising such objects we draw full benefit both from the declarative view of such constraints, based on regular expressions, and from the operational view, based on finite transducers and register automata.There are many advantages of synthesising combinatorial objects rather than designing dedicated algorithms: 1) parameterised formulae can be applied in the context of several resolution techniques such as constraint programming or linear programming, whereas algorithms are typically tailored to a specific technique; 2) combinatorial objects can be combined together to provide better performance in practice; 3) finally, the quantities computed by some formulae cannot just be used in an optimisation setting, but also in the context of data mining.
Complete list of metadatas

Cited literature [62 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01962957
Contributor : Abes Star <>
Submitted on : Friday, December 21, 2018 - 7:59:06 AM
Last modification on : Friday, May 17, 2019 - 11:40:41 AM
Long-term archiving on : Friday, March 22, 2019 - 3:43:18 PM

File

2018IMTA0089-Arafailova_Ekater...
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01962957, version 1

Citation

Ekaterina Arafailova. Functional description of sequence constraints and synthesis of combinatorial objects. Discrete Mathematics [cs.DM]. Ecole nationale supérieure Mines-Télécom Atlantique, 2018. English. ⟨NNT : 2018IMTA0089⟩. ⟨tel-01962957⟩

Share

Metrics

Record views

249

Files downloads

87