ROMANIAN JOURNAL OF INFORMATION SCIENCE AND
TECHNOLOGY
Volume 4, Numbers 1-2, 2001, 59 - 576
Multiset Rewriting by Multiset
Constraint Solving*
Agostino DOVIER1,
Carla PIAZZA2, Gianfranco ROSSI3
1Dip. Scientifico-Tecnologico, Univ. di Verona, Italy
2Dip. di Matematica e Informatica, Univ. di Udine, Italy
3Dip. di Matematica, Univ. di Parma, Italy
Abstract.
Term-like
theories of multisets have been recently studied from an axiomatic point of view and
constraint solving algorithms have been developed. In this paper we summarize these
results and we show how they can be exploited to develop multiset rewriting based
applications. Specifically, we present a simple yet powerful declarative implementation of
GAMMA, a computational framework based on multiset rewriting, using a CLP language
embedding the constraint solving mechanism previously developed.
*The work is partially supported by MURST project Certificazione automatica di
programmi mediante interpretazione astratta. |