Open ARCJ137442 opened 11 months ago
The rule "conjunction elimination" in NAL-5 "Statements as Term" can decompose $(A \wedge B).$ (or (&&, A, B).) into $A.$ and $B.$ (A. and B.).
(&&, A, B).
A.
B.
This is true both in NAL and in propositional logic, currently it is successfully tested in OpenNARS, but does not work in PyNARS.
To Reproduce You can input these narsese to the NARS console:
(&&, A, B). A? B?
It should output like this:
[ANSWER] A. [ANSWER] B.
We will need this one fixed for Pong, though simplifying goals, not judgments. ( I think the inference rules are different)
Describe the bug
The rule "conjunction elimination" in NAL-5 "Statements as Term" can decompose $(A \wedge B).$ (or
(&&, A, B).
) into $A.$ and $B.$ (A.
andB.
).This is true both in NAL and in propositional logic, currently it is successfully tested in OpenNARS, but does not work in PyNARS.
To Reproduce You can input these narsese to the NARS console:
Expected behavior
It should output like this:
Screenshots
OpenNARS 3.1.0
PyNARS
Environment (please complete the following information)