STR et compression de contraintes tablesReportar como inadecuado

STR et compression de contraintes tables - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 CRIL - Centre de Recherche en Informatique de Lens

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.

Autor: Nebras Gharbi - Fred Hemery - Christophe Lecoutre - Olivier Roussel -



Documentos relacionados