Efficient Operations On MDDs For Building Constraint Programming Models

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.
Type de document :
Communication dans un congrès
IJCAI 2015, Jul 2015, Buenos Aires, Argentina. Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015, Buenos Aires, Argentina, July 25-31, 2015
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01344084
Contributeur : Jean-Charles Regin <>
Soumis le : lundi 11 juillet 2016 - 12:33:35
Dernière modification le : mardi 19 juillet 2016 - 01:04:44
Document(s) archivé(s) le : mercredi 12 octobre 2016 - 12:13:28

Fichier

operationsMDD.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015, Buenos Aires, Argentina, July 25-31, 2015. <hal-01344084>

Partager

Métriques

Consultations de
la notice

46

Téléchargements du document

31