Solving constraints over strings is an emerging important field. Recently, a Constraint Programming approach based on dashed strings has been proposed to enable a compact domain representation for potentially large bounded-length string variables. In this paper, we present a more efficient algorithm for propagating equality (and related constraints) over dashed strings. We call this propagation sweep-based. Experimental evidences show that sweep-based propagation is able to significantly outperform state-of-the-art approaches for string constraint solving.
Sweep-based propagation for string constraint solving / Amadini R.; Gange G.; Stuckey P.J.. - ELETTRONICO. - (2018), pp. 6557-6564. (Intervento presentato al convegno 32nd AAAI Conference on Artificial Intelligence, AAAI 2018 tenutosi a usa nel 2018).
Sweep-based propagation for string constraint solving
Amadini R.
;
2018
Abstract
Solving constraints over strings is an emerging important field. Recently, a Constraint Programming approach based on dashed strings has been proposed to enable a compact domain representation for potentially large bounded-length string variables. In this paper, we present a more efficient algorithm for propagating equality (and related constraints) over dashed strings. We call this propagation sweep-based. Experimental evidences show that sweep-based propagation is able to significantly outperform state-of-the-art approaches for string constraint solving.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
