Reasoning with Finite Sets and Cardinality Constraints in SMT
We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for modeling program constructs directly. More importantly, set...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Logical Methods in Computer Science e.V.
2018-11-01
|
| Schriftenreihe: | Logical Methods in Computer Science |
| Schlagworte: | |
| Online-Zugang: | https://lmcs.episciences.org/3155/pdf |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|