Publisher
Springer International Publishing
Reference14 articles.
1. Betz, H., Raiser, F., Frühwirth, T.: A complete and terminating execution model for constraint handling rules. Theor. Pract. Log. Program. 10, 597–610 (2010)
2. Lecture Notes in Computer Science;M Brockschmidt,2012
3. Endrullis, J., Zantema, H.: Proving non-termination by finite automata. In: LIPIcs-Leibniz International Proceedings in Informatics, vol. 36. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2015)
4. Frühwirth, T.: Constraint Handling Rules (Monography). Cambridge University Press, Cambridge (2009)
5. Lecture Notes in Computer Science;T Frühwirth,2015