AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Sweep-Based Propagation for String Constraint Solving

Roberto Amadini, Graeme Gange, Peter Stuckey

AAAI 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: Structure and complexity of constraint reasoning · 11 citations (OpenAlex)

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 changedWhereMeasuredEffect
use SWEEP propagation instead of COVER for dashed-string equalityG-Strings · SQLInjection benchmarkaverage solving time (s): 135.35 -> 0.02Improved
use SWEEP propagation instead of COVERG-Strings · New SQLInjection, all instances, length 10000average solving time (s): 600.0 -> 164.49Improved
use SWEEP propagation instead of COVERG-Strings · New SQLInjection, percentage solved% solved: 12.5 -> 100.0 at length 1000Improved
use SWEEP propagation vs COVER on unsatisfiable instances at 5000G-Strings · New SQLInjection, unsatisfiable, length 5000average solving time (s): 600.0 -> 69.58Improved
use SWEEP (weaker pruning, linear time) instead of COVER on NORN problemsG-Strings · NORN benchmarks (non-SQL)average solving time (s): 0.0 -> 0.0No clear effect
use SWEEP instead of GECODE+SG-Strings · New SQLInjection, all instancesaverage solving time (s): 243.82 -> 0.95 at length 1000Improved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy