Similar Items: Global Numerical Constraints on Trees
- Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
- Automatic Modular Abstractions for Template Numerical Constraints
- Visibly Tree Automata with Memory and Constraints
- The complexity of global cardinality constraints
- Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
- RealPaver 1.1: A C++ Library for Constraint Programming over Numeric or Mixed Discrete-Continuous Domains