Imagen de Portada

Equational Theorem Proving for Clauses over Strings

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Kim, Dohan
Formato:	Preprint
Publicado:	2023
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

Congruence Closure Modulo Groups
por: Kim, Dohan
Publicado: (2023)

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

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

LLM-Powered Automatic Theorem Proving and Synthesis for Hybrid Systems and Game
por: Kabra, Aditi, et al.
Publicado: (2026)

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

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

Automated Catamorphism Synthesis for Solving Constrained Horn Clauses over Algebraic Data Types
por: Katsura, Hiroyuki, 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)

Partial Quantifier Elimination By Certificate Clauses
por: Goldberg, Eugene
Publicado: (2020)

On Solving String Equations via Powers and Parikh Images
por: Eisenhofer, Clemens, et al.
Publicado: (2026)

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

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)

Disjoint Partial Enumeration without Blocking Clauses
por: Spallitta, Giuseppe, et al.
Publicado: (2023)

Rethinking Clause Management for CDCL SAT Solvers
por: Cai, Yalun, et al.
Publicado: (2026)

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)

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

CTL* Verification and Synthesis using Existential Horn Clauses
por: Carelli, Mishel, et al.
Publicado: (2024)

Testing for Renamability to Classes of Clause Sets
por: Brandl, Albert, et al.
Publicado: (2025)

Codd's Theorem for Databases over Semirings
por: Badia, Guillermo, et al.
Publicado: (2025)

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)

Disjoint Projected Enumeration for SAT and SMT without Blocking Clauses
por: Spallitta, Giuseppe, et al.
Publicado: (2024)

Extended Resolution Clause Learning via Dual Implication Points
por: Buss, Sam, et al.
Publicado: (2024)

Comparing and Contrasting Arrow's Impossibility Theorem and Gödel's Incompleteness Theorem
por: Livson, Ori, 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)

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

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

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

Efficient Neural Clause-Selection Reinforcement
por: Suda, Martin
Publicado: (2025)

Enhancing Neural Theorem Proving through Data Augmentation and Dynamic Sampling Method
por: Vishwakarma, Rahul, et al.
Publicado: (2023)

Fixed Point Theorems in Computability Theory
por: Terwijn, Sebastiaan A.
Publicado: (2024)

Catamorphic Abstractions for Constrained Horn Clause Satisfiability
por: De Angelis, Emanuele, et al.
Publicado: (2024)

An Analysis of Tennenbaum's Theorem in Constructive Type Theory
por: Hermes, Marc, et al.
Publicado: (2023)