EventNet is an every day planner. It has 10,000 nodes about human activities and 30,000 directed links of action-goal relations.

The latest version of EventNet is written in common-lisp. We hope to have a distribution package soon.

There is an early version available in python called GoalNet.

Download GoalNet:

GoalNet is available here GoalNet

Please send any comments to jhe

Basic operations:

• GoalNet.find_path(initial_state,goal_state): Find the most plausible path between the initial state and the goal state.
• GoalNet.find_next_state(currentState): Find the actions that are more to happen next.
• GoalNet.find_previous_state(currentState): Find the actions that are likely to happen before.
• GoalNet.find_temporal_related_state(currentState): Assumes that GoalNet is a undirected graph and find the actions that are temporally related to it. It is the combination of GoalNet.fine_next_state and GoalNet.find_previous_state
  functions.