GPU Accelerated Compact-Table Propagation
Enrico Santi, Fabio Tardivo, Agostino Dovier, Andrea Formisano

TL;DR
This paper introduces a GPU-accelerated version of the Compact-Table algorithm for constraint programming, significantly improving the handling of large table constraints by leveraging modern GPU computational power.
Contribution
It presents the design and implementation of GPU-accelerated Compact-Table, integrating it into a constraint solver and demonstrating its effectiveness on large problem instances.
Findings
GPU acceleration significantly speeds up table constraint propagation.
The GPU-based approach handles larger constraints more efficiently.
Experimental results show improved performance on real-world instances.
Abstract
Constraint Programming developed within Logic Programming in the Eighties; nowadays all Prolog systems encompass modules capable of handling constraint programming on finite domains demanding their solution to a constraint solver. This work focuses on a specific form of constraint, the so-called table constraint, used to specify conditions on the values of variables as an enumeration of alternative options. Since every condition on a set of finite domain variables can be ultimately expressed as a finite set of cases, Table can, in principle, simulate any other constraint. These characteristics make Table one of the most studied constraints ever, leading to a series of increasingly efficient propagation algorithms. Despite this, it is not uncommon to encounter real-world problems with hundreds or thousands of valid cases that are simply too many to be handled effectively with standard…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
