:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Amat, Nicolas, Zilio, Silvano Dal, Botlan, Didier Le
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2306.01466
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability
by: Amat, Nicolas, et al.
Published: (2024)

Proving Behavioural Apartness
by: Turkenburg, Ruben, et al.
Published: (2024)

Diagrammatic Polyhedral Algebra
by: Bonchi, Filippo, et al.
Published: (2021)

On Randomized Computational Models and Complexity Classes: a Historical Overview
by: Antonelli, Melissa, et al.
Published: (2024)

Equational Theorem Proving for Clauses over Strings
by: Kim, Dohan
Published: (2023)

Weak Simplicial Bisimilarity for Polyhedral Models and SLCS_eta -- Extended Version
by: Bezhanishvili, Nick, et al.
Published: (2024)

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

Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties (extended version)
by: Dardinier, Thibault, et al.
Published: (2023)

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

Proving Confluence in the Confluence Framework with CONFident
by: Gutiérrez, Raúl, et al.
Published: (2023)

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

Expansion Laws for Forward-Reverse, Forward, and Reverse Bisimilarities via Proved Encodings
by: Bernardo, Marco, et al.
Published: (2024)

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

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

Proving Circuit Functional Equivalence in Zero Knowledge
by: Shen, Sirui, et al.
Published: (2026)

Semantic Foundations of Reductive Reasoning
by: Gheorghiu, Alexander V., et al.
Published: (2024)

A Formal Model to Prove Instantiation Termination for E-matching-Based Axiomatisations (Extended Version)
by: Ge, Rui, et al.
Published: (2024)

Verifying Quantum Phase Estimation (QPE) using Prove-It
by: Witzel, Wayne M., et al.
Published: (2023)

Pseudo-Complex Quantifier Elimination
by: Faroß, Nicolas, et al.
Published: (2026)

Cyclic Implicit Complexity
by: Curzi, Gianluca, et al.
Published: (2021)

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

The Complexity of the Constructive Master Modality
by: Santiago-Fernández, Sofía, et al.
Published: (2026)

Internal and External Calculi: Ordering the Jungle without Being Lost in Translations
by: Lyon, Tim S., et al.
Published: (2023)

On The Metric Nature of (Differential) Logical Relations
by: Lago, Ugo Dal, et al.
Published: (2025)

On the Metric Nature of (Differential) Logical Relations
by: Lago, Ugo Dal, et al.
Published: (2026)

Symbolic Sets for Proving Bounds on Rado Numbers
by: Ahmed, Tanbir, et al.
Published: (2025)

Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing
by: Pshenitsyn, Tikhon
Published: (2023)

A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
by: Nguyên, Lê Thành Dũng, et al.
Published: (2022)

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

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

Towards Solving More Challenging IMO Problems via Decoupled Reasoning and Proving
by: Liang, Zhenwen, et al.
Published: (2025)

Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)

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

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

Complexity of the Model Checking problem for inquisitive propositional and modal logic
by: Grilletti, Gianluca, et al.
Published: (2024)

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

Compiling Quantum Lambda-Terms into Circuits via the Geometry of Interaction
by: Chardonnet, Kostia, et al.
Published: (2026)

Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
by: André, Étienne, et al.
Published: (2023)

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

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