Skip to content
OpenTrain AIFor AI Companies

HFEPX · Eval paper review

Learning to Rank Propagators in Constraint Programming

Matija Lojović, Mladen Nikolić

Published

Nov 8, 2026

Citations

0

Trust level

Low

Usefulness score

40/100 (Low)

Extraction confidence

45% (Low)

Derived from extracted protocol signals and abstract evidence.

Rater population

Not reported

Signals refreshed

Nov 8, 2026

Should you rely on this paper?

This paper is adjacent to HFEPX scope and is best used for background context, not as a primary protocol reference.

Use this as background context only. Do not make protocol decisions from this page alone.

Best use

Background context only

Use if you need

Background context only.

What to verify

Read the full paper before copying any benchmark, metric, or protocol choices.

Main weakness

The available metadata is too thin to trust this as a primary source.

Human feedback signal
Detected
From extracted signals
Evaluation signal
Weak or implicit
Validate from full paper
Usefulness for eval research
40/100
Adjacent candidate

Treat as adjacent context, not a core eval-method reference.

Abstract

The order in which propagators are executed can substantially affect the performance of constraint programming solvers, yet propagator priorities are typically determined by fixed, manually designed heuristics. In this work, we explore learning instance-dependent propagator priorities from static problem features. We formulate the task as a learning-to-rank problem, addressing the challenge that the quality of a priority assignment can be measured through solver runtime, while the desired priorities of individual propagators are not directly observable. A self-attention-based model jointly scores the propagators present in an instance and is trained using pairwise preferences derived from solver runtimes measured under randomized propagator priority assignments, with a Plackett-Luce-based ranking objective. Predicted rankings are mapped to the discrete priority levels of the Choco solver before search begins, without modifying its propagation or search procedures. We evaluate the approach on XCSP3 instances and demonstrate that propagator ordering can have a substantial impact on solving time. On a test set of 698 instances, picked out as most difficult by problem class, the learned priorities increase the number of solved instances from 634 to 654, reduce median solver runtime by 27.93%, and reduce aggregate penalized runtime (PAR1) by 12.65% compared with Choco's default priorities. We further observe that improvements vary across problem classes and show that a simple policy selecting between learned and default priorities further increases the number of solved instances. These results demonstrate the potential of learning instance-dependent propagator priorities to improve constraint programming performance, particularly on difficult instances.

What we could verify

These are the protocol signals we could actually recover from the available paper metadata. Use them to decide whether this paper is worth deeper reading.

Human Feedback Types

partial

Pairwise Preference

Directly usable for protocol triage.

"The order in which propagators are executed can substantially affect the performance of constraint programming solvers, yet propagator priorities are typically determined by fixed, manually designed heuristics."

Evaluation Modes

missing

None explicit

Validate eval design from full paper text.

"The order in which propagators are executed can substantially affect the performance of constraint programming solvers, yet propagator priorities are typically determined by fixed, manually designed heuristics."

Quality Controls

missing

Not reported

No explicit QC controls found.

"The order in which propagators are executed can substantially affect the performance of constraint programming solvers, yet propagator priorities are typically determined by fixed, manually designed heuristics."

Benchmarks / Datasets

missing

Not extracted

No benchmark anchors detected.

"The order in which propagators are executed can substantially affect the performance of constraint programming solvers, yet propagator priorities are typically determined by fixed, manually designed heuristics."

Reported Metrics

missing

Not extracted

No metric anchors detected.

"The order in which propagators are executed can substantially affect the performance of constraint programming solvers, yet propagator priorities are typically determined by fixed, manually designed heuristics."

Benchmarks and datasets

No benchmark or dataset names were extracted from the available abstract.

Reported metrics

No metric terms were extracted from the available abstract.

Human feedback details
Uses human feedback
Yes
Feedback types
Pairwise Preference
Rater population
Not reported
Unit of annotation
Pairwise (inferred)
Expertise required
Coding
Evaluation details
Evaluation modes
None
Agentic eval
None
Quality controls
Not reported
Evidence quality
Low
Use this page as
Background context only

Research brief

Metadata summary

The order in which propagators are executed can substantially affect the performance of constraint programming solvers, yet propagator priorities are typically determined by fixed, manually designed heuristics.

Based on abstract + metadata only. Check the source paper before making high-confidence protocol decisions.

Key takeaways

  • The order in which propagators are executed can substantially affect the performance of constraint programming solvers, yet propagator priorities are typically determined by fixed, manually designed heuristics.
  • In this work, we explore learning instance-dependent propagator priorities from static problem features.
  • We formulate the task as a learning-to-rank problem, addressing the challenge that the quality of a priority assignment can be measured through solver runtime, while the desired priorities of individual propagators are not directly observable.

Researcher actions

  • Compare this paper against nearby papers in the same arXiv category before using it for protocol decisions.
  • Check the full text for explicit evaluation design choices (raters, protocol, and metrics).
  • Use related-paper links to find stronger protocol-specific references.

Caveats

  • Generated from abstract + metadata only; no PDF parsing.
  • Signals below are heuristic and may miss details reported outside the abstract.

Contribution summary

  • The order in which propagators are executed can substantially affect the performance of constraint programming solvers, yet propagator priorities are typically determined by fixed, manually designed heuristics.
  • In this work, we explore learning instance-dependent propagator priorities from static problem features.

Why it matters for eval

  • We evaluate the approach on XCSP3 instances and demonstrate that propagator ordering can have a substantial impact on solving time.

Researcher checklist

  • Human feedback protocol is explicit

    Detected: Pairwise Preference

  • Evaluation mode is explicit

    No clear evaluation mode extracted.

  • Quality control reporting appears

    No calibration/adjudication/IAA control explicitly detected.

  • Benchmark or dataset anchors are present

    No benchmark/dataset anchor extracted from abstract.

  • Metric reporting is present

    No metric terms extracted.