Pith. sign in

REVIEW 1 cited by

Vehicle: Bridging the Embedding Gap in the Verification of Neuro-Symbolic Programs

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 2401.06379 v2 pith:LL2Q7VS7 submitted 2024-01-12 cs.AI

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

Neuro-symbolic programs, i.e. programs containing both machine learning components and traditional symbolic code, are becoming increasingly widespread. Finding a general methodology for verifying such programs is challenging due to both the number of different tools involved and the intricate interface between the ``neural'' and ``symbolic'' program components. In this paper we present a general decomposition of the neuro-symbolic verification problem into parts, and examine the problem of the embedding gap that occurs when one tries to combine proofs about the neural and symbolic components. To address this problem we then introduce Vehicle -- standing as an abbreviation for a ``verification condition language'' -- an intermediate programming language interface between machine learning frameworks, automated theorem provers, and dependently-typed formalisations of neuro-symbolic programs. Vehicle allows users to specify the properties of the neural components of neuro-symbolic programs once, and then safely compile the specification to each interface using a tailored typing and compilation procedure. We give a high-level overview of Vehicle's overall design, its interfaces and compilation & type-checking procedures, and then demonstrate its utility by formally verifying the safety of a simple autonomous car controlled by a neural network, operating in a stochastic environment with imperfect information.

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. 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