Reliable Reconstruction of Fine-grained Proofs in a Proof Assistant

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:CADE (28. : 2021 : Online) Automated Deduction - CADE 28
1. Verfasser: Schurr, Hans-Jörg (VerfasserIn)
Weitere Verfasser: Fleury, Mathias (VerfasserIn), Desharnais, Martin (VerfasserIn)
Pages:28
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2021
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Non-well-founded Deduction for Induction and Coinduction 2021 Cohen, Liron
The ksmt Calculus Is a δ-complete Decision Procedure for Non-linear Constraints 2021 Brauße, Franz
Subformula Linking for Intuitionistic Logic with Application to Type Theory 2021 Chaudhuri, Kaustuv
Computing Optimal Repairs of Quantified ABoxes w.r.t. Static EL TBoxes 2021 Baader, Franz
Integer Induction in Saturation 2021 Hozzová, Petra
An Automated Approach to the Collatz Conjecture 2021 Yolcu, Emre
Reliable Reconstruction of Fine-grained Proofs in a Proof Assistant 2021 Schurr, Hans-Jörg
Improving ENIGMA-style Clause Selection while Learning From History 2021 Suda, Martin
Neural Precedence Recommender 2021 Bártek, Filip
The Isabelle/Naproche Natural Language Proof Assistant 2021 Lon, Adrian De
Towards the Automatic Mathematician 2021 Rabe, Markus N.
Equational Theorem Proving Modulo 2021 Kim, Dohan
Politeness and Stable Infiniteness: Stronger Together 2021 Sheng, Ying
Universal Invariant Checking of Parametric Systems with Quantifier-free SMT Reasoning 2021 Cimatti, Alessandro
Proof Search and Certificates for Evidential Transactions 2021 Nigam, Vivek
Non-clausal Redundancy Properties 2021 Barnett, Lee A.
A Unifying Splitting Framework 2021 Ebner, Gabriel
Superposition for Full Higher-order Logic 2021 Bentkamp, Alexander
Making Higher-Order Superposition Work 2021 Vukmirović, Petar
Verified Interactive Computation of Definite Integrals 2021 Xu, Runqing
Alle Artikel auflisten