Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars

DOI10.1007/978-3-540-87531-4_11zbMath1156.68475OpenAlexW1569142104MaRDI QIDQ3540175

Viktor Kuncak, Ruzica Piskac

Publication date: 20 November 2008

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_11

zbMATH Keywords

setsfuzzy setsmultisetscardinality operatormixed linear integer-rational arithmeticverification and program analysis

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25)

Related Items (1)

Efficient automated reasoning about sets and multisets with cardinality constraints

Cites Work

• Deciding Boolean algebra with Presburger arithmetic
• Multitree automata that count
• Carathéodory bounds for integer cones
• Semigroups, Presburger formulas, and languages
• The first order properties of products of algebraic systems
• Linear Arithmetic with Stars
• Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
• Decision Procedures for Multisets with Cardinality Constraints
• Fuzzy sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars