| BibTeX cite key | Author/Editor | Year | | Title | Type |
|---|
| Ganzinger-91-tcs | Ganzinger, Harald | 1991 | | Order-Sorted Completion: The Many-Sorted Way
In: Theoretical Computer Science [89], 3-32 | Journal Article |
| Ganzinger-94-sat | Ganzinger, Harald | 1994 | | The Saturate System | Unpublished/Draft |
| Ganzinger-ed-cade-1999 | Ganzinger (ed.) | 1999 | | Proceedings of the 16th International Conference on Automated Deduction (CADE-16) | Proceedings |
| Ganzinger-et-al-00-AIML | Ganzinger, Harald
Hustadt, Ullrich
Meyer, Christoph
Schmidt, Renate A. | 2001 |  | A Resolution-Based Decision Procedure for Extensions of K4
In: Advances in Modal Logic, Volume 2, 225-246 | Part of a Book |
| Ganzinger-et-al-01-Dagstuhl | Furbach, Ganzinger, Hasegawa, Kapur (ed.) | 2000 | | Deduction | Proceedings |
| Ganzinger-SofronieStokkermans-Waldmann-ijcar-2004 | Ganzinger, Harald
Sofronie-Stokkermans, Viorica
Waldmann, Uwe | 2004 | | Modular Proof Systems for Partial Functions with Weak Equality
In: Automated reasoning : Second International Joint Conference, IJCAR 2004, 168-182 | Proceedings Article |
| Ganzinger-Stuber-ic-05 | Ganzinger, Harald
Stuber, Jürgen | 2005 | | Superposition with equivalence reasoning and delayed clause normal form transformation
In: Information and Computation [199], 3-23 | Journal Article |
| Ganzinger1999LPAR | Ganzinger, McAllester, Voronkov (ed.) | 1999 | | Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99) | Proceedings |
| Ganzinger2003a | Ganzinger, Harald | 2001 | | Bottom-Up Deduction with Deletion and Priorities
In: Programs as Data Objects (PADO-01) : Second Symposium PADO 2001, 276-277 | Proceedings Article |
| Ganzinger96-ICALP-23 | Ganzinger, Harald | 1996 | | Saturation-based theorem proving (abstract)
In: Automata, Languages and Programming: International Colloquium (ICALP-23), 1-3 | Proceedings Article |
| Ganzinger98 | Ganzinger, Harald | 1998 | | Preface
In: Theoretical Computer Science [208], 1 | Journal Article |
| GanzingerHillenbrandWaldmann2003 | Ganzinger, Harald
Hillenbrand, Thomas
Waldmann, Uwe | 2003 | | Superposition modulo a Shostak Theory
In: Automated Deduction, CADE-19 : 19th International Conference on Automated Deduction, 182-196 | Proceedings Article |
| GanzingerJacquemardVeanes-00-ijfcs | Ganzinger, Harald
Jacquemard, Florent
Veanes, Margus | 2000 | | Rigid Reachability: The Non-Symmetric Form of Rigid E-unification
In: International Journal of Foundations of Computer Science [11], 3-27 | Journal Article |
| GanzingerJacquemardVeanes-98 | Ganzinger, Harald
Jacquemard, Florent
Veanes, Margus | 1998 | | Rigid Reachability
In: Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science (ASIAN-98), 4-21 | Proceedings Article |
| GanzingerKorovin-03-lics | Ganzinger, Harald
Korovin, Konstantin | 2003 | | New Directions in Instantiation-Based Theorem Proving
In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 55-64 | Proceedings Article |
| GanzingerMcAllester-01-ijcar | Ganzinger, Harald
McAllester, David | 2001 | | A new meta-complexity theorem for bottom-up logic programs
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 514-528 | Proceedings Article |
| GanzingerMcAllester-02-iclp | Ganzinger, Harald
McAllester, David | 2002 | | Logical Algorithms
In: Logic Programming. 18th International Conference, ICLP 2002, 209-223 | Proceedings Article |
| GanzingerMeyerVeanes-99-lics | Ganzinger, Harald
Meyer, Christoph
Veanes, Margus | 1999 | | The Two-Variable Guarded Fragment with Transitive Relations
In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99), 24-34 | Proceedings Article |
| GanzingerMeyerWeidenbach-97-cade | Ganzinger, Harald
Meyer, Christoph
Weidenbach, Christoph | 1997 | | Soft Typing for Ordered Resolution
In: Proceedings of the 14th International Conference on Automated Deduction (CADE-14), 321-335 | Proceedings Article |
| GanzingerNieuwenhuis-01-ccl | Ganzinger, Harald
Nieuwenhuis, Robert | 2001 | | Constraints and Theorem Proving
In: Contraints in Computational Logics, International Summer School (CCL-99), 159-201 | Proceedings Article |
| GanzingerNieuwenhuisNivela-01-ijcar | Ganzinger, Harald
Nieuwenhuis, Robert
Nivela, Pilar | 2001 | | Context trees
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 242-256 | Proceedings Article |
| GanzingerNieuwenhuisNivela-03-jar | Ganzinger, Harald
Nieuwenhuis, Robert
Nivela, Pilar | 2004 | | Fast Term Indexing with Coded Context Trees
In: Journal of Automated Reasoning [32], 103-120 | Journal Article |
| GanzingerNivelle-99-lics | Ganzinger, Harald
de Nivelle, Hans | 1999 | | A Superposition Decision Procedure for the Guarded Fragment with Equality
In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science (LICS-99), 295-303 | Proceedings Article |
| GanzingerRTA96 | Ganzinger (ed.) | 1996 | | Rewriting Techniques and Applications, 7th International Conference, RTA-96 | Proceedings |
| GanzingerSofronie-Stokkermans-00-ismvl | Ganzinger, Harald
Sofronie-Stokkermans, Viorica | 2000 | | Chaining Techniques for Automated Theorem Proving in Many-Valued Logics
In: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL-00), 337-344 | Proceedings Article |
| GanzingerStuber-2003-cade | Ganzinger, Harald
Stuber, Jürgen | 2003 | | Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation
In: Automated Deduction, CADE-19 : 19th International Conference on Automated Deduction, 335-349 | Proceedings Article |
| GanzingerStuber-92 | Ganzinger, Harald
Stuber, Jürgen | 1992 | | Inductive theorem proving by consistency for first-order clauses
In: Informatik - Festschrift zum 60. Geburtstag von Günter Hotz, 441-462 | Part of a Book |
| GanzingerWaldmann-92-ctrs | Ganzinger, Harald
Waldmann, Uwe | 1992 | | Termination Proofs of Well-Moded Logic Programs Via Conditional Rewrite Systems
In: Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems '92, 430-437 | Proceedings Article |
| GanzingerWaldmann1996CADE | Ganzinger, Harald
Waldmann, Uwe | 1996 | | Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 388-402 | Proceedings Article |
| Ganzinger:2001:EDM | Ganzinger, Harald | 2001 | | Efficient deductive methods for program analysis
In: ACM SIGPLAN Notices [36], 102-103 | Journal Article |
