Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of Computer Science. They have been analyzed from an axiomatic point of view with a parametric approach in [Dovier et al. 1998] where the relevant unification algorithms have been developed. In this paper we extend these results considering more general constraints, namely equality and membership constraints and their negative counterparts.
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets / Dovier, A; Piazza, C; Rossi, Gianfranco. - In: ACM TRANSACTIONS ON COMPUTATIONAL LOGIC. - ISSN 1529-3785. - 9 (3):(2008), pp. 1-29. [10.1145/1352582.1352583]
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
ROSSI, Gianfranco
2008-01-01
Abstract
Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of Computer Science. They have been analyzed from an axiomatic point of view with a parametric approach in [Dovier et al. 1998] where the relevant unification algorithms have been developed. In this paper we extend these results considering more general constraints, namely equality and membership constraints and their negative counterparts.| File | Dimensione | Formato | |
|---|---|---|---|
|
reprint_TOCL08.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
375.56 kB
Formato
Adobe PDF
|
375.56 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
