Turning commonly occurring types or schemas of rules into new predicates speeds up inference processes by avoiding the need for complicated graph walks or theorem proving. Redundantly storing the transitive closure of transitive relations in a table can also speed up the process significantly.