sdcondon 

Core graph theory interfaces, to allow for graph algorithms that do not depend on a particular graph representation.

Basic but fully functional and documented first-order logic implementations. Includes models for raw and CNF sentences, as well as extensible logic for creating, manipulating, formatting and indexing them.

FlUnit adapter for VSTest

A test framework within which tests are defined using a fluent builder.

Abstractions shared between the core FlUnit library and test platform adapters.

Graph search algorithms that work against any graph type implementing the interfaces defined in SCGraphTheory.Abstractions.

Mutable adjacency list graph implementation that implements the interfaces defined in SCGraphTheory.Abstractions.

Basic classical planning implementations. Includes a simple model for planning problems, as well planners that implement state-space search, goal-space search, and GraphPlan.

32- and 64-bit FreeType Windows DLLs, packaged as architecture-specific native runtime dependencies.

A few trie implementations for the storage of sets, facilitating fast retrieval of subsets and supersets of a query term.

Very basic knowledge base implementations that use the models defined by the SCFirstOrderLogic package.

A few simple first-order logic domains declared using the models found in the SCFirstOrderLogic package - for use in tests and demos.