Jens Otten

发表

Proof Search Optimizations for Non-Clausal Connection Calculi

Jens Otten, 2018, PAAR@FLoC.

A Uniform Proof Procedure for Classical and Non-Classical Logics

Christoph Kreitz, Jens Otten, 1996, KI.

Implementing and Evaluating Provers for First-order Modal Logics

Christoph Benzmüller, Jens Otten, Thomas Raths, 2012, ECAI.

Guiding Program Development Systems by a Connection Based Proof Strategy

Christoph Kreitz, Jens Otten, Stephan Schmitt, 1995, LOPSTR.

ileanTAP: An Intuitionistic Theorem Prover

Jens Otten, 1997, TABLEAUX.

The Pocket Reasoner -- Automatic Reasoning on Small Devices

Jens Otten, J. Otten, 2018, NIK.

randoCoP: Randomizing the Proof Search Order in the Connection Calculus

Jens Otten, Thomas Raths, 2008, PAAR/ESHOL.

Implementing Different Proof Calculi for

Jens Otten, Thomas Raths, Christoph Benzm, 2012 .

Specifying and Verifying Organizational Security Properties in First-Order Logic

Wolfgang Bibel, Christoph Kreitz, Christoph Brandt, 2010, Verification, Induction, Termination Analysis.

Converting ALC Connection Proofs into ALC Sequents

Jens Otten, Fred Freitas, Eunice Palmeira, 2019 .

RACCOON: A Connection Reasoner for the Description Logic ALC

Jens Otten, Frederico Luiz Gonçalves de Freitas, Dimas Melo Filho, 2017, LPAR.

leanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)

Jens Otten, J. Otten, 2008, IJCAR.

T-String Unification: Unifying Prefixes in Non-classical Proof Methods

Christoph Kreitz, Jens Otten, 1996, TABLEAUX.

The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic

Christoph Kreitz, Jens Otten, Thomas Raths, 2005, TABLEAUX.

Connection calculi for automated theorem proving in classical and non-classical logics

Jens Otten, 2013 .

The QMLTP Problem Library for First-Order Modal Logics

Jens Otten, Thomas Raths, 2012, IJCAR.

Implementing Different Proof Calculi for First-order Modal Logics

Christoph Benzmüller, Jens Otten, Thomas Raths, 2012, PAAR@IJCAR.

nanoCoP: A Non-clausal Connection Prover

Jens Otten, 2016, IJCAR.

A Connection Based Proof Method for Intuitionistic Logic

Jens Otten, J. Otten, 1995, TABLEAUX.

Advances in Connection-Based Automated Theorem Proving

Wolfgang Bibel, Jens Otten, W. Bibel, 2017, Provably Correct Systems.

Converting ALC Connection Proofs into ALC Sequents pdf

Jens Otten, Frederico Luiz Gonçalves de Freitas, Eunice Palmeira da Silva, 2019, PxTP.

Konnektionskalküle für automatisches Beweisen in klassischen und nicht-klassischen Logiken

Jens Otten, 2013, Ausgezeichnete Informatikdissertationen.

MleanCoP: A Connection Prover for First-Order Modal Logic

Jens Otten, 2014, IJCAR.

Non-clausal Connection Calculi for Non-classical Logics

Jens Otten, 2017, TABLEAUX.

Connection-Based Proof Construction in Linear Logic

Christoph Kreitz, Jens Otten, Heiko Mantel, 1997, CADE.

A Multi-level Approach to Program Synthesis

Wolfgang Bibel, Christoph Kreitz, Jens Otten, 1997, LOPSTR.

Towards a Flexible and Versatile Cross-Layer-Coordination Architecture

Klaus Wehrle, Florian Schmidt, Jens Otten, 2010, 2010 INFOCOM IEEE Conference on Computer Communications Workshops.

Problem Libraries for Non-Classical Logics

Jens Otten, Thomas Raths, 2014, ARQNL@IJCAR.

leanCoP: lean connection-based theorem proving

Wolfgang Bibel, Jens Otten, 2003, J. Symb. Comput..

Matrix-based Constructive Theorem Proving

Christoph Kreitz, Jens Otten, Brigitte Pientka, 2000, Intellectics and Computational Logic.

ARQNL 2018 Automated Reasoning in Quantified Non-Classical Logics

Christoph Benzmüller, Jens Otten, 2018 .

Equality Preprocessing in Connection Calculi

Jens Otten, Benjamin E. Oliver, 2020, PAAR+SC²@IJCAI.

Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic

Jens Otten, J. Otten, 2005, TABLEAUX.

linTAP: A Tableau Prover for Linear Logic

Jens Otten, Heiko Mantel, 1999, TABLEAUX.

Non-clausal Connection-based Theorem Proving in Intuitionistic First-Order Logic

Jens Otten, 2016, ARQNL@IJCAR.

Implementing Connection Calculi for First-order Modal Logics

Jens Otten, 2012, IWIL@LPAR.

nanoCoP: Natural Non-clausal Theorem Proving

Jens Otten, J. Otten, 2017, IJCAI.

The ILTP Problem Library for Intuitionistic Logic

Christoph Kreitz, Jens Otten, Thomas Raths, 2007, Journal of Automated Reasoning.

A Non-clausal Connection Calculus

Jens Otten, J. Otten, 2011, TABLEAUX.

Restricting backtracking in connection calculi

Jens Otten, 2010, AI Commun..

A Connection Calculus for the Description Logic ALC

Jens Otten, Frederico Luiz Gonçalves de Freitas, 2016, Canadian Conference on AI.

Connection-based Theorem Proving in Classical and Non-classical Logics

Christoph Kreitz, Jens Otten, C. Kreitz, 1999, J. Univers. Comput. Sci..

From Schütte’s Formal Systems to Modern Automated Deduction

Wolfgang Bibel, Jens Otten, 2020 .

The nanoCoP 2.0 Connection Provers for Classical, Intuitionistic and Modal Logics

Jens Otten, 2021, TABLEAUX.

Using the TPTP Language for Representing Derivations in Tableau andConnection Calculi

Geoff Sutcliffe, Jens Otten, G. Sutcliffe, 2012 .

On the Advantage of a Non-Clausal Davis-Putnam Procedure

Jens Otten, 2004 .

linTAP : A Tableau Prover for Linear Logi

Jens Otten, Heiko Mantel, H. Mantel, 1999 .