An Efficient Heuristic Approach Combining Maximal Itemsets and Area Measure for Compressing Voluminous Table Constraints - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Supercomputing Année : 2023

An Efficient Heuristic Approach Combining Maximal Itemsets and Area Measure for Compressing Voluminous Table Constraints

Résumé

Constraint Programming is a powerful paradigm to model and solve combinatorial problems. While there are many kinds of constraints, the table constraint is perhaps the most significant—being the most well-studied and has the ability to encode any other constraints defined on finite variables. However, constraints can be very voluminous and their size can grow exponentially with their arity. To reduce space and the time complexity, researchers have focused on various forms of compression. In this paper, we propose a new approach based on maximal frequent itemsets technique and area measure for enumerating the maximal frequent itemsets relevant for compressing table constraints. Our experimental results show the effectiveness and efficiency of this approach on compression and on solving compressed constraint satisfaction problem.

Dates et versions

hal-03779874 , version 1 (26-09-2022)

Identifiants

Citer

Soufia Bennai, Kamal Amroun, Samir Loudni, Abdelkader Ouali. An Efficient Heuristic Approach Combining Maximal Itemsets and Area Measure for Compressing Voluminous Table Constraints. Journal of Supercomputing, 2023, 79 (1), pp.650-676. ⟨10.1007/s11227-022-04667-1⟩. ⟨hal-03779874⟩
48 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More