Polynomial Constraints for Sets with Cardinality Bounds

DOI10.1007/978-3-540-71389-0_19MaRDI QIDQ5758056zbMATH OpenOpenAlexFDO

Authors Bruno Marnette, Viktor Kuncak, Martin C. Rinard

Publication date 7 September 2007

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71389-0_19

Mathematics Subject Classification ID

Logic in computer science (03B70) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Reasoning with finite sets and cardinality constraints in SMT
• Set constraints with intersection
• A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT
• Set constraints with projections
• Sets with cardinality constraints in satisfiability modulo theories

Cited in

(12)

• Cardinality constraints for arrays (decidability results and applications)
• Symbolic polytopes for quantitative interpolation and verification
• Multilinear sets with two monomials and cardinality constraints
• scientific article; zbMATH DE number 1692939 (Why is no real title available?)
• On cardinality constrained polymatroids
• Syllogistic logic with ``most
• On Intersection Problems for Polynomially Generated Sets
• Reasoning about set constraints applied to tractable inference in intuitionistic logic
• Reasoning with finite sets and cardinality constraints in SMT
• A complexity perspective on entailment of parameterized linear constraints
• Decision Procedures for Multisets with Cardinality Constraints
• Deciding Boolean algebra with Presburger arithmetic

This page was built for publication: Polynomial Constraints for Sets with Cardinality Bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758056)