Proceedings

Compact Modeling in Constraint Programming with Hybrid Tables

Download BibTeX Cite

Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence. Main Track. Pages 2291-2299.

https://doi.org/10.24963/ijcai.2026/255

Abstract

Hybrid tables, also referred to as `smart' in the literature, represent a valuable modeling technique within Constraint Programming (CP). These tables allow us to handle disjunctive cases (constraining expressions) in a compact and structured way, by authorizing tuples (table entries) to contain simple unary and binary arithmetic restrictions (similar to internal constraints).

In this paper, we show the practical interest of using hybrid tables for planning-like combinatorial puzzles, when the transition from one state to the next can be encoded by a single hybrid table.

Experimental results show that these hybrid models exhibit greater compactness and efficiency in solving compared to their conventional counterparts.

Christophe Lecoutre, Mouny Samy Modeliar, Gilles Audemard, Nicolas Paris, and Nicolas Szczepanski. 2026. Compact Modeling in Constraint Programming with Hybrid Tables. In Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-26. IJCAI, 2291–2299. https://doi.org/10.24963/ijcai.2026/255
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards