We define the Same and UsedBy constraints. UsedBy takes two sets of variables X and Z such that jX j jZj and assigns values to them such that the multiset of values assigned to the variables in Z is contained in the multiset of values assigned to the variables in X . Same is the special case of UsedBy in which jX j = jZj. We show algorithms that achieve arc-consistency and boundconsistency for ...

Marco Buratti has conjectured that, given an odd prime p and a multiset L containing p − 1 integers taken from {1, . . . , p−1 2 }, there exists a Hamiltonian path in the complete graph with p vertices whose multiset of edge-lengths is equal to L modulo p. We give a positive answer to this conjecture in the case of multisets of the type {1, 2, 3} by completely classifying such multisets that ar...

In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be applied to all or at least some members of a multiset of graphs simultaneously providing a computational step with the possibility of massive parallelism in this way. As a consequence, graph problems in the class NP can...

We introduce a modelling framework and computational paradigm called Colonies of Synchronizing Agents (CSAs) inspired by the intracellular and intercellular mechanisms in biological tissues. The model is based on a multiset of agents in a common environment. Each agent has a local state stored in the form of a multiset of atomic objects, which is updated by global multiset rewriting rules eithe...

Gammall og is a logic language based on multiset rewriting. The language combines the ability of describing parallel programs made of multiset transformation rules as in GAMMA with the execution model of logic programming in a strongly typed framework as in GG odel. We describe the design choices, the syntax, and the semantics. Gammall og has a standard model theoretic semantics expressed in te...

This paper describes a general framework for designing purely functional datatypes that automatically satisfy given size or structural constraints. Using the framework we develop implementations of different matrix types (eg square matrices) and implementations of several tree types (eg Braun trees, 2-3 trees). Consider, for instance, representing square n n matrices. The usual representation u...

Fuzzy multiset is applicable as a model of information retrieval because it has the mathematical structure which expresses the number and the degree of attribution of an element simultaneously. Therefore fuzzy multisets can be used also as a suitable model for document clustering. This paper aims at developing clustering algorithms based on a fuzzy multiset model for document clustering. The st...

Systolic automata are models of highly-concurrent language acceptors based on identical processors with one-way flow of information, amenable to efficient hardware implementation as multiprocessor chips. In this paper we investigate the relationship between Binary Systolic TreeAutomata (BSTA), inwhich the underlying communication structure is an infinite complete binary tree with parallel botto...

Formal analysis of security protocols is largely based on a set of assumptions commonly referred to as the Dolev-Yao model. Two formalisms that state the basic assumptions of this model are related here: strand spaces [6] and multiset rewriting with existential quantification [2, 5]. Although it is fairly intuitive that these two languages should be equivalent in some way, a number of modificat...

Multisets are the fundamental data structure of P systems [12]. In this paper we relate P systems with the language and theory for multisets presented in [5]. This allows us, on the one hand, to define and implement P systems using multiset constraints in a constraint logic programming framework, and, on the other hand, to define and implement constraint solving procedures used to test multiset...