Vol-3613
urn:nbn:de:0074-3613-0

Copyright © 2023 for the individual papers by the papers' authors. Copyright © 2022 for the volume as a collection by its editors. This volume and its papers are published under the Creative Commons License Attribution 4.0 International (CC BY 4.0).

AReCCa 2023
Automated Reasoning with Connection Calculi 2023

Proceedings of the 1st International Workshop on Automated Reasoning with Connection Calculi (AReCCa 2023)

affiliated with the 32nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2023)

Prague, Czech Republic, September 18, 2023.

Edited by

Jens Otten *
Wolfgang Bibel **

* University of Oslo, Norway
** Technical University of Darmstadt, Germany

Table of Contents

Front Matter
Summary: There were 9 papers submitted for peer-review to this workshop. Out of these, all 9 papers were accepted for this volume.

Preface

AReCCa 2023 - Automated Reasoning with Connection Calculi 1-3
Jens Otten, Wolfgang Bibel

Regular Papers

20 Years of leanCoP - An Overview of the Provers 4-22
Jens Otten
A Curiously Effective Backtracking Strategy for Connection Tableaux 23-40
Michael Färber
nanoCoP-Omega: A Non-Clausal Connection Prover with Arithmetic 41-53
Leo Repp, Mario Frank
Embedding the Connection Calculus in Satisfiability Modulo Theories 54-63
Clemens Eisenhofer, Laura Kovács, Michael Rawson
Structure-Generating First-Order Theorem Proving 64-83
Christoph Wernhard
A Syntax for Connection Proofs 84-94
Jens Otten, Sean B. Holden
Connect++: A New Automated Theorem Prover Based on the Connection Calculus 95-106
Sean B. Holden
Connections: Markov Decision Processes for Classical, Intuitionistic and Modal Connection Calculi 107-118
Fredrik Rømming, Jens Otten, Sean B. Holden
Comparison of Proof Methods 119-132
Wolfgang Bibel

2023-12-21: submitted by Jens Otten, metadata incl. bibliographic data published under Creative Commons CC0
2024-01-08: published on CEUR Workshop Proceedings (CEUR-WS.org, ISSN 1613-0073) |valid HTML5|