Efficient automated reasoning about sets and multisets with cardinality constraints
type: Item
instance of: scholarly article
title: Efficient automated reasoning about sets and multisets with cardinality constraints
DOI: 10.1007/978-3-030-51074-9_1
author: Ružica Piskač
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 68V15
zbMATH DE Number: 7614503
zbMATH Keywords: multisets
zbMATH Keywords: cardinality constraints
zbMATH Keywords: linear interger arithmetic
describes a project that uses: MUNCH
describes a project that uses: z3
MaRDI profile type: Publication
full work available at URL: 978-3-030-51074-9 1
OpenAlex ID: W3039470177
cites work: Verification of threshold-based distributed algorithms by decomposition to decidable logics
cites work: Semigroups, Presburger formulas, and languages
cites work: Automated Deduction – CADE-20
cites work: Deciding Boolean algebra with Presburger arithmetic
cites work: Solving \(\mathrm{LIA}^\star\) using approximations
cites work: Multitree automata that count
cites work: Fast Decision Procedures Based on Congruence Closure
cites work: Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
cites work: Linear Arithmetic with Stars
cites work: MUNCH - Automated Reasoner for Sets and Multisets
cites work: Minimal solutions of linear diophantine systems : bounds and algorithms
cites work: Q4809072
description: scientific article; zbMATH DE number 7614503