Research map / Learning theory and algorithms / Combinatorial and search optimization
GEQCA: Generic Qualitative Constraint Acquisition
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use PATH constraint selection with path consistency instead of LQCN's weight-based selection | GEQCA · Ins 25 8 | user effort eF: 60% -> 17% | Helped |
| use PATH constraint selection with path consistency instead of LQCN's weight-based selection | GEQCA · Ins 100 8 | user effort eF: 44% -> 10% | Helped |
| use PATH constraint selection with path consistency instead of LQCN's weight-based selection | GEQCA · Ins 25 58 | user effort eF: 76% -> 78% | Hurt |
| use PATH constraint selection with path consistency instead of LQCN's weight-based selection | GEQCA · Ins 10 25 | user effort eF: 55% -> 59% | Hurt |
| add task durations, resource requirements, and resource capacities as background knowledge (ablation) | GEQCA · RCPSP instances | user effort eF: 95% -> 55%; 98% -> 52%; 99% -> 65%; 99% -> 64%; 98% -> 59% | Helped |
| also add cumulative and deadline constraints as background knowledge (ablation) | GEQCA with K1 · RCPSP instances | user effort eF: 55% -> 53%; 52% -> 49%; 65% -> 62%; 64% -> 61%; 59% -> 58% | Helped |
| use cutoff = 2s instead of cutoff = 3,600s (ablation) | GEQCA with K=∅ or K1 · RCPSP instances | user effort eF | No clear effect |
| use cutoff = 2s instead of cutoff = 3,600s (ablation) | GEQCA with K1∧K2 · sch 30 2 and sch 60 3 | user effort eF: 48% -> 49%; 57% -> 58% | Hurt |
Closest papers by meaning
- Learning to Learn in Interactive Constraint Acquisition (AAAI 2024 · similarity 0.86)
- On the Modelling of Constraints with Tractable Logical Operators (AAAI 2025 · similarity 0.85)
- Generalizing Constraint Models in Constraint Acquisition (AAAI 2025 · similarity 0.85)
- What Are the Rules? Discovering Constraints from Data (AAAI 2024 · similarity 0.85)
- An Automatic Sound and Complete Abstraction Method for Generalized Planning with Baggable Types (AAAI 2025 · similarity 0.84)
- Self-Supervised Transformers as Iterative Solution Improvers for Constraint Satisfaction (ICML 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.