The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Harald Ganzinger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
    Basic Paramodulation and Superposition. [Citation Graph (1, 0)][DBLP]
    CADE, 1992, pp:462-476 [Conf]
  2. Leo Bachmair, Harald Ganzinger, Uwe Waldmann
    Set Constraints are the Monadic Class [Citation Graph (1, 0)][DBLP]
    LICS, 1993, pp:75-83 [Conf]
  3. Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
    Basic Paramodulation [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1995, v:121, n:2, pp:172-192 [Journal]
  4. Leo Bachmair, Harald Ganzinger
    Rewrite-Based Equational Theorem Proving with Selection and Simplification. [Citation Graph (1, 0)][DBLP]
    J. Log. Comput., 1994, v:4, n:3, pp:217-247 [Journal]
  5. Harald Ganzinger
    Parameterized Specifications - Parameterized Passing and Implementation with Respect to Observability. [Citation Graph (0, 0)][DBLP]
    ADT, 1982, pp:- [Conf]
  6. Harald Ganzinger
    Modular Compiler Descriptions based on Abstract Semantic Data Types. [Citation Graph (0, 0)][DBLP]
    ADT, 1983, pp:- [Conf]
  7. Harald Ganzinger
    Knuth-Bendix Completion for Parametric Specifications with Conditional Equations. [Citation Graph (0, 0)][DBLP]
    ADT, 1986, pp:- [Conf]
  8. Harald Ganzinger
    Completion with History-Dependent Complexities for Generated Equations. [Citation Graph (0, 0)][DBLP]
    ADT, 1987, pp:73-91 [Conf]
  9. Harald Ganzinger, Ullrich Hustadt, Christoph Meyer, Renate A. Schmidt
    A Resolution-Based Decision Procedure for Extensions of K4. [Citation Graph (0, 0)][DBLP]
    Advances in Modal Logic, 1998, pp:225-246 [Conf]
  10. Leo Bachmair, Harald Ganzinger, Uwe Waldmann
    Theorem Proving for Hierarchic First-Order Theories. [Citation Graph (0, 0)][DBLP]
    ALP, 1992, pp:420-434 [Conf]
  11. Harald Ganzinger, Florent Jacquemard, Margus Veanes
    Rigid Reachability. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1998, pp:4-21 [Conf]
  12. Leo Bachmair, Harald Ganzinger
    On Restrictions of Ordered Paramodulation with Simplification. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:427-441 [Conf]
  13. Leo Bachmair, Harald Ganzinger
    Ordered Chaining for Total Orderings. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:435-450 [Conf]
  14. Leo Bachmair, Harald Ganzinger
    Strict Basic Superposition. [Citation Graph (0, 0)][DBLP]
    CADE, 1998, pp:160-174 [Conf]
  15. Leo Bachmair, Harald Ganzinger, Andrei Voronkov
    Elimination of Equality via Transformation with Ordering Constraints. [Citation Graph (0, 0)][DBLP]
    CADE, 1998, pp:175-190 [Conf]
  16. Harald Ganzinger
    Shostak Light. [Citation Graph (0, 0)][DBLP]
    CADE, 2002, pp:332-346 [Conf]
  17. Harald Ganzinger
    Saturation-Based Theorem Proving: Past Successes and Future Potential (Abstract). [Citation Graph (0, 0)][DBLP]
    CADE, 1996, pp:1- [Conf]
  18. Harald Ganzinger, Thomas Hillenbrand, Uwe Waldmann
    Superposition Modulo a Shostak Theory. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:182-196 [Conf]
  19. Harald Ganzinger, David A. McAllester
    A New Meta-complexity Theorem for Bottom-Up Logic Programs. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:514-528 [Conf]
  20. Harald Ganzinger, Christoph Meyer, Christoph Weidenbach
    Soft Typing for Ordered Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 1997, pp:321-335 [Conf]
  21. Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela
    Context Trees. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:242-256 [Conf]
  22. Harald Ganzinger, Jürgen Stuber
    Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:335-349 [Conf]
  23. Harald Ganzinger, Viorica Sofronie-Stokkermans, Uwe Waldmann
    Modular Proof Systems for Partial Functions with Weak Equality. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2004, pp:168-182 [Conf]
  24. Harald Ganzinger, Uwe Waldmann
    Theorem Proving in Cancellative Abelian Monoids (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CADE, 1996, pp:388-402 [Conf]
  25. Harald Ganzinger, George Hagen, Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli
    DPLL( T): Fast Decision Procedures. [Citation Graph (0, 0)][DBLP]
    CAV, 2004, pp:175-188 [Conf]
  26. Harald Ganzinger
    Transforming denotational semantics into practical attribute grammars. [Citation Graph (0, 0)][DBLP]
    Semantics-Directed Compiler Generation, 1980, pp:1-69 [Conf]
  27. Leo Bachmair, Harald Ganzinger
    Buchberger's Algorithm: A Constraint-Based Completion Procedure. [Citation Graph (0, 0)][DBLP]
    CCL, 1994, pp:285-301 [Conf]
  28. Harald Ganzinger, Robert Nieuwenhuis
    Constraints and Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CCL, 1999, pp:159-201 [Conf]
  29. Leo Bachmair, Harald Ganzinger, Jürgen Stuber
    Combining Algebra and Universal Algebra in First-Order Theorem Proving: The Case of Commutative Rings. [Citation Graph (0, 0)][DBLP]
    COMPASS/ADT, 1994, pp:1-29 [Conf]
  30. Harald Ganzinger, Konstantin Korovin
    Integrating Equational Reasoning into Instantiation-Based Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CSL, 2004, pp:71-84 [Conf]
  31. Leo Bachmair, Harald Ganzinger
    Completion of First-Order Clauses with Equality by Strict Superposition (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CTRS, 1990, pp:162-180 [Conf]
  32. Leo Bachmair, Harald Ganzinger
    Associative-Commutative Superposition. [Citation Graph (0, 0)][DBLP]
    CTRS, 1994, pp:1-14 [Conf]
  33. Hubert Bertling, Harald Ganzinger, Renate Schäfers
    A Systems for the Completion of Conditional Equational Specifications. [Citation Graph (0, 0)][DBLP]
    CTRS, 1987, pp:249-250 [Conf]
  34. Harald Ganzinger
    A Completion Procedure for Conditional Equations. [Citation Graph (0, 0)][DBLP]
    CTRS, 1987, pp:62-83 [Conf]
  35. Harald Ganzinger, Jürgen Stuber
    Inductive Theorem Proving by Consistency for First-Order Clauses. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:226-241 [Conf]
  36. Harald Ganzinger, Uwe Waldmann
    Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    CTRS, 1992, pp:430-437 [Conf]
  37. Hubert Bertling, Harald Ganzinger, Renate Schäfers
    CEC: A System for the Completion of Conditional Equational Specifications. [Citation Graph (0, 0)][DBLP]
    ESOP, 1988, pp:378-379 [Conf]
  38. Harald Ganzinger
    An Approach to the Derivation of Compiler Descrition Concepts from the Mathematical Semantics Concept. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1979, pp:206-217 [Conf]
  39. Harald Ganzinger
    Description of Parameterized Compiler Modules. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1981, pp:11-19 [Conf]
  40. Harald Ganzinger
    Programs as Transformations of Algebraic Theories (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1981, pp:32-40 [Conf]
  41. Harald Ganzinger
    Nichtprozedurale Sprachen und Probleme bei ihrer Implementierung (Kurzfassung). [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (1), 1986, pp:35- [Conf]
  42. Harald Ganzinger, Georg Heeg
    Efficient Implementation of the Graphical Input/Output for Smalltalk-80. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (1), 1986, pp:151-164 [Conf]
  43. Harald Ganzinger, Reinhard Wilhelm
    Verschränkung von Compiler-Moduln. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1975, pp:654-665 [Conf]
  44. Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes
    Decidable Fragments of Simultaneous Rigid Reachability. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:250-260 [Conf]
  45. Harald Ganzinger
    Modular Compiler Descriptions Based on Abstract Semantic Data Types (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:237-249 [Conf]
  46. Harald Ganzinger
    Saturation-Based Theorem Proving (Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:1-3 [Conf]
  47. Leo Bachmair, Harald Ganzinger
    Perfect Model Semantics for Logic Programs with Equality. [Citation Graph (0, 0)][DBLP]
    ICLP, 1991, pp:645-659 [Conf]
  48. Harald Ganzinger, David A. McAllester
    Logical Algorithms. [Citation Graph (0, 0)][DBLP]
    ICLP, 2002, pp:209-223 [Conf]
  49. Harald Ganzinger, Renate Schäfers
    System Support for Modular Order-Sorted Horn Clause Specifications. [Citation Graph (0, 0)][DBLP]
    ICSE, 1990, pp:150-159 [Conf]
  50. Reinhard Wilhelm, Knut Ripken, Joachim Ciesinger, Harald Ganzinger, Walter Lahner, R. Nollmann
    Design Evaluation of the Compiler Generating System MUGI. [Citation Graph (0, 0)][DBLP]
    ICSE, 1976, pp:571-576 [Conf]
  51. Harald Ganzinger, Knut Ripken, Reinhard Wilhelm
    Automatic Generation of Optimizing Multipass Compilers. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1977, pp:535-540 [Conf]
  52. Harald Ganzinger, Viorica Sofronie-Stokkermans
    Chaining Techniques for Automated Theorem Proving in Many-Valued Logics. [Citation Graph (0, 0)][DBLP]
    ISMVL, 2000, pp:337-344 [Conf]
  53. Leo Bachmair, Harald Ganzinger, Uwe Waldmann
    Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1993, pp:83-96 [Conf]
  54. Leo Bachmair, Harald Ganzinger
    Rewrite Techniques for Transitive Relations [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:384-393 [Conf]
  55. David A. Basin, Harald Ganzinger
    Complexity Analysis Based on Ordered Resolution. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:456-465 [Conf]
  56. Harald Ganzinger
    Relating Semantic and Proof-Theoretic Concepts for Polynominal Time Decidability of Uniform Word Problems. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:81-92 [Conf]
  57. Harald Ganzinger, Konstantin Korovin
    New Directions in Instantiation-Based Theorem Proving. [Citation Graph (0, 0)][DBLP]
    LICS, 2003, pp:55-64 [Conf]
  58. Harald Ganzinger, Christoph Meyer, Margus Veanes
    The Two-Variable Guarded Fragment with Transitive Relations. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:24-34 [Conf]
  59. Harald Ganzinger, Hans de Nivelle
    A Superposition Decision Procedure for the Guarded Fragment with Equality. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:295-304 [Conf]
  60. Leo Bachmair, Harald Ganzinger
    Non-Clausal Resolution and Superposition with Selection and Redundancy Criteria. [Citation Graph (0, 0)][DBLP]
    LPAR, 1992, pp:273-284 [Conf]
  61. Harald Ganzinger, Konstantin Korovin
    Theory Instantiation. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:497-511 [Conf]
  62. Harald Ganzinger
    Bottom-Up Deduction with Deletion and Priorities. [Citation Graph (0, 0)][DBLP]
    PADO, 2001, pp:276-278 [Conf]
  63. Harald Ganzinger
    Modular first-order specifications of operational semantics. [Citation Graph (0, 0)][DBLP]
    Programs as Data Objects, 1985, pp:82-95 [Conf]
  64. Harald Ganzinger
    Efficient deductive methods for program analysis. [Citation Graph (0, 0)][DBLP]
    POPL, 2001, pp:102-103 [Conf]
  65. Harald Ganzinger
    Darstellung der Artanpassung in höheren Programmiersprachen durch Repräsentation von Gruppen. [Citation Graph (0, 0)][DBLP]
    Fachtagung über Programmiersprachen, 1976, pp:194-202 [Conf]
  66. Hubert Bertling, Harald Ganzinger, Renate Schäfers, Robert Nieuwenhuis, Fernando Orejas
    Program Development: Completion Subsystem. [Citation Graph (0, 0)][DBLP]
    PROSPECTRA Book, 1993, pp:460-494 [Conf]
  67. Hubert Bertling, Harald Ganzinger
    Completion-Time Optimization of Rewrite-Time Goal Solving. [Citation Graph (0, 0)][DBLP]
    RTA, 1989, pp:45-58 [Conf]
  68. Harald Ganzinger, Robert Giegerich
    Attribute coupled grammars. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Symposium on Compiler Construction, 1984, pp:157-170 [Conf]
  69. Harald Ganzinger, Robert Giegerich, Ulrich Möncke, Reinhard Wilhelm
    A Truly Generative Semantics-Directed Compiler Generator. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Symposium on Compiler Construction, 1982, pp:172-184 [Conf]
  70. Harald Ganzinger, Michael Hanus
    Modular Logic Programming of Compilers. [Citation Graph (0, 0)][DBLP]
    SLP, 1985, pp:242-253 [Conf]
  71. Hubert Bertling, Harald Ganzinger, Hubert Baumeister
    CEC (Conditional Equations Completion). [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:470- [Conf]
  72. Harald Ganzinger
    Ground Term Confluence in Parametric Conditional Equational Specifications. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:286-298 [Conf]
  73. Harald Ganzinger
    Order-Sorted Completion: The Many-Sorted Way (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1989, pp:244-258 [Conf]
  74. Harald Ganzinger
    On Storage Optimization for Automatically Generated Compilers. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:132-141 [Conf]
  75. Leo Bachmair, Harald Ganzinger, Uwe Waldmann
    Refutational Theorem Proving for Hierachic First-Order Theories. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1994, v:5, n:, pp:193-212 [Journal]
  76. Harald Ganzinger, Robert Giegerich
    A note on termination in combinatiosn of heterogeneous term rewriting systems. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1987, v:31, n:, pp:22-27 [Journal]
  77. Harald Ganzinger, Jürgen Stuber
    Superposition with equivalence reasoning and delayed clause normal form transformation. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:199, n:1-2, pp:3-23 [Journal]
  78. Harald Ganzinger, Viorica Sofronie-Stokkermans, Uwe Waldmann
    Modular proof systems for partial functions with Evans equality. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:10, pp:1453-1492 [Journal]
  79. Harald Ganzinger, Florent Jacquemard, Margus Veanes
    Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:1, pp:3-27 [Journal]
  80. Leo Bachmair, Harald Ganzinger
    Ordered Chaining Calculi for First-Order Theories of Transitive Relations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:6, pp:1007-1049 [Journal]
  81. David A. Basin, Harald Ganzinger
    Automated complexity analysis based on ordered resolution. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:1, pp:70-109 [Journal]
  82. Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela
    Fast Term Indexing with Coded Context Trees. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2004, v:32, n:2, pp:103-120 [Journal]
  83. Harald Ganzinger
    A Completion Procedure for Conditional Equations. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1991, v:11, n:1/2, pp:51-81 [Journal]
  84. Harald Ganzinger
    Konferenzbericht LICS '92. [Citation Graph (0, 0)][DBLP]
    KI, 1992, v:6, n:3, pp:51- [Journal]
  85. Harald Ganzinger, Jörg H. Siekmann, Peter H. Schmitt
    Wohin geht die automatische Deduktion? [Citation Graph (0, 0)][DBLP]
    KI, 1998, v:12, n:4, pp:33-37 [Journal]
  86. Harald Ganzinger
    Increasing Modularity and Language-Independency in Automatically Generated Compilers. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1983, v:3, n:3, pp:223-278 [Journal]
  87. Harald Ganzinger, Walter Willmertinger
    FOAM: A Two-Level Approach to Text Formatting on a Microcomputer System. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1985, v:15, n:4, pp:327-341 [Journal]
  88. Harald Ganzinger
    Order-Sorted Completion: The Many-Sorted Way. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:89, n:1, pp:3-32 [Journal]
  89. Harald Ganzinger
    Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1983, v:5, n:3, pp:318-354 [Journal]

Search in 0.108secs, Finished in 0.113secs
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