WSEAS Transactions on Computers
Print ISSN: 1109-2750, E-ISSN: 2224-2872
Volume 12, 2013
Declarative Implementations of Search Strategies for Solving CSPs in Control Network Programming
Author:
Abstract: The paper describes one of the most researched techniques in solving Constraint Satisfaction Problems (CSPs) - searching which is well-suited for declarative (non-procedural) implementation in a new programming paradigm named Control Network Programming, and how this can be achieved using the tools for dynamic computation control. Some heuristics for variable and value ordering in backtracking algorithm, lookahead strategies, stochastic strategies and local search strategies are subjects of interest. The 8-queens problem is used to help in illustrating how these algorithms work, and how they can be implemented in Control Network Programming.
Search Articles
Keywords: Control Network Programming, graphical programming, declarative programming, Constraint Satisfaction Problem, MRV, degree, LCV and minimum-conflicts heuristics