close fullscreen

Hyperon AI Algorithms+PLN (Probabilistic Logic Networks)

help edit space_dashboard
Review AI Draft →
human approved
more_horiz
open_in_full page
fullscreen modal
edit edit
space_dashboard advanced
human authored
more_horiz
open_in_full page
fullscreen modal
edit edit
space_dashboard advanced
reasoning
more_horiz
open_in_full page
fullscreen modal
edit create
space_dashboard advanced

PLN is Hyperon's primary symbolic reasoning system designed to operate under uncertainty, enabling real-time inference when information is incomplete, noisy, or probabilistic. Unlike classical logic systems that assume binary truth values, PLN represents beliefs with graded confidence and updates them continuously as new evidence arrives. It supports deductive, inductive, and abductive reasoning within a single formal framework, allowing the system not only to apply known rules, but also to generalize from experience, form hypotheses, and revise beliefs over time. Conceptually, PLN can be thought of as a logic-based analogue of statistical learning, with explicit semantics and traceable inference steps.

Technically, PLN operates over an Atomspace, a graph-structured knowledge representation in which concepts, relations, and experiences are linked together with probabilistic truth values. Reasoning proceeds by transforming and combining these links using principled inference rules grounded in probability theory. This allows PLN to perform tasks such as causal reasoning, analogical inference, and abstraction, while maintaining transparency about why a conclusion was reached and how confident the system is in it. Because PLN was designed to handle uncertainty, it degrades gracefully: when evidence is sparse or conflicting, it produces tentative conclusions rather than brittle failures.

To ensure computational tractability within the massive scale of the Atomspace, PLN leverages forward and backward chaining inference control and can also call on ECAN (Economic Attention Allocation) to dynamically filter the knowledge graph into a temporary working memory of high-salience facts. This attention-driven constraint allows the system to perform deep, complex reasoning in real-time without succumbing to the combinatorial explosions inherent in processing the full breadth of stored knowledge.

Repositories

  • View on GitHub
  • PLN Experimental
  • Chaining

Demos

  • Categorical reasoning, reasoning with inheritance relations
  • Tuffy Smokes, reasoning with implications
  • Toothbrush declarative reasoning with implications and inheritances
  • PLN for embodied decision making (compatible with NARTECH-ROS)

Papers & Publications

  • Probabilistic Logic Networks A Comprehensive Framework for Uncertain Inference. Ben Goertzel, Matthew Ikle, Izabela Freire Goertzel, Ari Heljakka. 2009.
  • Grounding Possible Worlds Semantics in Experiential Semantics. Matthew Ikle, Ben Goertzel. 2010.
  • Probabilistic Logic Networks for Temporal and Procedural Reasoning. Nil Geisweiller, Hedra Yusuf. 2023.

Continue Reading

  • PLN Primer
  • PLN Deep Dive