Skip to Main content Skip to Navigation
Conference papers

STR et compression de contraintes tables

Abstract : Over the recent years, many ltering algorithms have been developed for table constraints. STR2, one of the most e cient algorithms, is based on the technique of simple tabular reduction, meaning that it maintains dynamically the list of supports in each constraint table during inference and search. However, for some speci c problems, the approach that consists in representing in a compact way tables by means of multi-valued deci- sion diagrams (MDD) overcomes STR2. In this paper, we study the possibility of combining simple tabular reduction with a compression form of tables based on the detection of recurrent patterns in tuples.
Document type :
Conference papers
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00869930
Contributor : Francois Chevallier Connect in order to contact the contributor
Submitted on : Friday, October 4, 2013 - 2:58:16 PM
Last modification on : Wednesday, October 20, 2021 - 9:58:20 AM
Long-term archiving on: : Friday, April 7, 2017 - 6:17:16 AM

File

strcJFPC2013.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00869930, version 1

Collections

Citation

Nebras Gharbi, Fred Hemery, Christophe Lecoutre, Olivier Roussel. STR et compression de contraintes tables. 9ièmes Journées Francophones de Programmation par Contraintes (JFPC'13), 2013, Aix-en-Provence, France. pp.143-146. ⟨hal-00869930⟩

Share

Metrics

Les métriques sont temporairement indisponibles