Non-procedural Implementation of Local Heuristic Search in Control Network Programming

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.

Syntax and Semantics for Cinnamon Programming

“…• User has very powerful control tools -control states and system options -in order to direct and control the CN traversal [24,25]. In particular, that allows simple 'visual' implementation of o heuristic algorithms [4,5,28] o nondeterministic algorithms [29] o randomized algorithms [30] • The programmer can define the solution scope, that is, how many solutions will be found (if they exist) -a single solution, a fixed in advance number of solutions, all solutions, prompting after each solution if another solution should be sought. For example, the recognizer of arithmetic expressions (Fig.…”

CINNAMONS : A Computation Model Underlying Control Network Programming

“…• User has very powerful control tools -control states and system options -in order to direct and control the CN traversal [24,25]. In particular, that allows simple 'visual' implementation of o heuristic algorithms [2,3,26] o nondeterministic algorithms [27] o randomized algorithms [28] • The programmer can define the solution scope, that is, how many solutions will be found (if they exist) -a single solution, a fixed in advance number of solutions, all solutions, prompting after each solution if another solution should be sought. For example, the recognizer of arithmetic expressions ( Fig.…”

Syntax and Semantics for Cinnamon Programming

“…Control Network Programming(or CNP) [2][3][4][5][6] is an unusual style of programming in which the program can be visualized as a set of graphs. The (main part of the) program is called a Control Network (CN).…”

“…4, and let Var = {z,x,y,…}. Let us first consider the function f (2) : N 2 N. It is easy to check that f (2) (7,3) = 4, f (2) (7,7) = 0, f (2) (7,0) = 7, and f (2) (3,7) = 0. f (1) (7) = f (2) (7,0 (2) (0,0) = 0. f (3) (7,3,8) = f (2) (7,3) = 4. f (4) (7,3,8,2) = f (2) (7,3) = 4.…”

“…In particular, that allows simple 'visual' implementation of o heuristic algorithms [4,5,28] o nondeterministic algorithms [29] o randomized algorithms [30] • The programmer can define the solution scope, that is, how many solutions will be found (if they exist) -a single solution, a fixed in advance number of solutions, all solutions, prompting after each solution if another solution should be sought. For example, the recognizer of arithmetic expressions (Fig.…”