Efficient automated reasoning about sets and multisets with cardinality constraints

DOI10.1007/978-3-030-51074-9_1OpenAlexW3039470177MaRDI QIDQ2096432

Ruzica Piskac

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-51074-9_1

zbMATH Keywords

cardinality constraintsmultisetslinear interger arithmetic

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items

Unnamed Item

Uses Software

• z3
• MUNCH

Cites Work

• Unnamed Item
• Solving \(\mathrm{LIA}^\star\) using approximations
• Deciding Boolean algebra with Presburger arithmetic
• Multitree automata that count
• Semigroups, Presburger formulas, and languages
• Linear Arithmetic with Stars
• Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
• Fast Decision Procedures Based on Congruence Closure
• Minimal solutions of linear diophantine systems : bounds and algorithms
• Automated Deduction – CADE-20
• MUNCH - Automated Reasoner for Sets and Multisets
• Verification of threshold-based distributed algorithms by decomposition to decidable logics