Skip to content

Home

Jump to bottom
Patrick Hammer edited this page Apr 14, 2019 · 21 revisions

Welcome to the ANSNA Wiki! This is the system overview page, before diving into other sections, you may consider looking at https://github.com/patham9/ANSNA/wiki/System-graphs

ANSNA Overview The system performs implication and sequence formation, prediction and explanation steps, under attentional control, which then become concepts (except of the implications that serve as a kind of "predictive" link between concepts). These concepts try to predict other events based on the observation of the pattern they represent: For instance, concept a becomes a predictor for event b, so that after repeatedly observing ab, concept a will predict the occurrence of b after the observation of a, based on the within concept a, by Induction and Revision built predictive hypothesis a =/> b. Here, derived sequences feed back to the attention buffer, while a predictive hypothesis a =/> b directly goes back to a as post-condition implication and b as pre-condition implication (the green links in the diagram). The events&sequences, are however not terms like in OpenNARS, instead they are represented as a Sparse Distributed Representations (SDR). This allows the system to see new sequences as a special case of others with little resource effort, leading to the creation and usage of a taxonomy within the memory.

Since events can be goals, the knowledge a =/> b can also be used backwards by the concept, to generate goal a! based on goal b! as a form of Deduction.

Input: https://github.com/patham9/ANSNA/wiki/SDR:-Input

Attention buffer: A fixed-size priority queue, ordering events according to their Attention Value.

Concepts: A fixed-size priority queue, ordering concepts, named by SDR's according to their Attention Value.

Overall working cycle example: https://github.com/patham9/ANSNA/wiki/Cycle:-The-operating-cycle

Action: A fixed procedure triggered by the derivation of a goal of high desire value that got processed in its concept, see https://github.com/patham9/ANSNA/wiki/Cycle:-Decision-Making

Inference:

Revision (Link growth):
{Event a., Event a.} |- Event a.
{Event a!, Event a!} |- Event a!
{Implication <a =/> b>., Implication <a =/> b>.} |- Implication <a =/> b>.

Deduction (Prediction):
{Event a., Implicatiom <a =/> b>.} |- Event b.
{Event b!, Implication <a =/> b>.} |- Event a!
SDRMatch (https://github.com/patham9/ANSNA/wiki/SDRInheritance-for-matching,-and-its-truth-value)

Induction (Link formation):
{Event a., Event b.} |- Implication <a =/> b>.

Abduction (Retrospection):
{Event b., Implication <a =/> b>.} |- Event a.
{Event a!, Implication <a =/> b>.} |- Event b!

Intersection (Concept formation):
{Event a., Event b., after(b,a)} |- Event (&/,a,b).      (SDRTuple)
{Event a., Event b., concurrent(b,a)} |- Event (&|,a,b)  (SDRSet/Union)
where concurrent and after are excluding each other:
when the occurrence time of a and b is closer than Concurrent_MAX, concurrent(a,b) is true,
else either after(b,a) or after(a,b) is true.
Clone this wiki locally