CINNAMONS : A Computation Model Underlying Control Network Programming

摘要

We give the easily recognizable name “cinnamon” and “cinnamon programming” to a newcomputation model intended to form a theoretical foundation for Control NetworkProgramming (CNP). CNP has established itself as a programming paradigm combiningdeclarative and imperative features, built-in search engine, powerful tools for search controlthat allow easy, intuitive, visual development of heuristic, nondeterministic, and randomizedsolutions. We define rigorously the syntax and semantics of the new model of computation, atthe same time trying to keep clear the intuition behind and to include enough examples. Thepurposely simplified theoretical model is then compared to both while-programs (thusdemonstrating its Turing completeness), and the “real” CNP. Finally, future researchpossibilities are mentioned that would eventually extend the cinnamon programming into thedirections of non determinism, randomness and fuzziness.