Uncategorised
NARS is a universal reasoning system, like a "universal Turing Machine" that can emulate any Turing Machine, and serves as a formal model of an intelligent system
Read more: Where to use NARS?NARS is adaptive to its experience, and therefore is situated and embodied. Its beliefs summarize the system's experience (rather than describe the world as it is), Read more: Why NARS?
Pavol Durisek
durisekp at applied-nars.com
NARS (Non-Axiomatic Reasoning System) is a project aimed at the building of a general-purpose intelligent system, or a "thinking machine" that follows the same principles as the human mind, Read more: What is NARS?
This software is free to use and redistribute for any purposes. It is still in its alpha stage, so it might crash, hang or behave unexpectedly at any time.
All platforms | test1.nars | |
test2.nars | ||
test3.nars | ||
test3.1.nars | ||
test3.2.nars | ||
test3.3.nars | ||
test4.nars | ||
test5.nars | ||
test6.2.nars | ||
etest.nars | ||
Windows 64-bit | NARS library 0.5.3 (76.2 kB) | |
NarsDevelop 0.5.1 binary(6.04 MB) | ||
Windows 32-bit | NARS library 0.5.3 (67.5 kB) | |
Linux 32-bit | NARS library 0.5.3 (108 kB) | |
Linux 64-bit | NARS library 0.5.3 (114 kB) | |
OSX | coming soon... | |
Android | coming soon... |
Changes
-
NARS library 0.5.3
-
Fixed some issues with following equivalence theorems:
(S1 × S2) → (P1 × P2) ⇔ (S1 → P1) ∧ (S2 → P2) (S1 × S2) ↔ (P1 × P2) ⇔ (S1 ↔ P1) ∧ (S2 ↔ P2)
-
Added generating sub-questions to first order syllogistic rules limited for the examples above:
(x → P) (S → P)? // generated sub-question (S → x)?
-