REVIEW 2 cited by
Intensional FOL: Many-Sorted Extension
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
The concepts used in IFOL have associated to them a list of sorted attributes, and the sorts are the intensional concepts as well. The requirement to extend the unsorted IFOL (Intensional FOL) to many-sorted IFOL is mainly based on the fact that a natural language is implicitly many-sorted and that we intend to use IFOL to support applications that use natural languages. Thus, the proposed version of many-sorted IFOL is just the completion of this conceptual feature of the IFOL.
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.