2003/09/24 by Agostino Dovier, Dovier, Agostino, Carla Piazza +3 · 1 citation
Computer Science · #Advanced Algebra and Logic #D.3.3 #F.2.2 #F.4.1 #FOS: Computer and information sciences #I.1.2 #I.2.3 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Programming Languages (cs.PL) #Symbolic Computation (cs.SC) #cs.LO #cs.PL #cs.SC #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.cs/0309045
27 pages, 11 figures
arxiv created 2003/09/24 · openalex publication_date 2003/09/24 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of Computer Science. These data structures have been analyzed from an axiomatic point of view with a parametric approach in (*) where the relevant unification algorithms have been developed. In this paper we extend these results considering more general constraints including not only equality but also membership constraints as well as their negative counterparts. (*) A. Dovier, A. Policriti, and G. Rossi. A uniform axiomatic view of lists, multisets, and sets, and the relevant unification algorithms. Fundamenta Informaticae, 36(2/3):201--234, 1998.