| Author/Editor [Non Institute] | Year | | Title | Type |
|---|
Wagner, Podelski
(Ed: Raskin, Thiagarajan)
[-] | 2007 | | Region Stability Proofs for Hybrid Systems
In: Formal Modelling and Analysis of Timed Systems: 5th International Conference, FORMATS 2007, 16 | Proceedings Article |
Waldmann
(Ed: Bonacina, Furbach)
[Bonacina, Furbach] | 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 |
Waldmann
(Ed: Ganzinger, McAllester, Voronkov)
[McAllester, Voronkov] | 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 |
Waldmann
(Ed: Goré, Leitsch, Nipkow)
[Goré, Leitsch, Nipkow] | 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 |
Waldmann
(Ed: Kirchner, Kirchner)
[Kirchner, Kirchner] | 1998 | | Superposition for Divisible Torsion-Free Abelian Groups
In: Proceedings of the 15th International Conference on Automated Deduction (CADE-98), 144-159 | Proceedings Article |
Waldmann
[-] | 2002 | | A New Input Technique for Accented Letters in Alphabetical Scripts
In: Proceedings of the 20th International Unicode Conference, C12 | Proceedings Article |
Waldmann
[-] | 2002 | | Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II)
In: Journal of Symbolic Computation [33], 831-861 | Journal Article |
Waldmann
[-] | 2002 | | Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I)
In: Journal of Symbolic Computation [33], 777-829 | Journal Article |
Waldmann
[-] | 1998 | | Extending reduction orderings to ACU-compatible reduction orderings
In: Information Processing Letters [67], 43-49 | Journal Article |
Waldmann
[-] | 1997 | | Cancellative Abelian Monoids in Refutational Theorem Proving
Universität des Saarlandes | Thesis - PhD thesis |
Waldmann
[-] | 1992 | | Semantics of Order-Sorted Specifications
In: Theoretical Computer Science [94], 1-35 | Journal Article |
Wang
(Ed: Rolim)
[-] | 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 |
Wang
[-] | 1999 | | Randomness, Stochasticity, and Approximation
In: Theory of Computing Systems [32], 517-529 | Journal Article |
Wang
[-] | 1997 | | NP-hard sets are superterse unless NP is small
In: Information Processing Letters [61], 1-6 | Journal Article |
Weidenbach
(Ed: Bajcsy)
[-] | 1993 | | Extending the Resolution Method with Sorts
In: Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI '93), 60-65 | Proceedings Article |
Weidenbach
(Ed: Bibel, Schmitt)
[Bibel, Schmitt] | 1998 | | Sorted Unification and Tree Automata
In: Automated Deduction - A Basis for Applications, 291-320 | Part of a Book |
Weidenbach
(Ed: Broda, D'Agostino, )
[-] | 1994 | | First-Order Tableaux with Sorts
In: TABLEAUX-'94, 3rd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, 247-261 | Proceedings Article |
Weidenbach
(Ed: Fiedler, Gorny, Grass, Hölldobler, Hotz, Kerner, Reischuk)
[Fiedler, Gorny, Grass, Hoelldobler, Hotz, Kerner, Reischuk] | 1998 | | Rechnen in sortierter Prädikatenlogik
In: Ausgezeichnete Informatikdissertationen 1997, 183-197 | Part of a Book |
Weidenbach
(Ed: Ganzinger)
[-] | 1999 | | Towards an Automatic Analysis of Security Protocols in First-Order Logic
In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), 378-382 | Proceedings Article |
Weidenbach
(Ed: Hermann, Salzer)
[Hermann, Salzer] | 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 |
Weidenbach
(Ed: Kunze, Stoyan)
[-] | 1994 | | Sorts, Resolution, Tableaux and Propositional Logic
In: KI-94 Workshops: Extended Abstracts, 315-316 | Proceedings Article |
Weidenbach
(Ed: McRobbie, Slaney)
[McRobbie, Slaney] | 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 |
Weidenbach
(Ed: Ohlbach)
[-] | 1993 | | A New Sorted Logic
In: GWAI-92: Advances in Artificial Inteligence, Proceedings 16th German Workshop on Artificial Intelligence, 43-54 | Proceedings Article |
Weidenbach
(Ed: Robinson, Voronkov)
[Robinson, Voronkov] | 2001 | | Combining Superposition, Sorts and Splitting
In: Handbook of Automated Reasoning, 1965-2013 | Part of a Book |
Weidenbach
(Ed: Schulz, Kepser)
[Schulz, Kepser] | 1996 | | Unification in Sort Theories
In: Proceedings of the 10th International Workshop on Unification, UNIF'96, 16-25 | Proceedings Article |
Weidenbach
[-] | 2000 | | Entscheidbarkeitsprobleme für monadische (Horn)Klauselklassen
Universität des Saarlandes, Naturwissenschaftlich-Technische Fakultät | Thesis - Habilitation thesis |
Weidenbach
[-] | 1999 | | SPASS V0.95TPTP
In: Journal of Automated Reasoning [23], 21-21 | Journal Article |
Weidenbach
[-] | 1997 | | SPASS Version 0.49
In: Journal of Automated Reasoning [18], 247-252 | Journal Article |
Weidenbach
[-] | 1996 | | Computational Aspects of a First-Order Logic with Sorts
Universität des Saarlandes | Thesis - PhD thesis |
Weidenbach
[-] | 1996 | | Unification in Sort Theories and its Applications
In: Annals of Mathematics and Artificial Intelligence [18], 261-293 | Journal Article |
