Home>>Applications

Approach procedural CNP-solutions - Selection Sort
Generic Systematic Search BACKRACKING

declarative and hybrid CNP-solutions STATE SPACE SEARCH BACKTRACKING Approach 1: Complete CN, copy of the Simple State Space Approach 2: Complete CN, copy of the State Space Approach 3: Iterative CN Approach 4: Recursive CN

COST-LIMITED SEARCH Approach 1: Complete CN, copy of the Simple State Space Approach 2: Recursive CN

DEPTH-LIMITED SEARCH Approach 1: Complete CN, copy of the Simple State Space Approach 2: Iterative CN Approach 3: Recursive CN

Optimal Search (version of BRANCH-AND-BOUND) Approach 1: Complete CN, copy of the Simple State Space

HILL-CLIMBING Approach 1: Complete CN, copy of the Simple State Space Approach 2: Recursive CN HILL-CLIMBING with forbidden downhill-movements - Map Traversal Problem

IRREVOCABLE HILL-CLIMBING â€“ (like HILL-CLIMBING but with [NUMBEROFARROWS=1] or [BACKTRACKING=NO]) Approach 1: Complete CN, copy of the Simple State Space Approach 2: Recursive CN HILL-CLIMBING with forbidden downhill-movements - Map Traversal Problem

HILL-CLIMBING with limited revocability - like HILL-CLIMBING but with [NUMBEROFARROWS=b] Approach 1: Complete CN, copy of the Simple State Space Approach 2: Recursive CN HILL-CLIMBING with forbidden downhill-movements - Map Traversal Problem

STOCHASTIC HILL-CLIMBING Approach 1: Complete CN, copy of the Simple State Space Approach 2: Recursive CN

FIRST-CHOICE HILL-CLIMBING Approach 1: Complete CN, copy of the Simple State Space

SIMULATED ANNEALING â€“ hybrid solution

CONSTRAINT SATISFACTION PROBLEMS â€“ 8-QUEENS PROBLEM BACKTRACKING-Ð¿Ð¾Ð´Ñ…Ð¾Ð´ - FORWARD CHECKING with static and dynamic variable and value ordering heuristics (MRV, degree and LCV)
- FORWARD CHECKING with static static variable and value ordering heuristics (degree and static LCV)
- FORWARD CHECKING
- Stochastic FORWARD CHECKING (Forward Checking with random variable and value ordering)

LOCAL SEARCH

CONSTRAINT SATISFACTION PROBLEMS â€“ 8-QUEENS PROBLEM BACKTRACKING-Ð¿Ð¾Ð´Ñ…Ð¾Ð´ - FORWARD CHECKING with static and dynamic variable and value ordering heuristics (MRV, degree and LCV)
- FORWARD CHECKING with static static variable and value ordering heuristics (degree and static LCV)
- FORWARD CHECKING
- Stochastic FORWARD CHECKING (Forward Checking with random variable and value ordering)

LOCAL SEARCH

IDENTIFICATION AND DIAGNOSTIC PROBLEMS IDENTIFICATION AND DIAGNOSTIC PROBLEMS Simulating core Prolog AND ITS Computation Control

Papers Melbourne Portland Cambridge 1 Cambridge 2 Ruse 1 Ruse 2 Cardiff 1 Cardiff 2 - Non-recursive Hill-Climbing solution with usage of control state ORDER
- Non-recursive Hill-Climbing solution using control state RANGE
- HILL-CLIMBING with a Recursive CN
- IRREVOCABLE HILL-CLIMBING allowing downhill-movements with a Complete CN
- IRREVOCABLE HILL-CLIMBING not allowing downhill-movements with a Complete CN
- IRREVOCABLE HILL-CLIMBING with a Recursive CN
- HILL-CLIMBING with limited revocability allowing downhill-movements with a Complete CN
- HILL-CLIMBING with limited revocability not allowing downhill-movements with a Complete CN
- HILL-CLIMBING with limited revocability with a Recursive CN
- STOCHASTIC HILL-CLIMBING with a Complete CN
- STOCHASTIC HILL-CLIMBING with a Recursive CN
- FIRST-CHOICE HILL-CLIMBING with a Complete CN
- SIMULATED ANNEALING for the Traveling Salesperson

Kayseri Plovdiv Generic Systematic Search (DEPTH-FIRST WITH LEAP-FROGGING, BREADTH-FIRST, UNIFORM-COST, BEST-FIRST, A*) - Non-recursive Hill-Climbing solution using control state RANGE
- HILL-CLIMBING with a Recursive CN
- SIMULATED ANNEALING for the Traveling Salesperson

KBASE 1 KBASE2 Generic Systematic Search (DEPTH-FIRST WITH LEAP-FROGGING, BREADTH-FIRST, UNIFORM-COST, BEST-FIRST, A*) - Declarative solution for the Monkey-and-banana problem â€“ representing the room
- Declarative solution for the Monkey-and-banana problem â€“ representing the state space
- Declarative solution for the Monkey-and-banana problem - iterative CN
- Declarative solution for the Monkey-and-banana problem - recursive CN
- Non-recursive Hill-Climbing solution with usage of control state ORDER
- Non-recursive Hill-Climbing solution using control state RANGE
- HILL-CLIMBING with a Recursive CN
- IRREVOCABLE HILL-CLIMBING allowing downhill-movements with a Complete CN
- IRREVOCABLE HILL-CLIMBING not allowing downhill-movements with a Complete CN
- RREVOCABLE HILL-CLIMBING with a Recursive CN
- HILL-CLIMBING with limited revocability allowing downhill-movements with a Complete CN
- HILL-CLIMBING with limited revocability not allowing downhill-movements with a Complete CN
- HILL-CLIMBING with limited revocability with a Recursive CN
- STOCHASTIC HILL-CLIMBING with a Recursive CN
- FIRST-CHOICE HILL-CLIMBING with a Complete CN
- SIMULATED ANNEALING for the Traveling Salesperson

Macau Ruse 2012 Emi WSEAS Transactions - FORWARD CHECKING with static and dynamic variable and value ordering heuristics (MRV, degree and LCV)
- FORWARD CHECKING with static static variable and value ordering heuristics (degree and static LCV)
- FORWARD CHECKING
- Stochastic FORWARD CHECKING (Forward Checking with random variable and value ordering)
- CBLS with most conflicted variable chosen
- Stochastic CBLS (CBLS with randomly chosen conflicted variable)

Interlaken KK WSEAS Transactions

Problems Technical Examples Map Traversal Problem (MTP) - Generic Systematic Search (DEPTH-FIRST WITH LEAP-FROGGING, BREADTH-FIRST, UNIFORM-COST, BEST-FIRST, A*)
- Procedural BACKRACKING
- Declarative BACKRACKING with a Complete CN (one solution)
- Declarative BACKRACKING with a Complete CN (all solutions)
- Declarative BACKRACKING with a Complete CN (find cost/length of the solution)
- Declarative BACKRACKING with an Iterative CN (global variable and one subnet)
- Declarative BACKRACKING with an Recursive CN
- COST-LIMITED SEARCH with a Complete CN
- DEPTH-LIMITED SEARCH with an Iterative CN
- DEPTH-LIMITED SEARCH with an Recursive CN
- Optimal Search (version of BRANCH-AND-BOUND)
- HILL-CLIMBING allowing downhill-movements with a Complete CN
- HILL-CLIMBING not allowing downhill-movements with a Complete CN
- HILL-CLIMBING with a Recursive CN and primitives, mixing condition and action
- HILL-CLIMBING with a Recursive CN and constants as actual subnetâ€™s parameters
- IRREVOCABLE HILL-CLIMBING allowing downhill-movements with a Complete CN
- IRREVOCABLE HILL-CLIMBING not allowing downhill-movements with a Complete CN
- IRREVOCABLE HILL-CLIMBING with a Recursive CN and primitives, mixing condition and action
- IRREVOCABLE HILL-CLIMBING with a Recursive CN and constants as actual subnetâ€™s parameters
- HILL-CLIMBING with limited revocability allowing downhill-movements with a Complete CN
- HILL-CLIMBING with limited revocability not allowing downhill-movements with a Complete CN
- HILL-CLIMBING with limited revocability with a Recursive CN and primitives, mixing condition and action
- HILL-CLIMBING with limited revocability with a Recursive CN and constants as actual subnetâ€™s parameters
- STOCHASTIC HILL-CLIMBING with a Complete CN
- STOCHASTIC HILL-CLIMBING with a Recursive CN
- FIRST-CHOICE HILL-CLIMBING with a Complete CN

Missionaries and Cannibals Problem Ðœonkey and Banana Problem - Declarative BACKRACKING with a Complete CN (copy of the Simple State Space)
- Declarative BACKRACKING with a Complete CN (copy of the State Space)
- Declarative BACKRACKING with an Iterative CN (global variable and 2 subnets)
- Declarative BACKRACKING with an Recursive CN (constants as actual subnetâ€™s parameters)

8-tiles Puzzle The Traveling Salesperson The 8-Queens Problem - FORWARD CHECKING with static static variable and value ordering heuristics (degree and static LCV)
- FORWARD CHECKING
- Stochastic FORWARD CHECKING (Forward Checking with random variable and value ordering)
- CBLS with most conflicted variable chosen
- Stochastic CBLS (CBLS with randomly chosen conflicted variable)

Animal Identification Problem NFA NCFG Nondeterministic Turing machine Probabilistic Turing machine PROLOG Selection Sort Pushdown Automata Water Jugs Problem