Guiding Program Development Systems by a Connection Based Proof Strategy. - Christoph Kreitz; Jens Otten; Stephan Schmitt (LOPSTR, 1995)

A Connection Based Proof Method for Intuitionistic Logic. - Jens Otten (TABLEAUX, 1995)

A Uniform Proof Procedure for Classical and Non-Classical Logics. - Jens Otten; Christoph Kreitz (KI, 1996)

T-String Unification: Unifying Prefixes in Non-classical Proof Methods. - Jens Otten; Christoph Kreitz (TABLEAUX, 1996)

Connection-Based Proof Construction in Linear Logic. - Christoph Kreitz; Heiko Mantel; Jens Otten; Stephan Schmitt (CADE, 1997)

A Multi-level Approach to Program Synthesis. - Wolfgang Bibel; Daniel S. Korn; Christoph Kreitz; F. Kurucz; Jens Otten; Stephen Schmitt; G. Stolpmann (LOPSTR, 1997)

ileanTAP: An Intuitionistic Theorem Prover. - Jens Otten (TABLEAUX, 1997)

linTAP: A Tableau Prover for Linear Logic. - Heiko Mantel; Jens Otten (TABLEAUX, 1999)

Connection-based Theorem Proving in Classical and Non-classical Logics. - Christoph Kreitz; Jens Otten (J. Univers. Comput. Sci., 1999)

Matrix-based Constructive Theorem Proving. - Christoph Kreitz; Jens Otten; Stephan Schmitt; Brigitte Pientka (Intellectics and Computational Logic, 2000)

leanCoP: lean connection-based theorem proving. - Jens Otten; Wolfgang Bibel (J. Symb. Comput., 2003)

Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic. - Jens Otten (TABLEAUX, 2005)

The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic. - Thomas Raths; Jens Otten; Christoph Kreitz (TABLEAUX, 2005)

The ILTP Problem Library for Intuitionistic Logic. - Thomas Raths; Jens Otten; Christoph Kreitz (J. Autom. Reason., 2007)

leanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions). - Jens Otten (IJCAR, 2008)

randoCoP: Randomizing the Proof Search Order in the Connection Calculus. - Thomas Raths; Jens Otten (PAAR/ESHOL, 2008)

Specifying and Verifying Organizational Security Properties in First-Order Logic. - Christoph Brandt; Jens Otten; Christoph Kreitz; Wolfgang Bibel (Verification, Induction, Termination Analysis, 2010)

Restricting backtracking in connection calculi. - Jens Otten (AI Commun., 2010)

A Non-clausal Connection Calculus. - Jens Otten (TABLEAUX, 2011)

Implementing and Evaluating Theorem Provers for First-Order Modal Logics. - Thomas Raths; Jens Otten (TABLEAUX (Workshops, Tutorials, and Short Papers), 2011)

Implementing Different Proof Calculi for First-order Modal Logics. - Christoph Benzmüller; Jens Otten; Thomas Raths (PAAR@IJCAR, 2012)

The QMLTP Problem Library for First-Order Modal Logics. - Thomas Raths; Jens Otten (IJCAR, 2012)

Implementing and Evaluating Provers for First-order Modal Logics. - Christoph Benzmüller; Jens Otten; Thomas Raths (ECAI, 2012)

Implementing Connection Calculi for First-order Modal Logics. - Jens Otten (IWIL@LPAR, 2012)

Konnektionskalküle für automatisches Beweisen in klassischen und nicht-klassischen Logiken. - Jens Otten (Ausgezeichnete Informatikdissertationen, 2013)

Connection calculi for automated theorem proving in classical and non-classical logics. - Jens Otten (2013)

MleanCoP: A Connection Prover for First-Order Modal Logic. - Jens Otten (IJCAR, 2014)

Problem Libraries for Non-Classical Logics. - Jens Otten; Thomas Raths (ARQNL@IJCAR, 2014)

A Connection Calculus for the Description Logic ALC. - Fred Freitas; Jens Otten (Canadian AI, 2016)

nanoCoP: A Non-clausal Connection Prover. - Jens Otten (IJCAR, 2016)

Non-clausal Connection-based Theorem Proving in Intuitionistic First-Order Logic. - Jens Otten (ARQNL@IJCAR, 2016)

Advances in Connection-Based Automated Theorem Proving. - Jens Otten; Wolfgang Bibel (Provably Correct Systems, 2017)

nanoCoP: Natural Non-clausal Theorem Proving. - Jens Otten (IJCAI, 2017)

RACCOON: A Connection Reasoner for the Description Logic ALC. - Dimas Melo Filho; Fred Freitas; Jens Otten (LPAR, 2017)

Non-clausal Connection Calculi for Non-classical Logics. - Jens Otten (TABLEAUX, 2017)

Proof Search Optimizations for Non-Clausal Connection Calculi. - Jens Otten (PAAR@FLoC, 2018)

The Pocket Reasoner – Automatic Reasoning on Small Devices. - Jens Otten (NIK, 2018)

Converting ALC Connection Proofs into ALC Sequents. - Eunice Palmeira da Silva; Fred Freitas; Jens Otten (PxTP, 2019)

Equality Preprocessing in Connection Calculi. - Benjamin E. Oliver; Jens Otten (PAAR+SC²@IJCAR, 2020)

The nanoCoP 2.0 Connection Provers for Classical, Intuitionistic and Modal Logics. - Jens Otten (TABLEAUX, 2021)

Advancing Automated Theorem Proving for the Modal Logics D and S5. - Jens Otten (ARQNL@IJCAR, 2022)

A Highly-Integrated 20-300V 0.5W Active-Clamp Flyback DCDC Converter with 76.7% Peak Efficiency. - Christoph Rindfleisch; Jens Otten; Bernhard Wicht (CICC, 2022)

20 Years of leanCoP - An Overview of the Provers. - Jens Otten (AReCCa@TABLEAUX, 2023)

A Syntax for Connection Proofs. - Jens Otten; Sean B. Holden (AReCCa@TABLEAUX, 2023)

Connections: Markov Decision Processes for Classical, Intuitionistic and Modal Connection Calculi. - Fredrik Rømming; Jens Otten; Sean B. Holden (AReCCa@TABLEAUX, 2023)

Implementing Intermediate Logics. - Bastiaan Haaksema; Jens Otten; Revantha Ramanayake (ARQNL@IJCAR, 2024)