A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Efficient Automated Reasoning About Sets and Multisets with Cardinality Constraints
[chapter]
2020
Lecture Notes in Computer Science
When reasoning about container data structures that can hold duplicate elements, multisets are the obvious choice for representing the data structure abstractly. However, the decidability and complexity of constraints on multisets has been much less studied and understood than for constraints on sets. In this presentation, we outline an efficient decision procedure for reasoning about multisets with cardinality constraints. We describe how to translate, in linear time, multisets constraints to
doi:10.1007/978-3-030-51074-9_1
fatcat:t5rmotq7ofdibd72emsnuhrity