Pith. sign in

REVIEW 2 cited by

SLASH: Embracing Probabilistic Circuits into Neural Answer Set Programming

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 2110.03395 v4 pith:YPWYZNP3 submitted 2021-10-07 cs.AI

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

The goal of combining the robustness of neural networks and the expressivity of symbolic methods has rekindled the interest in neuro-symbolic AI. Recent advancements in neuro-symbolic AI often consider specifically-tailored architectures consisting of disjoint neural and symbolic components, and thus do not exhibit desired gains that can be achieved by integrating them into a unifying framework. We introduce SLASH -- a novel deep probabilistic programming language (DPPL). At its core, SLASH consists of Neural-Probabilistic Predicates (NPPs) and logical programs which are united via answer set programming. The probability estimates resulting from NPPs act as the binding element between the logical program and raw input data, thereby allowing SLASH to answer task-dependent logical queries. This allows SLASH to elegantly integrate the symbolic and neural components in a unified framework. We evaluate SLASH on the benchmark data of MNIST addition as well as novel tasks for DPPLs such as missing data prediction and set prediction with state-of-the-art performance, thereby showing the effectiveness and generality of our method.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. ActivationReasoning: Logical Reasoning in Latent Activation Spaces

    cs.LG 2025-10 unverdicted novelty 6.0 of 10

    ActivationReasoning grounds logical reasoning in LLM latent activations via SAEs to enable structured inference, concept composition, and behavior steering on multi-hop, abstraction, and safety tasks.

  2. Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets

    cs.AI 2025-08 conditional novelty 6.0 of 10

    A probabilistic-circuit model over rule subsets lets knowledge graph completion use 70-96% fewer rules while retaining about 91% of full-rule-set accuracy.

Pith tools