CEUR Workshop Proceedings (CEUR-WS.org)
Christoph Benzmu¨ller Wolfgang Bibel Chad Brown David Cerna Michael Fa¨rber Didier Galmiche Sean Holden Cezary Kaliszyk Jens Otten Michael Rawson Stephan Schulz Josef Urban Christoph Wernhard Zsolt Zombori
University of Bamberg, Germany Technical University of Darmstadt, Germany – co-chair Czech Technical University in Prague, Czech Republic Czech Academy of Sciences, Czech Republic University of Innsbruck, Austria LORIA - Universite´ de Lorraine, France University of Cambridge, UK University of Innsbruck, Austria University of Oslo, Norway – co-chair TU Wien, Austria DHBW Stuttgart, Germany Czech Technical University in Prague, Czech Republic University of Potsdam, Germany Hungarian Academy of Sciences, Hungary
AReCCa 2023 – Automated Reasoning with Connection Calculi Jens Otten and Wolfgang Bibel 20 Years of leanCoP - An Overview of the Provers Jens Otten A Curiously Effective Backtracking Strategy for Connection Tableaux Michael Fa¨rber nanoCoP-Omega: A Non-Clausal Connection Prover with Arithmetic Leo Repp and Mario Frank Embedding the Connection Calculus in Satisfiability Modulo Theories Clemens Eisenhofer, Laura Kova´cs and Michael Rawson Structure-Generating First-Order Theorem Proving Christoph Wernhard A Syntax for Connection Proofs Jens Otten and Sean B. Holden 1–3 23–40 41–53 54–63 64–83 84–94 95–106 107–118 119–132