Skip to content
Pedro Fanha edited this page Jan 8, 2019 · 9 revisions

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.), using the parser language structures, plus Parser.ast().(is_statement_set()/as_statement_set() or is_argument()/as_argument()), StatementSet.is_consistent(), Argument.(premises() or conclusion())
  • Provides a (separate from the parser) implementation of the truth tree method that allows creating graphs out of
Clone this wiki locally