This version uses our first draft of the SRW and prover machinery.

SRW includes parallel package structures for storing graphs using Java collections (which are easier to develop because you can see what the nodes are in a debugger) or GNU trove collections (which are faster, but convert all the nodes to ID numbers & is fairly unintelligible in a debugger). SRW vectors all use Java collections.

Provers are based on LogicProgramStates and use a Theta object to track variable assignments.

This version's runnables include ExampleCooker, Trainer, Tester, QueryAnswerer, GradientFinder, and Experiment.

Notable shortcomings of this version are minAlpha exceptions and issues resolving theta.