列表、多集、紧列表和集合约束求解的统一方法
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
摘要：
列表、多集和集合是众所周知的数据结构，其有用性在计算机科学的各个领域中得到广泛认可。这些数据结构已从公理的观点与参数的方法进行了分析（*），其中相关的统一算法已经开发。在本文中，我们扩展这些结果考虑更一般的约束，不仅包括平等，而且成员资格的限制，以及他们的负面同行。（*）A. Dovier，A. Policriti和G.罗西列表、多重集和集合的统一公理视图，以及相关的统一算法。Fundamenta Informaticae，36（2/3）：201- 234，1998.
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
