An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints (Q5191405): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-03251-6_3
+Normal rank
@@ Property / OpenAlex ID @@
+W1602055202
@@ Property / OpenAlex ID: W1602055202 / rank @@
+Normal rank
@@ Property / cites work @@
+Principles of Constraint Programming
@@ Property / cites work: Principles of Constraint Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Expressiveness of full first-order constraints in the algebra of finite or infinite trees
+Normal rank
@@ Property / cites work @@
+A Full First-Order Constraint Solver for Decomposable Theories
+Normal rank
@@ Property / cites work @@
+Theory of finite or infinite trees revisited
@@ Property / cites work: Theory of finite or infinite trees revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposable theories
@@ Property / cites work: Decomposable theories / rank @@
+Normal rank
@@ Property / cites work @@
+Extension of First-Order Theories into Trees
@@ Property / cites work: Extension of First-Order Theories into Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Frontiers of Combining Systems
@@ Property / cites work: Frontiers of Combining Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737134
@@ Property / cites work: Q4737134 / rank @@
+Normal rank
@@ Property / cites work @@
+A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
+Normal rank
@@ Property / cites work @@
+A decision procedure for term algebras with queues
+Normal rank