The backward chaining inference engine is started to look for all sets of bindings which satisfy *
goal-to-prove*
. Using those each of bindings, *
pattern-to-instantiate*
is instantiated and returned as a list.

A list is returned containing zero or more occurrences of *
pattern-to-instantiate*
, each instantiated with a different set of bindings which satisfies *
goal-to-prove*
.

```
(findall '(?x is in (1 2 3)) '(member ?x (1 2 3)))
```

((1 is in (1 2 3))

(2 is in (1 2 3))

(3 is in (1 2 3)))

```
(findall '(?truck is a truck) '(truck ?truck))
```

((#<TRUCK TRUCK1> IS A TRUCK)

(#<TRUCK TRUCK2> IS A TRUCK))

KnowledgeWorks and Prolog User Guide (Macintosh version) - 4 Apr 2005