default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJens Otten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[e5]Jens Otten, Wolfgang Bibel:
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. CEUR Workshop Proceedings 3613, CEUR-WS.org 2024 [contents]- 2023
- [c37]Jens Otten:
20 Years of leanCoP - An Overview of the Provers. AReCCa@TABLEAUX 2023: 4-22 - [c36]Jens Otten, Sean B. Holden:
A Syntax for Connection Proofs. AReCCa@TABLEAUX 2023: 84-94 - [c35]Fredrik Rømming, Jens Otten, Sean B. Holden:
Connections: Markov Decision Processes for Classical, Intuitionistic and Modal Connection Calculi. AReCCa@TABLEAUX 2023: 107-118 - [e4]Christoph Benzmüller, Jens Otten:
Proceedings of the 4th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2022) affiliated with the 11th International Joint Conference on Automated Reasoning (IJCAR 2022), Haifa, Israel, August 11, 2022. CEUR Workshop Proceedings 3326, CEUR-WS.org 2023 [contents] - 2022
- [c34]Jens Otten:
Advancing Automated Theorem Proving for the Modal Logics D and S5. ARQNL@IJCAR 2022: 81-91 - [c33]Christoph Rindfleisch, Jens Otten, Bernhard Wicht:
A Highly-Integrated 20-300V 0.5W Active-Clamp Flyback DCDC Converter with 76.7% Peak Efficiency. CICC 2022: 1-2 - 2021
- [c32]Jens Otten
:
The nanoCoP 2.0 Connection Provers for Classical, Intuitionistic and Modal Logics. TABLEAUX 2021: 236-249 - 2020
- [c31]Benjamin E. Oliver, Jens Otten:
Equality Preprocessing in Connection Calculi. PAAR+SC²@IJCAR 2020: 76-92
2010 – 2019
- 2019
- [c30]Eunice Palmeira da Silva, Fred Freitas, Jens Otten:
Converting ALC Connection Proofs into ALC Sequents. PxTP 2019: 3-17 - 2018
- [c29]Jens Otten:
Proof Search Optimizations for Non-Clausal Connection Calculi. PAAR@FLoC 2018: 49-57 - [c28]Jens Otten:
The Pocket Reasoner -- Automatic Reasoning on Small Devices. NIK 2018 - [e3]Christoph Benzmüller, Jens Otten:
Proceedings of the 3rd International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2018) affiliated with the International Joint Conference on Automated Reasoning (IJCAR 2018), Oxford, UK, July 18, 2018. CEUR Workshop Proceedings 2095, CEUR-WS.org 2018 [contents] - 2017
- [c27]Jens Otten:
nanoCoP: Natural Non-clausal Theorem Proving. IJCAI 2017: 4924-4928 - [c26]Dimas Melo Filho, Fred Freitas, Jens Otten:
RACCOON: A Connection Reasoner for the Description Logic ALC. LPAR 2017: 200-211 - [c25]Jens Otten:
Non-clausal Connection Calculi for Non-classical Logics. TABLEAUX 2017: 209-227 - [p2]Jens Otten, Wolfgang Bibel:
Advances in Connection-Based Automated Theorem Proving. Provably Correct Systems 2017: 211-241 - 2016
- [c24]Fred Freitas, Jens Otten:
A Connection Calculus for the Description Logic ALC. Canadian AI 2016: 243-256 - [c23]Jens Otten:
Non-clausal Connection-based Theorem Proving in Intuitionistic First-Order Logic. ARQNL@IJCAR 2016: 9-20 - [c22]Jens Otten:
nanoCoP: A Non-clausal Connection Prover. IJCAR 2016: 302-312 - [e2]Christoph Benzmüller, Jens Otten:
Proceedings of the 2nd International Workshop Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2016) affiliated with the International Joint Conference on Automated Reasoning (IJCAR 2016)., Coimbra, Portugal, July 1, 2016. CEUR Workshop Proceedings 1770, CEUR-WS.org 2016 [contents] - 2015
- [e1]Christoph Benzmüller, Jens Otten:
Automated Reasoning in Quantified Non-Classical Logics, ARQNL@IJCAR 2014, Vienna, Austria, July 23, 2014. EPiC Series in Computing 33, EasyChair 2015 [contents] - 2014
- [c21]Jens Otten, Thomas Raths:
Problem Libraries for Non-Classical Logics. ARQNL@IJCAR 2014: 31-36 - [c20]Jens Otten:
MleanCoP: A Connection Prover for First-Order Modal Logic. IJCAR 2014: 269-276 - 2013
- [b1]Jens Otten:
Connection calculi for automated theorem proving in classical and non-classical logics. University of Potsdam, 2013, pp. 1-145 - [p1]Jens Otten:
Konnektionskalküle für automatisches Beweisen in klassischen und nicht-klassischen Logiken. Ausgezeichnete Informatikdissertationen 2013: 161-170 - 2012
- [c19]Christoph Benzmüller, Jens Otten, Thomas Raths:
Implementing Different Proof Calculi for First-order Modal Logics. PAAR@IJCAR 2012: 12-18 - [c18]Thomas Raths, Jens Otten:
The QMLTP Problem Library for First-Order Modal Logics. IJCAR 2012: 454-461 - [c17]Christoph Benzmüller, Jens Otten, Thomas Raths:
Implementing and Evaluating Provers for First-order Modal Logics. ECAI 2012: 163-168 - [c16]Jens Otten:
Implementing Connection Calculi for First-order Modal Logics. IWIL@LPAR 2012: 18-32 - 2011
- [c15]Jens Otten:
A Non-clausal Connection Calculus. TABLEAUX 2011: 226-241 - [i1]Thomas Raths, Jens Otten:
Implementing and Evaluating Theorem Provers for First-Order Modal Logics. TABLEAUX (Workshops, Tutorials, and Short Papers) 2011: 47-63 - 2010
- [j4]Jens Otten:
Restricting backtracking in connection calculi. AI Commun. 23(2-3): 159-182 (2010) - [c14]Christoph Brandt, Jens Otten, Christoph Kreitz, Wolfgang Bibel:
Specifying and Verifying Organizational Security Properties in First-Order Logic. Verification, Induction, Termination Analysis 2010: 38-53
2000 – 2009
- 2008
- [c13]Jens Otten:
leanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions). IJCAR 2008: 283-291 - [c12]Thomas Raths, Jens Otten:
randoCoP: Randomizing the Proof Search Order in the Connection Calculus. PAAR/ESHOL 2008 - 2007
- [j3]Thomas Raths, Jens Otten, Christoph Kreitz:
The ILTP Problem Library for Intuitionistic Logic. J. Autom. Reason. 38(1-3): 261-271 (2007) - 2005
- [c11]Jens Otten:
Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic. TABLEAUX 2005: 245-261 - [c10]Thomas Raths, Jens Otten, Christoph Kreitz:
The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic. TABLEAUX 2005: 333-337 - 2003
- [j2]Jens Otten, Wolfgang Bibel:
leanCoP: lean connection-based theorem proving. J. Symb. Comput. 36(1-2): 139-161 (2003) - 2000
- [c9]Christoph Kreitz, Jens Otten, Stephan Schmitt, Brigitte Pientka:
Matrix-based Constructive Theorem Proving. Intellectics and Computational Logic 2000: 189-205
1990 – 1999
- 1999
- [j1]Christoph Kreitz, Jens Otten:
Connection-based Theorem Proving in Classical and Non-classical Logics. J. Univers. Comput. Sci. 5(3): 88-112 (1999) - [c8]Heiko Mantel, Jens Otten:
linTAP: A Tableau Prover for Linear Logic. TABLEAUX 1999: 217-231 - 1997
- [c7]Christoph Kreitz, Heiko Mantel, Jens Otten, Stephan Schmitt:
Connection-Based Proof Construction in Linear Logic. CADE 1997: 207-221 - [c6]Wolfgang Bibel, Daniel S. Korn, Christoph Kreitz, F. Kurucz, Jens Otten, Stephen Schmitt, G. Stolpmann:
A Multi-level Approach to Program Synthesis. LOPSTR 1997: 1-27 - [c5]Jens Otten:
ileanTAP: An Intuitionistic Theorem Prover. TABLEAUX 1997: 307-312 - 1996
- [c4]Jens Otten, Christoph Kreitz:
A Uniform Proof Procedure for Classical and Non-Classical Logics. KI 1996: 307-319 - [c3]Jens Otten, Christoph Kreitz:
T-String Unification: Unifying Prefixes in Non-classical Proof Methods. TABLEAUX 1996: 244-260 - 1995
- [c2]Christoph Kreitz, Jens Otten, Stephan Schmitt:
Guiding Program Development Systems by a Connection Based Proof Strategy. LOPSTR 1995: 137-151 - [c1]Jens Otten:
A Connection Based Proof Method for Intuitionistic Logic. TABLEAUX 1995: 122-137
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
