No abstract

No abstract

This report presents the general picture of how Control Network Programming can be effectively used for implementing various search strategies, both blind and informed. An interesting possibility is non-procedural solutions that can be developed for most local search algorithms. A generic solution is described for procedural implementations.

Control Network Programming (CNP) is a style of high-level programming that is especially effective for solving problems that have natural graph-like representation of imperative, declarative, or mixed nature. The 'program' is often nondeterministic. The report is aimed as a concise, 'modern', and relatively self-contained introduction to the background and philosophy of CNP, its implementation fundamentals, as well as its relationship to other programming paradigms.