Formally Verified Neurosymbolic Trajectory Learning via Tensor-based Linear Temporal Logic on Finite Traces
Chevallier, Mark, Smola, Filip, Schmoetten, Richard, Fleuriot, Jacques D.
–arXiv.org Artificial Intelligence
We present a novel formalisation of tensor semantics for linear temporal logic on finite traces (LTLf), with formal proofs of correctness carried out in the theorem prover Isabelle/HOL. We demonstrate that this formalisation can be integrated into a neurosymbolic learning process by defining and verifying a differentiable loss function for the LTLf constraints, and automatically generating an implementation that integrates with PyTorch. We show that, by using this loss, the process learns to satisfy pre-specified logical constraints. Our approach offers a fully rigorous framework for constrained training, eliminating many of the inherent risks of ad-hoc, manual implementations of logical aspects directly in an "unsafe" programming language such as Python, while retaining efficiency in implementation.
arXiv.org Artificial Intelligence
Jan-23-2025
- Country:
- Africa > Senegal
- Kolda Region > Kolda (0.04)
- Europe
- France > Brittany
- Ille-et-Vilaine > Rennes (0.04)
- United Kingdom > England
- Cambridgeshire > Cambridge (0.04)
- France > Brittany
- North America > United States
- California > San Diego County
- San Diego (0.04)
- New Jersey > Mercer County
- Princeton (0.04)
- California > San Diego County
- Africa > Senegal
- Genre:
- Research Report > New Finding (0.46)