| Author/Editor [Non Institute] | Year | | Title | Type |
|---|
Gabbay, Kruse, Nonnengart, Ohlbach (ed.)
(Ed: Gabbay, Kruse, Nonnengart, Ohlbach)
[-] | 1997 | | Qualitative and Quantitative Practical Reasoning | Book |
Gabbay, Ohlbach
(Ed: Broda)
[-] | 1992 | | From a Hilbert Calculus to its Model Theoretic Semantics
In: Proc.~4th Annual UK Conference on Logic Programming (APULK '92), 218-252 | Proceedings Article |
Gabbay, Ohlbach
(Ed: Nebel, Rich, Swartout)
[-] | 1992 | | Quantifier Elimination in Second-Order Predicate Logic
In: Principles of Knowledge Representation and Reasoning (KR92),, 425-435
In: South African Computer Journal [7], 425-435 | Proceedings Article |
Gabbay, Ohlbach
[-] | 1992 | | Quantifier Elimination in Second-Order Predicate Logic
In: South African Computer Journal [7], 35-43 | Journal Article |
Gabbay, Ohlbach (ed.)
(Ed: Gabbay, Ohlbach)
[-] | 1994 | | Temporal Logic: Proceedings of the 1st International Conference on Temporal Logic | Proceedings |
Gaede
[-] | 1995 |  | Superposition Extended with Sorts
Universität Kaiserslautern | Thesis - Masters thesis |
Gaillourdet, Hillenbrand, Löchner, Spies
(Ed: Baader)
[Baader] | 2003 | | The New WALDMEISTER Loop at Work
In: Automated deduction, CADE-19 : 19th International Conference on Automated Deduction, 317-321 | Proceedings Article |
Gamkrelidze
[-] | 2001 | | Einige Optimierungsmethoden hierarchischer Schaltkreise
Universität des Saarlandes | Thesis - PhD thesis |
Ganzinger
(Ed: Danvy, Filinski)
[Danvy, Filinski] | 2001 | | Bottom-Up Deduction with Deletion and Priorities
In: Programs as Data Objects (PADO-01) : Second Symposium PADO 2001, 276-277 | Proceedings Article |
Ganzinger
(Ed: Meyer auf der Heide, Monien)
[-] | 1996 | | Saturation-based theorem proving (abstract)
In: Automata, Languages and Programming: International Colloquium (ICALP-23), 1-3 | Proceedings Article |
Ganzinger
(Ed: Voronkov)
[-] | 2002 | | Shostak Light
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 332-346 | Proceedings Article |
Ganzinger
(Ed: Williams)
[-] | 2001 | | Relating Semantic and Proof-Theoretic Concepts for Polynomial Time Decidability of Uniform Word Problems
In: Proceedings of the 16th IEEE Symposium on Logic in Computer Science (LICS-01), 81-90 | Proceedings Article |
Ganzinger
[-] | 2001 | | Efficient deductive methods for program analysis
In: ACM SIGPLAN Notices [36], 102-103 | Journal Article |
Ganzinger
[-] | 1998 | | Preface
In: Theoretical Computer Science [208], 1 | Journal Article |
Ganzinger
[-] | 1994 | | The Saturate System | Unpublished/Draft |
Ganzinger
[-] | 1991 | | A completion procedure for conditional equations
In: Journal of Symbolic Computation [11], 51-81 | Journal Article |
Ganzinger
[-] | 1991 | | Order-Sorted Completion: The Many-Sorted Way
In: Theoretical Computer Science [89], 3-32 | Journal Article |
Ganzinger (ed.)
(Ed: Ganzinger)
[-] | 1999 | | Proceedings of the 16th International Conference on Automated Deduction (CADE-16) | Proceedings |
Ganzinger (ed.)
(Ed: Ganzinger)
[-] | 1996 | | Rewriting Techniques and Applications, 7th International Conference, RTA-96 | Proceedings |
Ganzinger, de Nivelle
(Ed: Longo)
[Longo] | 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 |
Ganzinger, Hagen, Nieuwenhuis, Oliveras, Tinelli
(Ed: Alur, Peled)
[-] | 2004 | | DPLL(T): Fast Decision Procedures
In: Computer aided verification : 16th International Conference, CAV 2004, 175-188 | Proceedings Article |
Ganzinger, Hillenbrand, Waldmann
(Ed: Baader)
[-] | 2003 | | Superposition modulo a Shostak Theory
In: Automated Deduction, CADE-19 : 19th International Conference on Automated Deduction, 182-196 | Proceedings Article |
Ganzinger, Hustadt, Meyer, Schmidt
(Ed: Zakharyaschev, Segerberg, de Rijke, Wansing)
[-] | 2001 | | A Resolution-Based Decision Procedure for Extensions of K4
In: Advances in Modal Logic, Volume 2, 225-246 | Part of a Book |
Ganzinger, Jacquemard, Veanes
(Ed: Hsiang, Ohori)
[Hsiang, Ohori] | 1998 | | Rigid Reachability
In: Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science (ASIAN-98), 4-21 | Proceedings Article |
Ganzinger, Jacquemard, Veanes
[Jacquemard, Veanes] | 2000 | | Rigid Reachability: The Non-Symmetric Form of Rigid E-unification
In: International Journal of Foundations of Computer Science [11], 3-27 | Journal Article |
Ganzinger, Korovin
(Ed: Hermann, Voronkov)
[-] | 2006 | | Theory Instantiation
In: 13th Conference on Logic for Programming Artificial Intelligence Reasoning (LPAR'06), 497-511 | Proceedings Article |
Ganzinger, Korovin
(Ed: Hermann, Voronkov)
[-] | 2006 | | Theory Instantiation
In: Logic for Programming, Artificial Intelligence, and Reasoning : 13th International Conference, LPAR 2006, 497-511 | Proceedings Article |
Ganzinger, Korovin
(Ed: Kolaitis)
[-] | 2003 | | New Directions in Instantiation-Based Theorem Proving
In: 18th Annual IEEE Symposium on Logic in Computer Science (LICS-03), 55-64 | Proceedings Article |
Ganzinger, Korovin
(Ed: Marcinkowski, Tarlecki)
[-] | 2004 | | Integration of equational reasoning into instantiation-based theorem proving
In: Computer science logic : 18th International Workshop CSL 2004, 13th Annual Conference of the EACSL, 71-84 | Proceedings Article |
Ganzinger, McAllester
(Ed: Goré, Leitsch, Nipkow)
[-] | 2001 | | A new meta-complexity theorem for bottom-up logic programs
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 514-528 | Proceedings Article |
