Saved in:
| Main Authors: | Ji, Xiaotong, Wang, Hanchun, Filieri, Antonio, Epifani, Ilenia |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.04530 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Expressive Reward Synthesis with the Runtime Monitoring Language
by: Donnelly, Daniel, et al.
Published: (2025)
by: Donnelly, Daniel, et al.
Published: (2025)
Probabilistic Regular Tree Priors for Scientific Symbolic Reasoning
by: Schneider, Tim, et al.
Published: (2023)
by: Schneider, Tim, et al.
Published: (2023)
Extracting Robust Register Automata from Neural Networks over Data Sequences
by: Hong, Chih-Duo, et al.
Published: (2025)
by: Hong, Chih-Duo, et al.
Published: (2025)
Lost in Transmission: When and Why LLMs Fail to Reason Globally
by: Schnabel, Tobias, et al.
Published: (2025)
by: Schnabel, Tobias, et al.
Published: (2025)
Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory
by: Dhayalkar, Sahil Rajesh
Published: (2025)
by: Dhayalkar, Sahil Rajesh
Published: (2025)
Hilbert: Recursively Building Formal Proofs with Informal Reasoning
by: Varambally, Sumanth, et al.
Published: (2025)
by: Varambally, Sumanth, et al.
Published: (2025)
MinMax Recurrent Neural Cascades
by: Ronca, Alessandro
Published: (2026)
by: Ronca, Alessandro
Published: (2026)
Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic
by: Raha, Ritam, et al.
Published: (2021)
by: Raha, Ritam, et al.
Published: (2021)
Tractable Offline Learning of Regular Decision Processes
by: Deb, Ahana, et al.
Published: (2024)
by: Deb, Ahana, et al.
Published: (2024)
Analyzing constrained LLM through PDFA-learning
by: Carrasco, Matías, et al.
Published: (2024)
by: Carrasco, Matías, et al.
Published: (2024)
Learning Formal Specifications from Membership and Preference Queries
by: Shah, Ameesh, et al.
Published: (2023)
by: Shah, Ameesh, et al.
Published: (2023)
The Sparse Tsetlin Machine: Sparse Representation with Active Literals
by: Østby, Sebastian, et al.
Published: (2024)
by: Østby, Sebastian, et al.
Published: (2024)
Reasoning about Reasoning: BAPO Bounds on Chain-of-Thought Token Complexity in LLMs
by: Tomlinson, Kiran, et al.
Published: (2026)
by: Tomlinson, Kiran, et al.
Published: (2026)
Probabilistic Modeling of Spiking Neural Networks with Contract-Based Verification
by: Yao, Zhen, et al.
Published: (2025)
by: Yao, Zhen, et al.
Published: (2025)
Interpretable Early Failure Detection via Machine Learning and Trace Checking-based Monitoring
by: Brunello, Andrea, et al.
Published: (2025)
by: Brunello, Andrea, et al.
Published: (2025)
LLMs as Probabilistic Minimally Adequate Teachers for DFA Learning
by: Chen, Lekai, et al.
Published: (2024)
by: Chen, Lekai, et al.
Published: (2024)
Congruence-based Learning of Probabilistic Deterministic Finite Automata
by: Carrasco, Matías, et al.
Published: (2024)
by: Carrasco, Matías, et al.
Published: (2024)
Formal-LLM: Integrating Formal Language and Natural Language for Controllable LLM-based Agents
by: Li, Zelong, et al.
Published: (2024)
by: Li, Zelong, et al.
Published: (2024)
InductionBench: LLMs Fail in the Simplest Complexity Class
by: Hua, Wenyue, et al.
Published: (2025)
by: Hua, Wenyue, et al.
Published: (2025)
The Lottery LLM Hypothesis, Rethinking What Abilities Should LLM Compression Preserve?
by: Tang, Zhenheng, et al.
Published: (2025)
by: Tang, Zhenheng, et al.
Published: (2025)
A Probabilistic Model-Checking Framework for Cognitive Assessment and Training
by: De Maria, Elisabetta, et al.
Published: (2026)
by: De Maria, Elisabetta, et al.
Published: (2026)
Are Agents Probabilistic Automata? A Trace-Based, Memory-Constrained Theory of Agentic AI
by: Koohestani, Roham, et al.
Published: (2025)
by: Koohestani, Roham, et al.
Published: (2025)
Learning Reward Machines from Partially Observed Policies
by: Shehab, Mohamad Louai, et al.
Published: (2025)
by: Shehab, Mohamad Louai, et al.
Published: (2025)
TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching
by: Meng, Yue, et al.
Published: (2025)
by: Meng, Yue, et al.
Published: (2025)
Language Generation: Complexity Barriers and Implications for Learning
by: Arenas, Marcelo, et al.
Published: (2025)
by: Arenas, Marcelo, et al.
Published: (2025)
Exploring Major Transitions in the Evolution of Biological Cognition With Artificial Neural Networks
by: Voudouris, Konstantinos, et al.
Published: (2025)
by: Voudouris, Konstantinos, et al.
Published: (2025)
Provably Correct Automata Embeddings for Optimal Automata-Conditioned Reinforcement Learning
by: Yalcinkaya, Beyazit, et al.
Published: (2025)
by: Yalcinkaya, Beyazit, et al.
Published: (2025)
Compositional Automata Embeddings for Goal-Conditioned Reinforcement Learning
by: Yalcinkaya, Beyazit, et al.
Published: (2024)
by: Yalcinkaya, Beyazit, et al.
Published: (2024)
Automata Extraction from Transformers
by: Zhang, Yihao, et al.
Published: (2024)
by: Zhang, Yihao, et al.
Published: (2024)
$L^*LM$: Learning Automata from Examples using Natural Language Oracles
by: Vazquez-Chanlatte, Marcell, et al.
Published: (2024)
by: Vazquez-Chanlatte, Marcell, et al.
Published: (2024)
FormalAlign: Automated Alignment Evaluation for Autoformalization
by: Lu, Jianqiao, et al.
Published: (2024)
by: Lu, Jianqiao, et al.
Published: (2024)
Continuous Diffusion Models Can Obey Formal Syntax
by: Kim, Jinwoo, et al.
Published: (2026)
by: Kim, Jinwoo, et al.
Published: (2026)
A New Era in Software Security: Towards Self-Healing Software via Large Language Models and Formal Verification
by: Tihanyi, Norbert, et al.
Published: (2023)
by: Tihanyi, Norbert, et al.
Published: (2023)
Active Reward Machine Inference From Raw State Trajectories
by: Shehab, Mohamad Louai, et al.
Published: (2026)
by: Shehab, Mohamad Louai, et al.
Published: (2026)
The 4/$δ$ Bound: Designing Predictable LLM-Verifier Systems for Formal Method Guarantee
by: Dantas, PIerre, et al.
Published: (2025)
by: Dantas, PIerre, et al.
Published: (2025)
Infinite Time Turing Machines and their Applications
by: Weerawarana, Rukmal, et al.
Published: (2025)
by: Weerawarana, Rukmal, et al.
Published: (2025)
Automata Learning of Preferences over Temporal Logic Formulas from Pairwise Comparisons
by: Rahmani, Hazhar, et al.
Published: (2025)
by: Rahmani, Hazhar, et al.
Published: (2025)
Foundation Models for Logistics: Toward Certifiable, Conversational Planning Interfaces
by: Yang, Yunhao, et al.
Published: (2025)
by: Yang, Yunhao, et al.
Published: (2025)
Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation
by: Chen, Boqi, et al.
Published: (2024)
by: Chen, Boqi, et al.
Published: (2024)
MUSTARD: Mastering Uniform Synthesis of Theorem and Proof Data
by: Huang, Yinya, et al.
Published: (2024)
by: Huang, Yinya, et al.
Published: (2024)
Similar Items
-
Expressive Reward Synthesis with the Runtime Monitoring Language
by: Donnelly, Daniel, et al.
Published: (2025) -
Probabilistic Regular Tree Priors for Scientific Symbolic Reasoning
by: Schneider, Tim, et al.
Published: (2023) -
Extracting Robust Register Automata from Neural Networks over Data Sequences
by: Hong, Chih-Duo, et al.
Published: (2025) -
Lost in Transmission: When and Why LLMs Fail to Reason Globally
by: Schnabel, Tobias, et al.
Published: (2025) -
Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory
by: Dhayalkar, Sahil Rajesh
Published: (2025)