:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Amat, Nicolas, Zilio, Silvano Dal, Botlan, Didier Le
Format:	Preprint
Publié:	2023
Sujets:	Logic in Computer Science
Accès en ligne:	https://arxiv.org/abs/2306.01466
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability
par: Amat, Nicolas, et autres
Publié: (2024)

Proving Behavioural Apartness
par: Turkenburg, Ruben, et autres
Publié: (2024)

Diagrammatic Polyhedral Algebra
par: Bonchi, Filippo, et autres
Publié: (2021)

On Randomized Computational Models and Complexity Classes: a Historical Overview
par: Antonelli, Melissa, et autres
Publié: (2024)

Equational Theorem Proving for Clauses over Strings
par: Kim, Dohan
Publié: (2023)

Weak Simplicial Bisimilarity for Polyhedral Models and SLCS_eta -- Extended Version
par: Bezhanishvili, Nick, et autres
Publié: (2024)

Towards Proving Liveness on Weak Memory (Extended Version)
par: Bargmann, Lara, et autres
Publié: (2026)

Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties (extended version)
par: Dardinier, Thibault, et autres
Publié: (2023)

LLM-Powered Automatic Theorem Proving and Synthesis for Hybrid Systems and Game
par: Kabra, Aditi, et autres
Publié: (2026)

Proving Confluence in the Confluence Framework with CONFident
par: Gutiérrez, Raúl, et autres
Publié: (2023)

Automated Theorem Proving for Prolog Verification
par: Mesnard, Fred, et autres
Publié: (2026)

Expansion Laws for Forward-Reverse, Forward, and Reverse Bisimilarities via Proved Encodings
par: Bernardo, Marco, et autres
Publié: (2024)

Discover and Prove: An Open-source Agentic Framework for Hard Mode Automated Theorem Proving in Lean 4
par: Liu, Chengwu, et autres
Publié: (2026)

Partial Label Learning for Automated Theorem Proving
par: Zombori, Zsolt, et autres
Publié: (2025)

Proving Circuit Functional Equivalence in Zero Knowledge
par: Shen, Sirui, et autres
Publié: (2026)

Semantic Foundations of Reductive Reasoning
par: Gheorghiu, Alexander V., et autres
Publié: (2024)

A Formal Model to Prove Instantiation Termination for E-matching-Based Axiomatisations (Extended Version)
par: Ge, Rui, et autres
Publié: (2024)

Verifying Quantum Phase Estimation (QPE) using Prove-It
par: Witzel, Wayne M., et autres
Publié: (2023)

Pseudo-Complex Quantifier Elimination
par: Faroß, Nicolas, et autres
Publié: (2026)

Cyclic Implicit Complexity
par: Curzi, Gianluca, et autres
Publié: (2021)

MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving
par: Li, Jinzheng, et autres
Publié: (2026)

The Complexity of the Constructive Master Modality
par: Santiago-Fernández, Sofía, et autres
Publié: (2026)

Internal and External Calculi: Ordering the Jungle without Being Lost in Translations
par: Lyon, Tim S., et autres
Publié: (2023)

On The Metric Nature of (Differential) Logical Relations
par: Lago, Ugo Dal, et autres
Publié: (2025)

On the Metric Nature of (Differential) Logical Relations
par: Lago, Ugo Dal, et autres
Publié: (2026)

Symbolic Sets for Proving Bounds on Rado Numbers
par: Ahmed, Tanbir, et autres
Publié: (2025)

Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing
par: Pshenitsyn, Tikhon
Publié: (2023)

A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
par: Nguyên, Lê Thành Dũng, et autres
Publié: (2022)

Nazrin: Atomic Tactics for Graph Neural Networks for Theorem Proving in Lean 4
par: Aniva, Leni, et autres
Publié: (2026)

3D-Prover: Diversity Driven Theorem Proving With Determinantal Point Processes
par: Lamont, Sean, et autres
Publié: (2024)

Towards Solving More Challenging IMO Problems via Decoupled Reasoning and Proving
par: Liang, Zhenwen, et autres
Publié: (2025)

Proof Complexity of Linear Logics
par: Tabatabai, Amirhossein Akbar, et autres
Publié: (2026)

What are the Right Symmetries for Formal Theorem Proving?
par: Olejniczak, Krzysztof, et autres
Publié: (2026)

Meta-Mathematics of Computational Complexity Theory
par: Oliveira, Igor C.
Publié: (2025)

Complexity of the Model Checking problem for inquisitive propositional and modal logic
par: Grilletti, Gianluca, et autres
Publié: (2024)

Beyond Theorem Proving: Formulation, Framework and Benchmark for Formal Problem-Solving
par: Liu, Qi, et autres
Publié: (2025)

Compiling Quantum Lambda-Terms into Circuits via the Geometry of Interaction
par: Chardonnet, Kostia, et autres
Publié: (2026)

Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
par: André, Étienne, et autres
Publié: (2023)

BAIT: Benchmarking (Embedding) Architectures for Interactive Theorem-Proving
par: Lamont, Sean, et autres
Publié: (2024)

LeanAgent: Lifelong Learning for Formal Theorem Proving
par: Kumarappan, Adarsh, et autres
Publié: (2024)