Distilling Formal Logic into Neural Spaces: A Kernel Alignment Approach for Signal Temporal Logic
Not on the map. Why?
Abstract (arXiv)
We introduce a framework for learning continuous neural representations of formal specifications by distilling the geometry of their semantics into a latent space. Existing approaches rely either on symbolic kernels -- which preserve behavioural semantics but are computationally prohibitive, anchor-dependent, and non-invertible -- or on syntax-based neural embeddings that fail to capture underlying structures. Our method bridges this gap: using a teacher-student setup, we distill a symbolic robustness kernel into a Transformer encoder. Unlike standard contrastive methods, we supervise the model with a continuous, kernel-weighted geometric alignment objective that penalizes errors in proportion to their semantic discrepancies. Once trained, the encoder produces embeddings in a single forward pass, effectively mimicking the kernel's logic at a fraction of its computational cost. We apply our framework to Signal Temporal Logic (STL), demonstrating that the resulting neural representations faithfully preserve the semantic similarity of STL formulae, accurately predict robustness and constraint satisfaction, and remain intrinsically invertible. Our proposed approach enables highly efficient, scalable neuro-symbolic reasoning and formula reconstruction without repeated kernel computation at runtime.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 31 references that are in the map. First posted on arXiv 5 Mar 2026.
Builds on
21 of 31 references.
References · 21
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
- 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,393
- 2019Relational Knowledge Distillationcited by 873
- 2017Learning to Represent Programs with Graphscited by 219
9 more
- 2016Reinforcement Learning With Temporal Logic Rewardscited by 114
- 2022Learning Model Checking and the Kernel Trick for Signal Temporal Logic on Stochastic Processescited by 7
- 2024Retrieval-Augmented Mining of Temporal Logic Specifications from Datacited by 5
- 2024stl2vec: Semantic and Interpretable Vector Representation of Temporal Logiccited by 3
- 2024Contrastive Learning for Image Complexity Representationcited by 3
- 2025On the Similarities of Embeddings in Contrastive Learningcited by 2
- 2019Kernel-based Translations of Convolutional Networkscited by 1
- 2025Bridging Logic and Learning: Decoding Temporal Logic Embeddings via Transformerscited by 1
- 2026Efficient Analysis of the Distilled Neural Tangent Kernelcited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025GradSTL: Comprehensive Signal Temporal Logic for Neurosymbolic Reasoning and Learning
- 2026The Topological Dual of a Dataset: A Logic-to-Topology Encoding for AlphaGeometry-Style Data
- 2026Pushing the Boundaries of Natural Reasoning: Interleaved Bonus from Formal-Logic Verification
- 2025Constructing a Neuro-Symbolic Mathematician from First Principles
- 2025On the Limits of Hierarchically Embedded Logic in Classical Neural Networks
- 2026Natural Synthesis: Outperforming Reactive Synthesis Tools with Large Reasoning Models
- 2026CircuitSynth: Reliable Synthetic Data Generation
- 2026Logic-Parametric Neuro-Symbolic NLI: Controlling Logical Formalisms for Verifiable LLM Reasoning