A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT (Q2817912): Difference between revisions

@@ Property / describes a project that uses @@
+CVC4
@@ Property / describes a project that uses: CVC4 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-40229-1_7
+Normal rank
@@ Property / OpenAlex ID @@
+W2505706330
@@ Property / OpenAlex ID: W2505706330 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2740887
@@ Property / cites work: Q2740887 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503906
@@ Property / cites work: Q4503906 / rank @@
+Normal rank
@@ Property / cites work @@
+Polite Theories Revisited
@@ Property / cites work: Polite Theories Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding Boolean algebra with Presburger arithmetic
+Normal rank
@@ Property / cites work @@
+Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
+Normal rank
@@ Property / cites work @@
+Solving SAT and SAT Modulo Theories
@@ Property / cites work: Solving SAT and SAT Modulo Theories / rank @@
+Normal rank
@@ Property / cites work @@
+Sets with Cardinality Constraints in Satisfiability Modulo Theories
+Normal rank
@@ Property / cites work @@
+Q4737128
@@ Property / cites work: Q4737128 / rank @@
+Normal rank