Imagen de Portada

LLM-Powered Automatic Theorem Proving and Synthesis for Hybrid Systems and Game

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kabra, Aditi, Laurent, Jonathan, Martins, Ruben, Mitsch, Stefan, Platzer, André
Formato:	Preprint
Publicado:	2026
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Hybrid Game Control Envelope Synthesis
por: Kabra, Aditi, et al.
Publicado: (2025)

CESAR: Control Envelope Synthesis via Angelic Refinements
por: Kabra, Aditi, et al.
Publicado: (2023)

Can Large Language Models Autoformalize Kinematics?
por: Kabra, Aditi, et al.
Publicado: (2025)

Complete Dynamic Logic of Communicating Hybrid Programs
por: Brieger, Marvin, et al.
Publicado: (2024)

Provably Safe Neural Network Controllers via Differential Dynamic Logic
por: Teuber, Samuel, et al.
Publicado: (2024)

Refactoring-as-Propositions: Proved Refactoring of Hybrid Systems via Proved Refinements
por: Prebet, Enguerrand, et al.
Publicado: (2026)

A Deductive Refinement Calculus for Differential-Algebraic Programs
por: Hellwig, Jonathan, et al.
Publicado: (2026)

Equational Theorem Proving for Clauses over Strings
por: Kim, Dohan
Publicado: (2023)

Proving Behavioural Apartness
por: Turkenburg, Ruben, et al.
Publicado: (2024)

Automated Theorem Proving for Prolog Verification
por: Mesnard, Fred, et al.
Publicado: (2026)

Partial Label Learning for Automated Theorem Proving
por: Zombori, Zsolt, et al.
Publicado: (2025)

A Real-Analytic Approach to Differential-Algebraic Dynamic Logic
por: Hellwig, Jonathan, et al.
Publicado: (2025)

Differential Elimination and Algebraic Invariants of Polynomial Dynamical Systems
por: Simmons, William, et al.
Publicado: (2023)

STP: Self-play LLM Theorem Provers with Iterative Conjecturing and Proving
por: Dong, Kefan, et al.
Publicado: (2025)

Discover and Prove: An Open-source Agentic Framework for Hard Mode Automated Theorem Proving in Lean 4
por: Liu, Chengwu, et al.
Publicado: (2026)

MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving
por: Li, Jinzheng, et al.
Publicado: (2026)

What are the Right Symmetries for Formal Theorem Proving?
por: Olejniczak, Krzysztof, et al.
Publicado: (2026)

Nazrin: Atomic Tactics for Graph Neural Networks for Theorem Proving in Lean 4
por: Aniva, Leni, et al.
Publicado: (2026)

3D-Prover: Diversity Driven Theorem Proving With Determinantal Point Processes
por: Lamont, Sean, et al.
Publicado: (2024)

BAIT: Benchmarking (Embedding) Architectures for Interactive Theorem-Proving
por: Lamont, Sean, et al.
Publicado: (2024)

LeanAgent: Lifelong Learning for Formal Theorem Proving
por: Kumarappan, Adarsh, et al.
Publicado: (2024)

Beyond Theorem Proving: Formulation, Framework and Benchmark for Formal Problem-Solving
por: Liu, Qi, et al.
Publicado: (2025)

On the Complexity of Proving Polyhedral Reductions
por: Amat, Nicolas, et al.
Publicado: (2023)

Twitch: Learning Abstractions for Equational Theorem Proving
por: Axelrod, Guy, et al.
Publicado: (2026)

On Effective Banach-Mazur Games and an application to the Poincaré Recurrence Theorem for Category
por: Koul, Prajval, et al.
Publicado: (2025)

Canonical for Automated Theorem Proving in Lean
por: Norman, Chase, et al.
Publicado: (2025)

ProofWala: A Framework for Multilingual Proof Data Synthesis and Theorem-Proving
por: Thakur, Amitayush, et al.
Publicado: (2025)

Combining Logic with Large Language Models for Automatic Debugging and Repair of ASP Programs
por: Brancas, Ricardo, et al.
Publicado: (2024)

MSC-180: A Benchmark for Automated Formal Theorem Proving from Mathematical Subject Classification
por: Li, Sirui, et al.
Publicado: (2025)

Enhancing Formal Theorem Proving: A Comprehensive Dataset for Training AI Models on Coq Code
por: Florath, Andreas
Publicado: (2024)

Heterogeneous Dynamic Logic: Provability Modulo Program Theories
por: Teuber, Samuel, et al.
Publicado: (2025)

Comparing and Contrasting Arrow's Impossibility Theorem and Gödel's Incompleteness Theorem
por: Livson, Ori, et al.
Publicado: (2025)

Lean Meets Theoretical Computer Science: Scalable Synthesis of Theorem Proving Challenges in Formal-Informal Pairs
por: Zhang, Terry Jingchen, et al.
Publicado: (2025)

Uppaal Coshy: Automatic Synthesis of Compact Shields for Hybrid Systems
por: Brorholt, Asger Horn, et al.
Publicado: (2025)

An In-Context Learning Agent for Formal Theorem-Proving
por: Thakur, Amitayush, et al.
Publicado: (2023)

Towards Advanced Mathematical Reasoning for LLMs via First-Order Logic Theorem Proving
por: Cao, Chuxue, et al.
Publicado: (2025)

SubgoalXL: Subgoal-based Expert Learning for Theorem Proving
por: Zhao, Xueliang, et al.
Publicado: (2024)

Lean Copilot: Large Language Models as Copilots for Theorem Proving in Lean
por: Song, Peiyang, et al.
Publicado: (2024)

Games with $ω$-Automatic Preference Relations
por: Bruyère, Véronique, et al.
Publicado: (2025)

Towards Proving Liveness on Weak Memory (Extended Version)
por: Bargmann, Lara, et al.
Publicado: (2026)