Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Solving ordinary differential equations I (2nd revised. ed.): nonstiff problems
Solving Polynomial Systems Using a Branch and Prune Approach
SIAM Journal on Numerical Analysis
Computing with continuous change
Science of Computer Programming - Special issue on concurrent constraint programming
Hybrid cc with Interval Constraints
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Multistep Filtering Operators for Ordinary Differential Equations
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Parameter Estimation Using Interval Computations
SIAM Journal on Scientific Computing
A multi-scale constraint programming model of alternative splicing regulation
Theoretical Computer Science - Special issue: Computational systems biology
Validated solutions of initial value problems for parametric ODEs
Applied Numerical Mathematics
Rigorous Inner Approximation of the Range of Functions
SCAN '06 Proceedings of the 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics
Brief paper: Rigorous parameter reconstruction for differential equations with noisy data
Automatica (Journal of IFAC)
Constraint reasoning in deep biomedical models
Artificial Intelligence in Medicine
Box consistency through adaptive shaving
Proceedings of the 2010 ACM Symposium on Applied Computing
Automatica (Journal of IFAC)
Improving SAT modulo ODE for hybrid systems analysis by combining different enclosure methods
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
δ-complete decision procedures for satisfiability over the reals
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Hi-index | 0.00 |
Coupling constraints and ordinary differential equations has numerous applications. This paper shows how to introduce constraints involving ordinary differential equations into the numerical constraint satisfaction problem framework in a natural and efficient way. Slightly adapted standard filtering algorithms proposed in the numerical constraint satisfaction problem framework are applied to these constraints leading to a branch and prune algorithm that handles ordinary differential equations based constraints. Preliminary experiments are presented.