Your search returned the following 22 documents:

22. Automatic Verification of Hybrid Systems with Large Discrete State Space
    Werner Damm, Stefan Disch, Hardi Hungar, Jun Pang, Florian Pigorsch, Christoph Scholl, Uwe Waldmann, and Boris Wirtz
    In: Automated Technology for Verification and Analysis, 4th International Symposium, ATVA 2006, Beijing, China, 2006, 276-291
    
21. Modular Proof Systems for Partial Functions with Evans Equality
    Harald Ganzinger, Viorica Sofronie-Stokkermans, and Uwe Waldmann
    Information and Computation 204 (10): 1453-1492, 2006
    
20. SPASS+T
    Virgile Prevosto and Uwe Waldmann
    In: ESCoR: FLoC'06 Workshop on Empirically Successful Computerized Reasoning, Seattle, WA, USA, 2006, 18-33
    
19. Comparing Instance Generation Methods for Automated Reasoning
    Swen Jacobs and Uwe Waldmann
    In: Automated reasoning with analytic tableaux and related methods : International Conference, TABLEAUX 2005, Koblenz, Germany, 2005, 153-168
    [PDF: Download: InstGen-final.pdf]
    
18. Modular Proof Systems for Partial Functions with Weak Equality
    Harald Ganzinger, Viorica Sofronie-Stokkermans, and Uwe Waldmann
    In: Automated reasoning : Second International Joint Conference, IJCAR 2004, Cork, Ireland, 2004, 168-182
    
17. Superposition modulo a Shostak Theory
    Harald Ganzinger, Thomas Hillenbrand, and Uwe Waldmann
    In: Automated Deduction, CADE-19 : 19th International Conference on Automated Deduction, Miami, Florida, July, 30 - August, 2, 2003, 182-196
    [PS: Download: _03CADE.2.ps]
    
16. A New Input Technique for Accented Letters in Alphabetical Scripts
    Uwe Waldmann
    In: Proceedings of the 20th International Unicode Conference, Washington, DC, USA, 2002, C12 p., paper no. C12.
    
15. Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II)
    Uwe Waldmann
    Journal of Symbolic Computation 33 (6): 831-861, 2002
    
14. Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I)
    Uwe Waldmann
    Journal of Symbolic Computation 33 (6): 777-829, 2002
    
13. Superposition and Chaining for Totally Ordered Divisible Abelian Groups (Extended Abstract)
    Uwe Waldmann
    In: Automated reasoning : First International Joint Conference, IJCAR 2001, Siena, Italy, June, 18-22, 2001, 226-241
    
12. Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups
    Uwe Waldmann
    In: Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning (LPAR-99), Tbilisi, Georgia, September 6-10, 1999, 131-147. Note: %Earlier version: Technical Report MPI-I-1999-2-003, Max-Planck-Institut für Informatik, Saarbrücken
    
11. Extending reduction orderings to ACU-compatible reduction orderings
    Uwe Waldmann
    Information Processing Letters 67 (1): 43-49, 1998
    
10. Superposition for Divisible Torsion-Free Abelian Groups
    Uwe Waldmann
    In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), Lindau, Germany, July, 5 - 10 1998, 1998, 144-159
    
9. A Superposition Calculus for Divisible Torsion-Free Abelian Groups
   Uwe Waldmann
   In: Proceedings of the International Workshop on First-Order Theorem Proving (FTP-97), Linz, Austria, October 27-28, 1997, 130-134
   
8. Cancellative Abelian Monoids in Refutational Theorem Proving
   Uwe Waldmann
   Doctoral dissertation, Universität des Saarlandes, 1997
   
7. Theorem Proving in Cancellative Abelian Monoids (Extended Abstract)
   Harald Ganzinger and Uwe Waldmann
   In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), New Brunswick, USA, July, 30 - August, 3, 1996, 388-402. Note: Full version: Technical Report MPI-I-96-2-001, Max-Planck-Institut für Informatik, Saarbrücken, Germany, January 1996.
   
6. Refutational Theorem Proving for Hierarchic First-Order Theories
   Leo Bachmair, Harald Ganzinger, and Uwe Waldmann
   Applicable Algebra in Engineering, Communication and Computing (AAECC) 5 (3/4): 193-212, 1994. Note: Earlier Version: Theorem Proving for Hierarchic First-Order Theories, in Giorgio Levi and H{\'e}l{\`e}ne Kirchner, editors, {\em Algebraic and Logic Programming, Third International Conference}, LNCS 632, pages 420--434, Volterra, Italy, September 2--4, 1992, Springer-Verlag
   
5. Set Constraints are the Monadic Class
   Leo Bachmair, Harald Ganzinger, and Uwe Waldmann
   In: Eighth Annual IEEE Symposium on Logic in Computer Science, Montreal, Canada, June 19-23, 1993, 1993, 75-83
   
4. Superposition with simplification as a decision procedure for the monadic class with equality
   Leo Bachmair, Harald Ganzinger, and Uwe Waldmann
   In: Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993, 1993, 83-96. Note: Revised version of Technical Report MPI-I-93-204
   
3. Semantics of Order-Sorted Specifications
   Uwe Waldmann
   Theoretical Computer Science 94 (1): 1-35, 1992
   
2. Termination Proofs of Well-Moded Logic Programs Via Conditional Rewrite Systems
   Harald Ganzinger and Uwe Waldmann
   In: Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems '92, 1992, 430-437
   
1. Theorem proving for hierarchic first-order theories
   Leo Bachmair, Harald Ganzinger, and Uwe Waldmann
   In: Algebraic and Logic Programming, 1992, 420-434. Note: Revised version in AAECC, vol.\ 5, number 3/4, pp.\ 193--212, 1994)