Sliced Table Constraints: Combining Compression and Tabular Reduction
نویسندگان
چکیده
Many industrial applications require the use of table constraints (e.g., in configuration problems), sometimes of significant size. During the recent years, researchers have focused on reducing space and time complexities of this type of constraint. Static and dynamic reduction based approaches have been proposed giving new compact representations of table constraints and effective filtering algorithms. In this paper, we study the possibility of combining both static and dynamic reduction techniques by proposing a new compressed form of table constraints based on frequent pattern detection, and exploiting it in STR (Simple Tabular Reduction).
منابع مشابه
A Compression Method for STR
Over the recent years, many filtering algorithms have been developed for table constraints. Simple Tabular Reduction (STR) is an effective approach to filter table constraints. It maintains dynamically the list of supports in each constraint table during inference and search. However, for some specific problems, the approach that consists in representing tables in a compact way by means of mult...
متن کاملLes contraintes table fragmentées : Combiner la compression et la réduction tabulaire
Many industrial applications require the use of table constraints (e.g., in configuration problems), sometimes of significant size. During the recent years, researchers have focused on reducing space and time complexities of this type of constraint. Static and dynamic reduction based approaches have been proposed giving new compact representations of table constraints and effective filtering al...
متن کاملOptimizing STR Algorithms with Tuple Compression
Table constraints define an arbitrary constraint explicitly as a set of solutions (tuples) or non-solutions. Thus, space is proportional to number of tuples. Simple Tabular Reduction (STR), which dynamically reduces the table size by maintaining a table of only the valid tuples, has been shown to be efficient for enforcing Generalized Arc Consistency. The Cartesian product representation is ano...
متن کاملMaking Simple Tabular ReductionWorks on Negative Table Constraints
Simple Tabular Reduction algorithms (STR) work well to establish Generalized Arc Consistency (GAC) on positive table constraints. However, the existing STR algorithms are useless for negative table constraints. In this work, we propose a novel STR algorithm and its improvement, which work on negative table constraints. Our preliminary experiments are performed on some random instances and a cer...
متن کاملSTR 2 Optimized Simple Tabular Reduction for Table Constraints ⇤ Christophe Lecoutre CRIL - CNRS UMR
Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints and/or to compress their representation. In this paper, we describe an optimization of simple tabular reduction (STR), a technique proposed by J. Ullmann to dynamically maintain the tables of supports when generalized arc consistency (GAC...
متن کامل