Skip to Main content Skip to Navigation
Conference papers

Efficient Operations On MDDs For Building Constraint Programming Models

Guillaume Perez 1 Jean-Charles Régin 1
1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe CEP
Laboratoire I3S - MDSC - Modèles Discrets pour les Systèmes Complexes
Abstract : We propose improved algorithms for defining the most common operations on Multi-Valued Decision Diagrams (MDDs): creation, reduction, complement , intersection, union, difference, symmetric difference, complement of union and complement of intersection. Then, we show that with these algorithms and thanks to the recent development of an efficient algorithm establishing arc consistency for MDD based constraints (MDD4R), we can simply solve some problems by modeling them as a set of operations between MDDs. We apply our approach to the regular constraint and obtain competitive results with dedicated algorithms. We also experiment our technique on a large scale problem: the phrase generation problem and we show that our approach gives equivalent results to those of a specific algorithm computing a complex automaton.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01344084
Contributor : Jean-Charles Regin <>
Submitted on : Monday, July 11, 2016 - 12:33:35 PM
Last modification on : Thursday, March 5, 2020 - 12:20:24 PM
Document(s) archivé(s) le : Wednesday, October 12, 2016 - 12:13:28 PM

File

operationsMDD.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01344084, version 1

Collections

Citation

Guillaume Perez, Jean-Charles Régin. Efficient Operations On MDDs For Building Constraint Programming Models. IJCAI 2015, Jul 2015, Buenos Aires, Argentina. ⟨hal-01344084⟩

Share

Metrics

Record views

116

Files downloads

86