| 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 |
| Tableau-based Decision Procedure for Non-Fregean Logic of Sentential Identity
|
2021 |
Golińska-Pilarek, Joanna |
| Efficient Local Reductions to Basic Modal Logic
|
2021 |
Papacchini, Fabio |
| Unifying Decidable Entailments in Separation Logic with Inductive Definitions
|
2021 |
Echenim, Mnacho |
| Multi-Dimensional Interpretations for Termination of Term Rewriting
|
2021 |
Yamada, Akihisa |
| Finding Good Proofs for Description Logic Entailments using Recursive Quality Measures
|
2021 |
Alrabbaa, Christian |
| A Normative Supervisor for Reinforcement Learning Agents
|
2021 |
Neufeld, Emery |
| Learning from Łukasiewicz and Meredith: Investigations into Proof Structures
|
2021 |
Wernhard, Christoph |
| Isabelle’s Metalogic: Formalization and Proof Checker
|
2021 |
Nipkow, Tobias |
| Efficient SAT-based Proof Search in Intuitionistic Propositional Logic
|
2021 |
Fiorentini, Camillo |
| Generalized Completeness for SOS Resolution and its Application to a New Notion of Relevance
|
2021 |
Haifani, Fajar |
Tag hinzufügen