An agent capable of playing the explanation game.

The second iteration of the core inference engine for Wildwood

A dummy set of advocates and knowledge accessors with knowledge about the death of Julius Caesar.

An implementation of the DTree engine adapted to wildwood.schema propositions.

An implementation of the DTree engine adapted to wildwood.schema propositions.

The key point of building Bialowieza as a library rather than a complete application is that it should be possible to hook it up to multiple sources of knowledge. Thus we must design a protocol through which knowledge can be accessed, and a schema in which it will be returned. Note that the accessor must be able to add knowledge to the knowledge base, as well as retrieve it.

The knowledge representation. This probably ends up looking a bit like a Toulmin schema, where claims are represented as propositions. There also need to be rules or predicates, things which can test whether a given proposition has a given value. There may be other stuff in here.