Article thumbnail

STR et compression de contraintes tables

By Nebras Gharbi, Fred Hemery, Christophe Lecoutre and Olivier Roussel


National audienceOver 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

Topics: [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Publisher: HAL CCSD
Year: 2013
OAI identifier: oai:HAL:hal-00869930v1
Provided by: HAL-Artois

Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.