Generating Streamlining Constraints with Large Language Models

Streamlining constraints (or streamliners, for short) narrow the search space, enhancing the speed and feasibility of solving complex constraint satisfaction problems. Traditionally, streamliners were crafted manually or generated through systematically combined atomic constraints with high-effort offline testing. Our approach utilizes the generative capabilities of Large Language Models (LLMs) to propose effective streamliners for problems specified in the MiniZinc constraint programming language and integrates feedback to the LLM with quick empirical tests for validation. Evaluated across seven diverse constraint satisfaction problems, our method achieves substantial runtime reductions. We compare the results to obfuscated and disguised variants of the problem to see whether the results depend on LLM memorization. We also analyze whether longer offline runs improve the quality of streamliners and whether the LLM can propose good combinations of streamliners.

Authors

• Florentina Voboril Algorithms and Complexity Group, TU Wien, Vienna, Austria
• Vaidyanathan Peruvemba Ramaswamy
• Stefan Szeider

Keywords

• constraint programming
• constraint satisfaction
• Problem Solving
• satisfiability