I have been given a task which I'm having alot of trouble with. Any help would be appreciated.
Given the definite clauses below:
edge(A,B).
edge(A,C).
edge(B,D).
reachable(A).
reachable(x) <- edge(y,x), reachable
.
Use backward chaining with backtracking to explain how one can obtain all the alternative solutions for the goal reachable(x).
I'm completely lost. I have no idea what I'm supposed to do.
I'm also confused about how I'm supposed to show mu working.
Thanks.
Given the definite clauses below:
edge(A,B).
edge(A,C).
edge(B,D).
reachable(A).
reachable(x) <- edge(y,x), reachable
.Use backward chaining with backtracking to explain how one can obtain all the alternative solutions for the goal reachable(x).
I'm completely lost. I have no idea what I'm supposed to do.
I'm also confused about how I'm supposed to show mu working.
Thanks.