| BibTeX cite key | Author/Editor | Year | | Title | Type |
|---|
| Waldmann1997 | Waldmann, Uwe | 1997 | | Cancellative Abelian Monoids in Refutational Theorem Proving
Universität des Saarlandes | Thesis - PhD thesis |
| Waldmann1997FTP | Waldmann, Uwe | 1997 | | A Superposition Calculus for Divisible Torsion-Free Abelian Groups
In: Proceedings of the International Workshop on First-Order Theorem Proving (FTP-97), 130-134 | Proceedings Article |
| Waldmann1998 | Waldmann, Uwe | 1998 | | Superposition for Divisible Torsion-Free Abelian Groups
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 144-159 | Proceedings Article |
| Waldmann1998IPL | Waldmann, Uwe | 1998 | | Extending reduction orderings to ACU-compatible reduction orderings
In: Information Processing Letters [67], 43-49 | Journal Article |
| Waldmann1999LPAR | Waldmann, Uwe | 1999 | | Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
In: Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99), 131-147 | Proceedings Article |
| Waldmann2001IJCAR | Waldmann, Uwe | 2001 | | Superposition and Chaining for Totally Ordered Divisible Abelian Groups (Extended Abstract)
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 226-241 | Proceedings Article |
| Waldmann2002aJSC | Waldmann, Uwe | 2002 | | Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I)
In: Journal of Symbolic Computation [33], 777-829 | Journal Article |
| Waldmann2002bJSC | Waldmann, Uwe | 2002 | | Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II)
In: Journal of Symbolic Computation [33], 831-861 | Journal Article |
| Waldmann2002IUC | Waldmann, Uwe | 2002 | | A New Input Technique for Accented Letters in Alphabetical Scripts
In: Proceedings of the 20th International Unicode Conference, C12 | Proceedings Article |
| Waldmann92a | Waldmann, Uwe | 1992 | | Semantics of Order-Sorted Specifications
In: Theoretical Computer Science [94], 1-35 | Journal Article |
| Wang97 | Wang, Yongge | 1997 | | Randomization and Approximation Techniques in Computer Science
In: Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 209-225 | Proceedings Article |
| WangIPL96a | Wang, Yongge | 1997 | | NP-hard sets are superterse unless NP is small
In: Information Processing Letters [61], 1-6 | Journal Article |
| WangTCS96 | Wang, Yongge | 1999 | | Randomness, Stochasticity, and Approximation
In: Theory of Computing Systems [32], 517-529 | Journal Article |
| WBH+02-CADE18 | Weidenbach, Christoph
Brahm, Uwe
Hillenbrand, Thomas
Keen, Enno
Theobalt, Christian
Topić, Dalibor | 2002 |  | SPASS Version 2.0
In: Automated deduction, CADE-18 : 18th International Conference on Automated Deduction, 275-279 | Proceedings Article |
| Weidenbach1999jar | Weidenbach, Christoph | 1999 | | SPASS V0.95TPTP
In: Journal of Automated Reasoning [23], 21-21 | Journal Article |
| Weidenbach2000habil | Weidenbach, Christoph | 2000 | | Entscheidbarkeitsprobleme für monadische (Horn)Klauselklassen
Universität des Saarlandes, Naturwissenschaftlich-Technische Fakultät | Thesis - Habilitation thesis |
| Weidenbach2001handbook | Weidenbach, Christoph | 2001 | | Combining Superposition, Sorts and Splitting
In: Handbook of Automated Reasoning, 1965-2013 | Part of a Book |
| Weidenbach92a | Weidenbach, Christoph | 1993 | | A New Sorted Logic
In: GWAI-92: Advances in Artificial Inteligence, Proceedings 16th German Workshop on Artificial Intelligence, 43-54 | Proceedings Article |
| Weidenbach93a | Weidenbach, Christoph | 1993 | | Extending the Resolution Method with Sorts
In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI '93), 60-65 | Proceedings Article |
| Weidenbach94a | Weidenbach, Christoph | 1994 | | First-Order Tableaux with Sorts
In: TABLEAUX-'94, 3rd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, 247-261 | Proceedings Article |
| Weidenbach94c | Weidenbach, Christoph | 1994 | | Sorts, Resolution, Tableaux and Propositional Logic
In: KI-94 Workshops: Extended Abstracts, 315-316 | Proceedings Article |
| Weidenbach95d | Weidenbach, Christoph | 1995 | | First-Order Tableaux with Sorts
In: Journal of the Interest Group in Pure and Applied Logics [3], 887-906 | Journal Article |
| Weidenbach95e | Barth, Peter
Kleine Büning, Hans
Weidenbach, Christoph | 1995 | | Workshop CPL Computational Propositional Logic
In: KI-95 Activities: Workshops, Posters, Demos, 71-72 | Proceedings Article |
| Weidenbach96a | Weidenbach, Christoph | 1996 | | Unification in Pseudo-Linear Sort Theories is Decidable
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 343-357 | Proceedings Article |
| Weidenbach96b | Weidenbach, Christoph
Gaede, Bernd
Rock, Georg | 1996 | | SPASS & FLOTTER, Version 0.42
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 141-145 | Proceedings Article |
| Weidenbach96c | Weidenbach, Christoph | 1996 | | Unification in Sort Theories
In: Proceedings of the 10th International Workshop on Unification, UNIF'96, 16-25 | Proceedings Article |
| Weidenbach96d | Weidenbach, Christoph | 1996 | | Sorted Unification and Its Application to Automated Theorem Proving
In: Proceedings of the CADE-13 Workshop: Term Schematizations and Their Applications, 67-76 | Proceedings Article |
| Weidenbach96e | Weidenbach, Christoph | 1996 | | Computational Aspects of a First-Order Logic with Sorts
Universität des Saarlandes | Thesis - PhD thesis |
| Weidenbach96f | Weidenbach, Christoph | 1996 | | Unification in Sort Theories and its Applications
In: Annals of Mathematics and Artificial Intelligence [18], 261-293 | Journal Article |
| Weidenbach97jar | Weidenbach, Christoph | 1997 | | SPASS Version 0.49
In: Journal of Automated Reasoning [18], 247-252 | Journal Article |
