1. Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, et al. (eds.) [2], ch. 26, pp. 825–885.
2. Frontiers in Artificial Intelligence and Applications,2009
3. Fränzle, M., Herde, C., Teige, T., Ratschan, S., Schubert, T.: Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure. JSAT Special Issue on SAT/CP Integration 1, 209–236 (2007)
4. Lecture Notes in Computer Science;M. Fränzle,2008
5. Greifeneder, J., Frey, G.: Probabilistic hybrid automata with variable step width applied to the analysis of networked automation systems. In: Proc. 3rd IFAC Workshop on Discrete Event System Design. IFAC, pp. 283–288 (2006)