Pith. sign in

REVIEW 1 cited by

Neuro-Symbolic Verification of Deep Neural Networks

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 2203.00938 v1 pith:LEBXIRBV submitted 2022-03-02 cs.AI cs.LGcs.LO

classification cs.AIcs.LGcs.LO
keywords verificationnetworksneuralneuro-symbolicpropertiesdeepexistingframework
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Formal verification has emerged as a powerful approach to ensure the safety and reliability of deep neural networks. However, current verification tools are limited to only a handful of properties that can be expressed as first-order constraints over the inputs and output of a network. While adversarial robustness and fairness fall under this category, many real-world properties (e.g., "an autonomous vehicle has to stop in front of a stop sign") remain outside the scope of existing verification technology. To mitigate this severe practical restriction, we introduce a novel framework for verifying neural networks, named neuro-symbolic verification. The key idea is to use neural networks as part of the otherwise logical specification, enabling the verification of a wide variety of complex, real-world properties, including the one above. Moreover, we demonstrate how neuro-symbolic verification can be implemented on top of existing verification infrastructure for neural networks, making our framework easily accessible to researchers and practitioners alike.

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. OpenAlex reports about 4 citations worldwide. Full citation record

  1. A Scalable Approach to Probabilistic Neuro-Symbolic Robustness Verification

    cs.AI 2025-02 conditional novelty 6.0 of 10

    Probabilistic NeSy robustness can be verified approximately by compiling neural and symbolic parts into one arithmetic graph and running interval bound propagation, with an NPPP-completeness result for the exact version.

Pith tools