Logic contains rules of inference. A very basic one is the one
known as Modus Ponens. This takes the following form
from the formula `p implies q'
if proposition `p' is true
conclude that `q' is true
For example:
If John is drunk, then John is happy
John is drunk
John is happy
Prolog includes conditional formulae (like , but
with some syntactic reorganisation), and an algorithm for computing
inferences using Modus Ponens, but before we look at how rules are
represented in Prolog, we need to look in more detail at the
relationship between standard logic and Prolog.
Steve Harlow
2001-11-26