Research map / Learning theory and algorithms / Combinatorial and search optimization
Sweep-Based Propagation for String Constraint Solving
Roberto Amadini, Graeme Gange, Peter Stuckey
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 SWEEP propagation instead of COVER for dashed-string equality | G-Strings · SQLInjection benchmark | average solving time (s): 135.35 -> 0.02 | Improved |
| use SWEEP propagation instead of COVER | G-Strings · New SQLInjection, all instances, length 10000 | average solving time (s): 600.0 -> 164.49 | Improved |
| use SWEEP propagation instead of COVER | G-Strings · New SQLInjection, percentage solved | % solved: 12.5 -> 100.0 at length 1000 | Improved |
| use SWEEP propagation vs COVER on unsatisfiable instances at 5000 | G-Strings · New SQLInjection, unsatisfiable, length 5000 | average solving time (s): 600.0 -> 69.58 | Improved |
| use SWEEP (weaker pruning, linear time) instead of COVER on NORN problems | G-Strings · NORN benchmarks (non-SQL) | average solving time (s): 0.0 -> 0.0 | No clear effect |
| use SWEEP instead of GECODE+S | G-Strings · New SQLInjection, all instances | average solving time (s): 243.82 -> 0.95 at length 1000 | Improved |
Closest papers by meaning
- Length Generalization for Transformers via Compression (NeurIPS 2026 · similarity 0.78)
- Constrained Decoding for Diffusion Language Models via Efficient Inference over Finite Automata (NeurIPS 2026 · similarity 0.78)
- Exploiting Symmetries in MUS Computation (AAAI 2025 · similarity 0.78)
- DINGO: Constrained Inference for Diffusion LLMs (NeurIPS 2025 · similarity 0.78)
- StringLLM: Understanding the String Processing Capability of Large Language Models (ICLR 2025 · similarity 0.77)
- The Impact of Literal Sorting on Cardinality Constraint Encodings (AAAI 2025 · similarity 0.77)
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.
