Name
Abstract | ||
|---|---|---|
We consider the problem of deciding the theory of finite sets with cardinality constraints using a satisfiability modulo theories solver. Sets are a common high-level data structure used in programming; thus, such a theory is useful for modeling program constructs directly. More importantly, sets are a basic construct of mathematics and thus natural to use when formalizing the properties of computational systems. We develop a calculus describing a modular combination of a procedure for reasoning about membership constraints with a procedure for reasoning about cardinality constraints. Cardinality reasoning involves tracking how different sets overlap. For efficiency, we avoid considering Venn regions directly, as done previous work. Instead, we develop a novel technique wherein potentially overlapping regions are considered incrementally as needed. We use a graph to track the interaction among the different regions. Initial experimental results demonstrate that the new technique is competitive with previous techniques and scales much better on certain classes of problems. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-40229-1_7 | Proceedings of the 8th International Joint Conference on Automated Reasoning - Volume 9706 |
DocType | Volume | ISSN |
Journal | abs/1702.06259 | 0302-9743 |
Citations | PageRank | References |
7 | 0.46 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| kshitij bansal | 1 | 17 | 2.97 |
| Andrew Reynolds | 2 | 57 | 4.96 |
| Clark Barrett | 3 | 1268 | 108.65 |
| Cesare Tinelli | 4 | 1409 | 79.86 |