:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ji, Xiaotong, Wang, Hanchun, Filieri, Antonio, Epifani, Ilenia
Format:	Preprint
Publié:	2025
Sujets:	Artificial Intelligence Formal Languages and Automata Theory Machine Learning
Accès en ligne:	https://arxiv.org/abs/2502.04530
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Expressive Reward Synthesis with the Runtime Monitoring Language
par: Donnelly, Daniel, et autres
Publié: (2025)

Probabilistic Regular Tree Priors for Scientific Symbolic Reasoning
par: Schneider, Tim, et autres
Publié: (2023)

Extracting Robust Register Automata from Neural Networks over Data Sequences
par: Hong, Chih-Duo, et autres
Publié: (2025)

Lost in Transmission: When and Why LLMs Fail to Reason Globally
par: Schnabel, Tobias, et autres
Publié: (2025)

Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory
par: Dhayalkar, Sahil Rajesh
Publié: (2025)

Hilbert: Recursively Building Formal Proofs with Informal Reasoning
par: Varambally, Sumanth, et autres
Publié: (2025)

MinMax Recurrent Neural Cascades
par: Ronca, Alessandro
Publié: (2026)

Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic
par: Raha, Ritam, et autres
Publié: (2021)

Tractable Offline Learning of Regular Decision Processes
par: Deb, Ahana, et autres
Publié: (2024)

Analyzing constrained LLM through PDFA-learning
par: Carrasco, Matías, et autres
Publié: (2024)

Learning Formal Specifications from Membership and Preference Queries
par: Shah, Ameesh, et autres
Publié: (2023)

The Sparse Tsetlin Machine: Sparse Representation with Active Literals
par: Østby, Sebastian, et autres
Publié: (2024)

Reasoning about Reasoning: BAPO Bounds on Chain-of-Thought Token Complexity in LLMs
par: Tomlinson, Kiran, et autres
Publié: (2026)

Probabilistic Modeling of Spiking Neural Networks with Contract-Based Verification
par: Yao, Zhen, et autres
Publié: (2025)

Interpretable Early Failure Detection via Machine Learning and Trace Checking-based Monitoring
par: Brunello, Andrea, et autres
Publié: (2025)

LLMs as Probabilistic Minimally Adequate Teachers for DFA Learning
par: Chen, Lekai, et autres
Publié: (2024)

Congruence-based Learning of Probabilistic Deterministic Finite Automata
par: Carrasco, Matías, et autres
Publié: (2024)

Formal-LLM: Integrating Formal Language and Natural Language for Controllable LLM-based Agents
par: Li, Zelong, et autres
Publié: (2024)

InductionBench: LLMs Fail in the Simplest Complexity Class
par: Hua, Wenyue, et autres
Publié: (2025)

The Lottery LLM Hypothesis, Rethinking What Abilities Should LLM Compression Preserve?
par: Tang, Zhenheng, et autres
Publié: (2025)

A Probabilistic Model-Checking Framework for Cognitive Assessment and Training
par: De Maria, Elisabetta, et autres
Publié: (2026)

Are Agents Probabilistic Automata? A Trace-Based, Memory-Constrained Theory of Agentic AI
par: Koohestani, Roham, et autres
Publié: (2025)

Learning Reward Machines from Partially Observed Policies
par: Shehab, Mohamad Louai, et autres
Publié: (2025)

TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching
par: Meng, Yue, et autres
Publié: (2025)

Language Generation: Complexity Barriers and Implications for Learning
par: Arenas, Marcelo, et autres
Publié: (2025)

Exploring Major Transitions in the Evolution of Biological Cognition With Artificial Neural Networks
par: Voudouris, Konstantinos, et autres
Publié: (2025)

Provably Correct Automata Embeddings for Optimal Automata-Conditioned Reinforcement Learning
par: Yalcinkaya, Beyazit, et autres
Publié: (2025)

Compositional Automata Embeddings for Goal-Conditioned Reinforcement Learning
par: Yalcinkaya, Beyazit, et autres
Publié: (2024)

Automata Extraction from Transformers
par: Zhang, Yihao, et autres
Publié: (2024)

$L^*LM$: Learning Automata from Examples using Natural Language Oracles
par: Vazquez-Chanlatte, Marcell, et autres
Publié: (2024)

FormalAlign: Automated Alignment Evaluation for Autoformalization
par: Lu, Jianqiao, et autres
Publié: (2024)

Continuous Diffusion Models Can Obey Formal Syntax
par: Kim, Jinwoo, et autres
Publié: (2026)

A New Era in Software Security: Towards Self-Healing Software via Large Language Models and Formal Verification
par: Tihanyi, Norbert, et autres
Publié: (2023)

Active Reward Machine Inference From Raw State Trajectories
par: Shehab, Mohamad Louai, et autres
Publié: (2026)

The 4/$δ$ Bound: Designing Predictable LLM-Verifier Systems for Formal Method Guarantee
par: Dantas, PIerre, et autres
Publié: (2025)

Infinite Time Turing Machines and their Applications
par: Weerawarana, Rukmal, et autres
Publié: (2025)

Automata Learning of Preferences over Temporal Logic Formulas from Pairwise Comparisons
par: Rahmani, Hazhar, et autres
Publié: (2025)

Foundation Models for Logistics: Toward Certifiable, Conversational Planning Interfaces
par: Yang, Yunhao, et autres
Publié: (2025)

Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation
par: Chen, Boqi, et autres
Publié: (2024)

MUSTARD: Mastering Uniform Synthesis of Theorem and Proof Data
par: Huang, Yinya, et autres
Publié: (2024)