zbMATH — the first resource for mathematics

Sliced table constraints: combining compression and tabular reduction. (English) Zbl 1407.68450
Simonis, Helmut (ed.), Integration of AI and OR techniques in constraint programming. 11th international conference, CPAIOR 2014, Cork, Ireland, May 19–23, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8451, 120-135 (2014).
Summary: 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).
For the entire collection see [Zbl 1287.68010].

68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68P30 Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
Full Text: DOI