Symbolic derivation of formulas is mainly based on the chain rule. This rule reduces the derivation of the composition of two functions to the derivation of each separate function. The chain rule reads as follows:
dy(u) dy(u) du
----- = ----- --
dx du dx
Early implementations of symbolic derivation were reported with LISP. The Prolog implementation can take advantage of pattern matching. Our test predicate will not perform a simplification of the resulting expressions. The benchmark is already found in D.H.D. Warren’s thesis [2, page 222].
One test iteration will derive the ops8, the divide10, the log10
the times10 examples.