I am trying to understand this program and the respective forest. This is from the book Logic,Programming and Prolog by Ulf Nilsson.
In the main tree, why from ←off_gound(a) can you derive ⧠ ?
In the main tree, why was chosed on(b,a) first instead of on(c,b)?
Could someone please explain this?
Thank you so much in advance.