Mechanism

Origin

Documentation of the technological origins of the used mechanisms.

Declarative

Declarative attention is implemented with an agenda like mechanism based on a "flat" table. This was heavily inspired by the "agenda" Mechanism which was used in AM("Automated Mathematician") and EURIKSO.

Storage

Declarative knowledge is stored in Nodes like in ALANN.

Procedural

Storage

Sentences are stored in "procedural nodes". Nodes were first implemented in ALANN.

Decision making

TV

The TV of declarative impl seq's is stored as explicit success and count integer values. They are used to compute frequency and confidence as described in the publications of AERA.

Forward-Planner

Forward planning is done similar to OpenNARS by considering current event(s) and trying to combine them with impl seq

a. :|:
<(a &/ ^x) =/> z>.
where z must be a goal which is "hit".

Backward-Planner

The backward planner is heavily inspired by AERA and is using NAL as described by Dr. Pei Wang

• goals are stored explicit in a table "goal table" and can get "hit"
• take goal from table and try to derive new goal(s) with impl seq