Problem
1. Comment the following statement: "In logic programming, a program used to generate a result can be used to check that an input value is indeed a result." Discuss how existing programming languages approximate this general statement.
2. Find the most general unifier for f (X, g (a, Z, W), a, h (X, b, W)) and f (h (a, Z), g (a, h (Z, b), X), Z, h (d, b, a))