Implementing other inference systems

We have shown how structures can represent graphs, sets, parse trees, and equations. We can also represent inference rules as structures, and write our own inference program (often called an inference engine) that operates on them. This way, we can implement

• Different logical systems from Prolog.

• The same logical system, but with a different execution strategy. For example, it might try all clauses in parallel, trying goal 1 of the first, then goal 1 of the second, and so on.

Examples are given in the programs uncertain.pl and bitstream.pl.