Efficient automated reasoning about sets and multisets with cardinality constraints
From MaRDI portal
Publication:2096432
Cites work
- Automated Deduction – CADE-20
- Deciding Boolean algebra with Presburger arithmetic
- Fast Decision Procedures Based on Congruence Closure
- Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
- scientific article; zbMATH DE number 2090313 (Why is no real title available?)
- Linear Arithmetic with Stars
- Minimal solutions of linear diophantine systems : bounds and algorithms
- Multitree automata that count
- MUNCH -- automated reasoner for sets and multisets
- Semigroups, Presburger formulas, and languages
- Solving \(\mathrm{LIA}^\star\) using approximations
- Verification of threshold-based distributed algorithms by decomposition to decidable logics
Cited in
(7)- A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT
- scientific article; zbMATH DE number 3926286 (Why is no real title available?)
- scientific article; zbMATH DE number 7552282 (Why is no real title available?)
- Succinct ordering and aggregation constraints in algebraic array theories
- Generic multiset programming with discrimination-based joins and symbolic Cartesian products
- The expressive power of cardinality-bounded set values in object-based data models
- Integrating cardinality constraints into constraint logic programming with sets
This page was built for publication: Efficient automated reasoning about sets and multisets with cardinality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096432)
