Streamlined Constraint Reasoning via CNN Pattern Recognition on Enumerated Solutions
For constraint programming practitioners tackling hard combinatorial problems, this method automates the discovery of streamliner constraints that yield dramatic speedups, though it is evaluated only on three specific benchmarks.
The paper introduces a pipeline that enumerates feasible solutions, trains a CNN contrastively to detect structural patterns, and uses an LLM to synthesize streamliner constraints for constraint programming. On hardened benchmarks, it achieves 98.8% portfolio time reduction on Vessel Loading, 98.6% on Social Golfers, and 89.4% on Black Hole, with geometric-mean speedups of 932x, 356x, and 1103x respectively.
Constraint programming practitioners accelerate hard problems through a layered set of techniques applied in order of risk. Standard hardening (symmetry-breaking and implied constraints) is applied first and preserves satisfiability. Streamliner constraints, which restrict search to a structural sub-family of solutions, do not preserve satisfiability and are reserved as a final lever. Existing automated streamliner-synthesis approaches either search a constraint grammar or prompt a Large Language Model directly on the problem model. We propose a different approach: enumerate feasible solutions, train a Convolutional Neural Network contrastively against perturbed non-solutions to detect structural patterns, and translate the CNN's discriminative signal into candidate MiniZinc streamliners through LLM-driven synthesis. The CNN grounds the LLM's constraint generation in observed solution structure rather than model text alone. We evaluate on hardened benchmark models where streamliner discovery is the residual performance lever. Our pipeline achieves 98.8% portfolio time reduction on hardened Vessel Loading, 98.6% on hardened Social Golfers, and 89.4% on Black Hole, with best-single streamliners reaching geometric-mean speedups of 932x, 356x, and 1103x respectively. Discovered streamliners include class-based packing constraints on Vessel Loading, beyond-hardening canonicalisations on Social Golfers, and layout-coordinate bounds on Black Hole.