Goals

To create an interpreter for RPL that:

• Understands both statement sets and arguments
• Provides a high-level representation of the input (i.e. statements, their inner conjuncts, predicates, etc.)
• Provides a (separate from the parser) implementation of the truth tree method that allows creating graphs out of
• Allows checking for consistency of statement sets and formal validity of arguments