The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexander Leitsch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexander Leitsch
    Deciding Horn Classes by Hyperresolution. [Citation Graph (1, 0)][DBLP]
    CSL, 1989, pp:225-241 [Conf]
  2. Matthias Baaz, Alexander Leitsch, Georg Moser
    System Description: CutRes 0.1: Cut Elimination by Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 1999, pp:212-216 [Conf]
  3. Matthias Baaz, Alexander Leitsch, Richard Zach
    Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs. [Citation Graph (0, 0)][DBLP]
    CSL, 1995, pp:1-15 [Conf]
  4. Matthias Baaz, Alexander Leitsch
    Fast Cut-Elimination by Projection. [Citation Graph (0, 0)][DBLP]
    CSL, 1996, pp:18-33 [Conf]
  5. Christian G. Fermüller, Alexander Leitsch
    Model Building by Resolution. [Citation Graph (0, 0)][DBLP]
    CSL, 1992, pp:134-148 [Conf]
  6. Matthias Baaz, Alexander Leitsch
    Comparing the Complexity of Cut-Elimination Methods. [Citation Graph (0, 0)][DBLP]
    Proof Theory in Computer Science, 2001, pp:49-67 [Conf]
  7. Matthias Baaz, Alexander Leitsch
    Strong splitting rules in automated theorem proving. [Citation Graph (0, 0)][DBLP]
    EUROCAL, 1987, pp:424-425 [Conf]
  8. Georg Gottlob, Alexander Leitsch
    Fast Subsumption Algorithms. [Citation Graph (0, 0)][DBLP]
    European Conference on Computer Algebra (2), 1985, pp:64-77 [Conf]
  9. Alexander Leitsch
    Decision Procedures and Model Building, or How to Improve Logical Information in Automated Deduction. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:62-79 [Conf]
  10. Matthias Baaz, Alexander Leitsch
    A Strong Problem Reduction Method Based on Function Introduction. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1990, pp:30-37 [Conf]
  11. Matthias Baaz, Christian G. Fermüller, Alexander Leitsch
    A Non-Elementary Speed-Up in Proof Length by Structural Clause Form Transformation [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:213-219 [Conf]
  12. Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr
    Cut-Elimination: Experiments with CERES. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:481-495 [Conf]
  13. Matthias Baaz, Alexander Leitsch
    CERES in Many-Valued Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 2004, pp:1-20 [Conf]
  14. Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr
    Proof Transformation by CERES. [Citation Graph (0, 0)][DBLP]
    MKM, 2006, pp:82-93 [Conf]
  15. Matthias Baaz, Alexander Leitsch
    Eine Methode zur automatischen Problemreduktion. [Citation Graph (0, 0)][DBLP]
    ÖGAI, 1985, pp:154-163 [Conf]
  16. Matthias Baaz, Alexander Leitsch
    Complexity of Resolution Proofs and Function Introduction. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1992, v:57, n:3, pp:181-215 [Journal]
  17. Matthias Baaz, Alexander Leitsch
    Cut Normal Forms and Proof Complexity. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:97, n:1-3, pp:127-177 [Journal]
  18. Matthias Baaz, Alexander Leitsch
    On Skolemization and Proof Complexity. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1994, v:20, n:4, pp:353-379 [Journal]
  19. Alexander Leitsch
    Complexity of index sets and translating functions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1980, v:3, n:2, pp:181-188 [Journal]
  20. Alexander Leitsch
    Deciding Clause Classes by Semantic Clash Resolution. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1993, v:18, n:, pp:163-182 [Journal]
  21. Christian G. Fermüller, Alexander Leitsch
    Decision Procedures and Model Building in Equational Clause Logic. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 1998, v:6, n:1, pp:17-41 [Journal]
  22. Georg Gottlob, Alexander Leitsch
    On the Efficiency of Subsumption Algorithms [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:2, pp:280-295 [Journal]
  23. Matthias Baaz, Alexander Leitsch
    Cut-elimination and Redundancy-elimination by Resolution. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2000, v:29, n:2, pp:149-177 [Journal]
  24. Matthias Baaz, Alexander Leitsch
    Towards a clausal analysis of cut-elimination. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2006, v:41, n:3-4, pp:381-410 [Journal]
  25. Christian G. Fermüller, Alexander Leitsch
    Hyperresolution and Automated Model Building. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1996, v:6, n:2, pp:173-203 [Journal]
  26. Matthias Baaz, Alexander Leitsch, Richard Zach
    Completeness of a First-Order Temporal Logic with Time-Gaps. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:241-270 [Journal]
  27. Stefan Hetzl, Alexander Leitsch
    Proof Transformations and Structural Invariance. [Citation Graph (0, 0)][DBLP]
    Algebraic and Proof-theoretic Aspects of Non-classical Logics, 2006, pp:201-230 [Conf]

  28. Herbrand Sequent Extraction. [Citation Graph (, )][DBLP]


  29. System Description: The Proof Transformation System CERES. [Citation Graph (, )][DBLP]


  30. A Clausal Approach to Proof Analysis in Second-Order Logic. [Citation Graph (, )][DBLP]


  31. Transforming and Analyzing Proofs in the CERES-System. [Citation Graph (, )][DBLP]


Search in 0.046secs, Finished in 0.047secs
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