Navigation  without Java Scripts

About PIE (Prolog Inference Engine)

Download. | Run directly on the WEB

The PIE interpreter is a little version of the core Prolog-engine that is used in Visual Prolog. You can use the PIE-application for 2 purposes:

  1. For testing small Prolog examples.
  2. For examining how an inference engine and a language can be designed very easily in Prolog.

pie.gif (5874 bytes)

Using PIE

Using PIE is very straightforward. Just type in statements and press return, and PIE will return a statement, indicating whether the statement is asserted in the facts- and rule-base, or an error.

Try for instance to assert some family relations by stating:

assert(son("Claus", "Jorgen")). assert(son("Jorgen","Knud")).

Now you can test that these facts has been asserted in the facts database by asking:

son("Claus","Jorgen").

and observing that PIE answers :

TRUE

or you could ask:

son(A,"Jorgen").

which should cause PIE to answer A="Claus"

In the same way many other Prolog predicate calls can be tested, using this little inference engine.
For more information about using PIE, please consult the help file supplied with the application.