| # |  | Year | Author(s) [non member] | | Title | Type | |
|---|
| 1 |
 | Wachsmuth, Ipke (ed.) |
| |
| 1 |
| |
| 6 |
| Wagner, Silke |
| |
| 22 |
| |
| | 2006 | [Damm, Werner]
[Disch, Stefan]
[Hungar, Hardi]
[Pang, Jun]
[Pigorsch, Florian]
[Scholl, Christoph]
Waldmann, Uwe
[Wirtz, Boris] | | Automatic Verification of Hybrid Systems with Large Discrete State Space
In: Automated Technology for Verification and Analysis, 4th International Symposium, ATVA 2006, 276-291 | Proceedings Article | |
| | 2006 | Ganzinger, Harald
Sofronie-Stokkermans, Viorica
Waldmann, Uwe | | Modular Proof Systems for Partial Functions with Evans Equality
In: Information and Computation [204], 1453-1492 | Journal Article | |
| | 2006 | [Prevosto, Virgile]
Waldmann, Uwe | | SPASS+T
In: ESCoR: FLoC'06 Workshop on Empirically Successful Computerized Reasoning, 18-33 | Proceedings Article | |
| | 2005 | Jacobs, Swen
Waldmann, Uwe |  | Comparing Instance Generation Methods for Automated Reasoning
In: Automated reasoning with analytic tableaux and related methods : International Conference, TABLEAUX 2005, 153-168 | Proceedings Article | |
| | 2004 | Ganzinger, Harald
Sofronie-Stokkermans, Viorica
Waldmann, Uwe | | Modular Proof Systems for Partial Functions with Weak Equality
In: Automated reasoning : Second International Joint Conference, IJCAR 2004, 168-182 | Proceedings Article | |
| | 2003 | Ganzinger, Harald
Hillenbrand, Thomas
Waldmann, Uwe | | Superposition modulo a Shostak Theory
In: Automated Deduction, CADE-19 : 19th International Conference on Automated Deduction, 182-196 | Proceedings Article | |
| | 2002 | Waldmann, Uwe | | A New Input Technique for Accented Letters in Alphabetical Scripts
In: Proceedings of the 20th International Unicode Conference, C12 | Proceedings Article | |
| | 2002 | Waldmann, Uwe | | Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II)
In: Journal of Symbolic Computation [33], 831-861 | Journal Article | |
| | 2002 | Waldmann, Uwe | | Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I)
In: Journal of Symbolic Computation [33], 777-829 | Journal Article | |
| | 2001 | Waldmann, Uwe | | Superposition and Chaining for Totally Ordered Divisible Abelian Groups (Extended Abstract)
In: Automated reasoning : First International Joint Conference, IJCAR 2001, 226-241 | Proceedings Article | |
| | 1999 | Waldmann, Uwe | | 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 | |
| | 1998 | Waldmann, Uwe | | Extending reduction orderings to ACU-compatible reduction orderings
In: Information Processing Letters [67], 43-49 | Journal Article | |
| | 1998 | Waldmann, Uwe | | Superposition for Divisible Torsion-Free Abelian Groups
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 144-159 | Proceedings Article | |
| | 1997 | Waldmann, Uwe | | 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 | |
| | 1997 | Waldmann, Uwe | | Cancellative Abelian Monoids in Refutational Theorem Proving
Universität des Saarlandes | Thesis - PhD thesis | |
| | 1996 | Ganzinger, Harald
Waldmann, Uwe | | Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 388-402 | Proceedings Article | |
| | 1994 | Bachmair, Leo
Ganzinger, Harald
Waldmann, Uwe | | Refutational Theorem Proving for Hierarchic First-Order Theories
In: Applicable Algebra in Engineering, Communication and Computing (AAECC) [5], 193-212 | Journal Article | |
| | 1993 | [Bachmair, Leo]
Ganzinger, Harald
Waldmann, Uwe | | Set Constraints are the Monadic Class
In: Eighth Annual IEEE Symposium on Logic in Computer Science, 75-83 | Proceedings Article | |
| | 1993 | [Bachmair, Leo]
Ganzinger, Harald
Waldmann, Uwe | | Superposition with simplification as a decision procedure for the monadic class with equality
In: Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, 83-96 | Proceedings Article | |
| | 1992 | Waldmann, Uwe | | Semantics of Order-Sorted Specifications
In: Theoretical Computer Science [94], 1-35 | Journal Article | |
| | 1992 | Ganzinger, Harald
Waldmann, Uwe | | 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 | |
| | 1992 | Bachmair, Leo
Ganzinger, Harald
Waldmann, Uwe | | Theorem proving for hierarchic first-order theories
In: Algebraic and Logic Programming, 420-434 | Proceedings Article | |
| 1 |
| Wallin, Annika (ed.) |
| |
| 6 |
| |
| 1 |
| Walukiewicz, Igor |
| |
| 1 |
| |
