A Neuro-Symbolic Framework for Reasoning under Perceptual Uncertainty: Bridging Continuous Perception and Discrete Symbolic Planning
Jiahao Wu, Shengwen Yu
TL;DR
This work tackles the challenge of reasoning under perceptual uncertainty by proposing a probabilistic neuro-symbolic framework that ties continuous perception to discrete symbolic planning. It combines a Transformer-GNN translator to produce probabilistic predicates from visual input with an uncertainty-aware symbolic planner that can trigger information-gathering actions, all within a closed-loop execution. The paper contributes a dependency-aware uncertainty model (MRF-based), calibration-guided planning convergence guarantees, and an analytical optimum for planning thresholds, plus extensive empirical validation on 10,047 synthetic tabletop scenes showing symbol-prediction F1≈$0.68$ and average task success ≈$90.7 ext{%}$ with planning times in the $10$–$15$ ms range, outperforming strong POMDP baselines by $10$–$14$ percentage points. It also demonstrates principled links between perception calibration and planning performance, providing actionable design guidelines and releasing datasets and code to promote reproducibility and extension to broader domains.
Abstract
Bridging continuous perceptual signals and discrete symbolic reasoning is a fundamental challenge in AI systems that must operate under uncertainty. We present a neuro-symbolic framework that explicitly models and propagates uncertainty from perception to planning, providing a principled connection between these two abstraction levels. Our approach couples a transformer-based perceptual front-end with graph neural network (GNN) relational reasoning to extract probabilistic symbolic states from visual observations, and an uncertainty-aware symbolic planner that actively gathers information when confidence is low. We demonstrate the framework's effectiveness on tabletop robotic manipulation as a concrete application: the translator processes 10,047 PyBullet-generated scenes (3--10 objects) and outputs probabilistic predicates with calibrated confidences (overall F1=0.68). When embedded in the planner, the system achieves 94\%/90\%/88\% success on Simple Stack, Deep Stack, and Clear+Stack benchmarks (90.7\% average), exceeding the strongest POMDP baseline by 10--14 points while planning within 15\,ms. A probabilistic graphical-model analysis establishes a quantitative link between calibrated uncertainty and planning convergence, providing theoretical guarantees that are validated empirically. The framework is general-purpose and can be applied to any domain requiring uncertainty-aware reasoning from perceptual input to symbolic planning.
