The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jens Otten: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christoph Kreitz, Jens Otten, Stephan Schmitt, Brigitte Pientka
    Matrix-based Constructive Theorem Proving. [Citation Graph (0, 0)][DBLP]
    Intellectics and Computational Logic, 2000, pp:189-205 [Conf]
  2. Christoph Kreitz, Heiko Mantel, Jens Otten, Stephan Schmitt
    Connection-Based Proof Construction in Linear Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1997, pp:207-221 [Conf]
  3. Jens Otten, Christoph Kreitz
    A Uniform Proof Procedure for Classical and Non-Classical Logics. [Citation Graph (0, 0)][DBLP]
    KI, 1996, pp:307-319 [Conf]
  4. Wolfgang Bibel, Daniel S. Korn, Christoph Kreitz, F. Kurucz, Jens Otten, Stephen Schmitt, G. Stolpmann
    A Multi-level Approach to Program Synthesis. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1997, pp:1-27 [Conf]
  5. Christoph Kreitz, Jens Otten, Stephan Schmitt
    Guiding Program Development Systems by a Connection Based Proof Strategy. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1995, pp:137-151 [Conf]
  6. Heiko Mantel, Jens Otten
    linTAP: A Tableau Prover for Linear Logic. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1999, pp:217-231 [Conf]
  7. Jens Otten
    Clausal Connection-Based Theorem Proving in Intuitionistic First-Order Logic. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2005, pp:245-261 [Conf]
  8. Jens Otten
    A Connection Based Proof Method for Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1995, pp:122-137 [Conf]
  9. Jens Otten
    ileanTAP: An Intuitionistic Theorem Prover. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1997, pp:307-312 [Conf]
  10. Jens Otten, Christoph Kreitz
    T-String Unification: Unifying Prefixes in Non-classical Proof Methods. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1996, pp:244-260 [Conf]
  11. Thomas Raths, Jens Otten, Christoph Kreitz
    The ILTP Library: Benchmarking Automated Theorem Provers for Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2005, pp:333-337 [Conf]
  12. Jens Otten, Wolfgang Bibel
    leanCoP: lean connection-based theorem proving. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2003, v:36, n:1-2, pp:139-161 [Journal]
  13. Christoph Kreitz, Jens Otten
    Connection-based Theorem Proving in Classical and Non-classical Logics. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1999, v:5, n:3, pp:88-112 [Journal]
  14. Thomas Raths, Jens Otten, Christoph Kreitz
    The ILTP Problem Library for Intuitionistic Logic. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2007, v:38, n:1-3, pp:261-271 [Journal]

  15. leanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions). [Citation Graph (, )][DBLP]


  16. randoCoP: Randomizing the Proof Search Order in the Connection Calculus. [Citation Graph (, )][DBLP]


  17. Restricting backtracking in connection calculi. [Citation Graph (, )][DBLP]


Search in 0.080secs, Finished in 0.081secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002