PLN and NARS Under Uncertain Term Probabilities

help edit space_dashboard
Draft — This content has not been approved for publication.

← Back to Publications

PLN and NARS Often Yield Similar strength × confidence Given Highly Uncertain Term Probabilities

Author: Ben Goertzel
Year: 2024
Venue: arXiv:2412.19524
Links: arXiv abstract

Summary

A comparative paper on uncertain reasoning in Probabilistic Logic Networks and NARS. It analyzes how deduction, induction, and abduction formulas in the two systems converge when term probabilities are highly uncertain, clarifying when the two reasoning frameworks behave similarly rather than as fundamentally incompatible approaches.

Relevance to Hyperon

This paper is directly relevant to PLN Full and the broader simplicity / uncertainty framework discussed in Weakness Theory. It is also useful to readers trying to understand why Hyperon-era reasoning work often treats PLN and NARS as overlapping tools in high-uncertainty settings rather than as isolated traditions.

Key References



Discussion