Comparing expressiveness of set constructor symbols

In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove that they are not mutually expressible by means of existentially quantified formulae. In order to prove our results, canonical forms for set-theoretic and multiset-theoretic formulae are established and a particularly natural axiomatization of multisets is given and studied. Keywords. Sets and Multisets Theory, Unification, Constraints.

• Type: Conference
• Year: 1999
• Where: AGP
• Authors: Agostino Dovier, Carla Piazza, Alberto Policriti
• Keywords: AGP 1999, Artificial Intelligence, Common Operators, Multisets, Relative Expressive Power