## Generated by Codox

# Wildwood 0.1.0-SNAPSHOT

##### Released under the EPL-2.0 OR GPL-2.0-or-later WITH Classpath-exception-2.0

A general inference library using a game theoretic inference mechanism.

## Installation

To install, add the following dependency to your project or build file:

    [wildwood "0.1.0-SNAPSHOT"]

## Topics

- Against Truth
- Analysis
- Arboretum
- Arden
- The Bateson / Kammerer debate
- Bialowieza
- Errata
- Experience
- Hegemonic Argument
- History
- The Huxley / Kropotkin debate
- Implementing
- J'Accuse
- KnacqTools
- Manifesto
- On the First Dialogue of Hylas and Philonous
- The Problem
- Introduction to Wildwood

## Namespaces

### wildwood.advocate

An agent capable of playing the explanation game.

Public variables and functions:

- Advocate

### wildwood.bialowieza

The second iteration of the core inference engine for Wildwood

Public variables and functions:

- decide

### wildwood.caesar

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

Public variables and functions:

- anthony-kb
- april
- brutus-kb
- cassius-kb
- drusila-kb
- eighteenth-march
- faldo-db
- gaius-db
- ides-of-march
- longus-kb
- march

### wildwood.dengine.engine

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

Public variables and functions:

- decide

### wildwood.dengine.node

A dtree node.

Public variables and functions:

- colour
- node?

### wildwood.knowledge-accessor

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.

Public variables and functions:

- Accessor

### wildwood.mongo-ka

A knowledge accessor fetching from and storing to Mongo DB.

Public variables and functions:

### wildwood.schema

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.

Public variables and functions:

- argument-keys
- argument?
- consensual-keys
- minimise
- preserved-keys
- proposition?
- required-keys
- rule?
- truth