/* The stopping rule for this condition is obtained when
the current path to be expanded starts with the goal node, that is:
*/
(depthF (X |T) | PATHS) (X|T)
(goal X)
(depthF (PAth | TPaths) SOL)
(expand PAth NPaths)
(append NPaths TPaths NEWPATHS)
(depth
?(pp)(p
?(pp)(p
?(pp)(p
?(pp)(p
?(pp)(p
?(pp)(p
"+")
"+ demonstrate lemma generation:
+")
"+
obtain intermediate results and add them to the KB +")
"+ Programmed by: Anca Ralescu
+")
"+
+")
"+")
/*(nodes L) lists
the nodes, numbered from M to N, M < N of
(length () 0)
(length (H|T) N)(length T LN)(sum LN 1 N)
(outdeg_val X N)(findall (X Y)(connect X Y) L)(length L N)
(sol_hybridDB T S G SOL)
(kill goal)
(less_eq 0 T)
(less_eq T 5)
(addcl (goal G)
(outdeg_val S N)
(less N T)
(depthF (S) S1)
(reverse S1 SOL
Constraint Satisfaction Problems Chapter 5
August 15, 2016
Outline
CSP examples
Backtracking search for CSPs
Problem structure and problem decomposition
Local search for CSPs
Constraint satisfaction problems (CSPs)
1. Standard search problem: state is a b