Pith. sign in

REVIEW 1 cited by

Deep Symbolic Learning: Discovering Symbols and Rules from Perceptions

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

arxiv 2208.11561 v2 pith:5VUHM6OD submitted 2022-08-24 cs.LG cs.AI

classification cs.LGcs.AI
keywords symbolicperceptionfunctionslearningsymbolsnesycompositioncontinuous
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Neuro-Symbolic (NeSy) integration combines symbolic reasoning with Neural Networks (NNs) for tasks requiring perception and reasoning. Most NeSy systems rely on continuous relaxation of logical knowledge, and no discrete decisions are made within the model pipeline. Furthermore, these methods assume that the symbolic rules are given. In this paper, we propose Deep Symbolic Learning (DSL), a NeSy system that learns NeSy-functions, i.e., the composition of a (set of) perception functions which map continuous data to discrete symbols, and a symbolic function over the set of symbols. DSL learns simultaneously the perception and symbolic functions while being trained only on their composition (NeSy-function). The key novelty of DSL is that it can create internal (interpretable) symbolic representations and map them to perception inputs within a differentiable NN learning pipeline. The created symbols are automatically selected to generate symbolic functions that best explain the data. We provide experimental analysis to substantiate the efficacy of DSL in simultaneously learning perception and symbolic functions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Interpretable Hierarchical Concept Reasoning through Attention-Guided Graph Learning

    cs.LG 2025-06 conditional novelty 5.0 of 10

    H-CMR is a concept-based classifier whose concept and task predictions are made by attention-selected logic rules over a learned acyclic concept graph.

Pith tools