REVIEW 2 cited by
Intensional FOL over Belnap's Billatice for Strong-AI Robotics
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
AGI (Strong AI) aims to create intelligent robots that are quasi indistinguishable from the human mind. Like a child, the AGI robot would have to learn through input and experiences, constantly progressing and advancing its abilities over time. The AGI robot would require an intelligence more close to human's intelligence: it would have a self-aware consciousness that has the ability to solve problems, learn, and plan. Based on this approach an Intensional many-sorted First-order Logic (IFOL), as an extension of a standard FOL with Tarskian's semantics, is proposed in order to avoid the problems of standard 2-valued FOL with paradoxes (inconsistent formulae) and a necessity for robots to work with incomplete (unknown) knowledge as well. This is a more sophisticated version of IFOL with the same syntax but different semantics, able to deal with truth-ordering and knowledge-ordering as well, based on the well known Belnap's billatice with four truth-values that extend the set of classical two truth-values.
Forward citations
Cited by 2 Pith papers
-
Neuro-Symbolic Strong-AI Robots with Closed Knowledge Assumption: Learning and Deductions
AGI robots learn and deduce using Belnap's 4-valued bilattice and Closed Knowledge Assumption to expand knowledge while supporting inconsistencies and providing logical security.
-
Probabilistic Extension of Neuro-Symbolic AGI Robots based on Belnap's Typed Intensional FOL
A theoretical paper defines global and local 'symmetry transformations' to assign probabilities to unknown sentences in a Belnap four-valued intensional logic, with no implementation or validation.
Discussion (0). Sign in to comment.