Jens Otten - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 45 from 45

2023

20 Years of leanCoP - An Overview of the ProversJens Otten. arecca 2024: 4-22 [doi]

A Syntax for Connection ProofsJens Otten, Sean B. Holden. arecca 2024: 84-94 [doi]

Connections: Markov Decision Processes for Classical, Intuitionistic and Modal Connection CalculiFredrik Rømming, Jens Otten, Sean B. Holden. arecca 2024: 107-118 [doi]

2022

Advancing Automated Theorem Proving for the Modal Logics D and S5Jens Otten. cade 2018: 81-91 [doi]

A Highly-Integrated 20-300V 0.5W Active-Clamp Flyback DCDC Converter with 76.7% Peak EfficiencyChristoph Rindfleisch, Jens Otten, Bernhard Wicht. cicc 2022: 1-2 [doi]

2021

The nanoCoP 2.0 Connection Provers for Classical, Intuitionistic and Modal LogicsJens Otten. tableaux 2021: 236-249 [doi]

2020

Equality Preprocessing in Connection CalculiBenjamin E. Oliver, Jens Otten. IJCAI 2020: 76-92 [doi]

Equality Preprocessing in Connection CalculiBenjamin E. Oliver, Jens Otten. cade 2020: 76-92 [doi]

2018

The Pocket Reasoner -- Automatic Reasoning on Small DevicesJens Otten. nik 2018: [doi]

Proof Search Optimizations for Non-Clausal Connection CalculiJens Otten. cade 2018: 49-57 [doi]

2017

RACCOON: A Connection Reasoner for the Description Logic ALCDimas Melo Filho, Fred Freitas, Jens Otten. lpar 2017: 200-211 [doi]

Advances in Connection-Based Automated Theorem ProvingJens Otten, Wolfgang Bibel. In Michael G. Hinchey, Jonathan P. Bowen, Ernst-Rüdiger Olderog, editors, Provably Correct Systems. NASA Monographs in Systems and Software Engineering, pages 211-241, Springer, 2017. [doi]

Non-clausal Connection Calculi for Non-classical LogicsJens Otten. tableaux 2017: 209-227 [doi]

nanoCoP: Natural Non-clausal Theorem ProvingJens Otten. IJCAI 2017: 4924-4928 [doi]

2016

ALCFred Freitas, Jens Otten. ai 2016: 243-256 [doi]

Non-clausal Connection-based Theorem Proving in Intuitionistic First-Order LogicJens Otten. cade 2016: 9-20 [doi]

nanoCoP: A Non-clausal Connection ProverJens Otten. cade 2016: 302-312 [doi]

2014

Problem Libraries for Non-Classical LogicsJens Otten, Thomas Raths. cade 2015: 31-36 [doi]

MleanCoP: A Connection Prover for First-Order Modal LogicJens Otten. cade 2014: 269-276 [doi]

2013

Connection calculi for automated theorem proving in classical and non-classical logicsJens Otten. PhD thesis, University of Potsdam, 2013. [doi]

Konnektionskalküle für automatisches Beweisen in klassischen und nicht-klassischen LogikenJens Otten. gi 2014: 161-170

2012

2011

A Non-clausal Connection CalculusJens Otten. tableaux 2011: 226-241 [doi]

Implementing and Evaluating Theorem Provers for First-Order Modal LogicsThomas Raths, Jens Otten. tableaux 2011: 47-63

2010

Specifying and Verifying Organizational Security Properties in First-Order LogicChristoph Brandt, Jens Otten, Christoph Kreitz, Wolfgang Bibel. BIRTHDAY 2010: 38-53 [doi]

Restricting backtracking in connection calculiJens Otten. aicom, 23(2-3):159-182, 2010. [doi]

2008

leanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)Jens Otten. cade 2008: 283-291 [doi]

randoCoP: Randomizing the Proof Search Order in the Connection CalculusThomas Raths, Jens Otten. cade 2008: [doi]

2007

The ILTP Problem Library for Intuitionistic LogicThomas Raths, Jens Otten, Christoph Kreitz. JAR, 38(1-3):261-271, 2007. [doi]

2005

Clausal Connection-Based Theorem Proving in Intuitionistic First-Order LogicJens Otten. tableaux 2005: 245-261 [doi]

The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic LogicThomas Raths, Jens Otten, Christoph Kreitz. tableaux 2005: 333-337 [doi]

2003

leanCoP: lean connection-based theorem provingJens Otten, Wolfgang Bibel. JSC, 36(1-2):139-161, 2003. [doi]

2000

Matrix-based Constructive Theorem ProvingChristoph Kreitz, Jens Otten, Stephan Schmitt, Brigitte Pientka. BIRTHDAY 2000: 189-205

1999

Connection-based Theorem Proving in Classical and Non-classical LogicsChristoph Kreitz, Jens Otten. jucs, 5(3):88-112, 1999. [doi]

linTAP: A Tableau Prover for Linear LogicHeiko Mantel, Jens Otten. tableaux 1999: 217-231

1997

A Multi-level Approach to Program SynthesisWolfgang Bibel, Daniel S. Korn, Christoph Kreitz, F. Kurucz, Jens Otten, Stephen Schmitt, G. Stolpmann. LOPSTR 1998: 1-27 [doi]

Connection-Based Proof Construction in Linear LogicChristoph Kreitz, Heiko Mantel, Jens Otten, Stephan Schmitt. cade 1997: 207-221

ileanTAP: An Intuitionistic Theorem ProverJens Otten. tableaux 1997: 307-312

1996

T-String Unification: Unifying Prefixes in Non-classical Proof MethodsJens Otten, Christoph Kreitz. tableaux 1996: 244-260

A Uniform Proof Procedure for Classical and Non-Classical LogicsJens Otten, Christoph Kreitz. ki 1996: 307-319

1995

Guiding Program Development Systems by a Connection Based Proof StrategyChristoph Kreitz, Jens Otten, Stephan Schmitt. LOPSTR 1996: 137-151

A Connection Based Proof Method for Intuitionistic LogicJens Otten. tableaux 1995: 122-137

Sign in or sign up to see more results.

runs on WebDSL