Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Jürgen
    Last name: Avenhaus
    DBLP: a/JurgenAvenhaus
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 36 of 36  
    Select a publication
    Show Title Venue Rating Date
    Conference paper
    Jürgen Avenhaus.
    Efficient Algorithms for Computing Modulo Permutation Theories.
    Automated Reasoning - Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004, Proceedings 2004 (0) 2004
    Conference paper
    Jürgen Avenhaus, Ulrich Kühler, Tobias Schmidt-Samoa, Claus-Peter Wirth.
    How to Prove Inductive Theorems? QUODLIBET!
    Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Jürgen Avenhaus, Thomas Hillenbrand, Bernd Löchner.
    On using ground joinable equations in equational theorem proving.
    J. Symb. Comput. 2003, Volume 36 (0) 2003
    Conference paper
    Jürgen Avenhaus, Bernd Löchner.
    CCE: Testing Ground Joinability.
    Automated Reasoning, First International Joint Conference, IJCAR 2001, Siena, Italy, June 18-23, 2001, Proceedings 2001 (0) 2001
    Conference paper
    Carsten Sinz, Jörg Denzinger, Jürgen Avenhaus, Wolfgang Küchlin.
    Combining Parallel and Distributed Search in Automated Equational Deduction.
    Parallel Processing and Applied Mathematics, 4th International Conference, PPAM 2001 Naleczow, Poland, September 9-12, 2001, Revised Papers 2002 (0) 2001
    Conference paper
    Jürgen Avenhaus, David A. Plaisted.
    General Algorithms for Permutations in Equational Inference.
    J. Autom. Reasoning 2001, Volume 26 (0) 2001
    Conference paper
    Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp.
    Logicality of conditional rewrite systems.
    Theor. Comput. Sci. 2000, Volume 236 (0) 2000
    Conference paper
    Jürgen Avenhaus, Klaus Becker.
    A Framework for Operational Equational Specifications with Pre-defined Structures.
    J. Symb. Comput. 1999, Volume 27 (0) 1999
    Conference paper
    Jürgen Avenhaus, Reinhard Gotzhein, Theo Härder, Lothar Litz, Klaus Madlener, Jürgen Nehmer, Michael M. Richter, Norbert Ritter, H. Dieter Rombach, Bernd Schürmann, Gerhard Zimmermann.
    Entwicklung großer Systeme mit generischen Methoden - Eine Übersicht über den Sonderforschungsbereich 501.
    Inform., Forsch. Entwickl. 1998, Volume 13 (0) 1998
    Conference paper
    Jürgen Avenhaus, Klaus Madlener.
    Theorem Proving in Hierarchical Causal Specifications.
    Advances in Algorithms, Languages, and Complexity 1997 (0) 1997
    Conference paper
    Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp.
    Logicality of Conditional Rewrite Systems.
    TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings 1997 (0) 1997
    Conference paper
    Jürgen Avenhaus, Klaus Madlener.
    Theorembeweisen in hierarchischen bedingten Spezifikationen.
    Inform., Forsch. Entwickl. 1996, Volume 11 (0) 1996
    Conference paper
    Jürgen Avenhaus, Jörg Denzinger, Matthias Fuchs.
    DISCOUNT: A SYstem for Distributed Equational Deduction.
    Rewriting Techniques and Applications, 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, Proceedings 1995 (0) 1995
    Conference paper
    Jürgen Avenhaus, Carlos Loría-Sáenz.
    Higher Order Conditional Rewriting and Narrowing.
    Constraints in Computational Logics, First International Conference, CCL'94, Munich, Germant, September 7-9, 1994 1994 (0) 1994
    Conference paper
    Jürgen Avenhaus, Carlos Loría-Sáenz.
    On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs.
    Logic Programming and Automated Reasoning, 5th International Conference, LPAR'94, Kiev, Ukraine, July 16-22, 1994, Proceedings 1994 (0) 1994
    Conference paper
    Jürgen Avenhaus, Klaus Becker.
    Operational Specifications with Built-Ins.
    STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings 1994 (0) 1994
    Conference paper
    Jürgen Avenhaus, Jörg Denzinger.
    Distributing Equational Theorem Proving.
    Rewriting Techniques and Applications, 5th International Conference, RTA-93, Montreal, Canada, June 16-18, 1993, Proceedings 1993 (0) 1993
    Conference paper
    Jürgen Avenhaus.
    Proving Equational and Inductive Theorems by Completion and Embedding Techniques.
    Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings 1991 (0) 1991
    Conference paper
    Jürgen Avenhaus, Dieter Wissmann.
    Using Rewriting Techniques to Solve the Generalized Word Problem in Polycyclic Groups.
    ISSAC 1989 (0) 1989
    Conference paper
    Jürgen Avenhaus, Jörg Denzinger, Jürgen Müller.
    THEOPOGLES - An efficient Theorem Prover based on Rewrite-Techniques.
    Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings 1989 (0) 1989
    Conference paper
    Jürgen Avenhaus, Klaus Madlener, Joachim Steinbach.
    COMTES - An Experimental Environment for the Completion of Term Rewriting Systems.
    Rewriting Techniques and Applications, 3rd International Conference, RTA-89, Chapel Hill, North Carolina, USA, April 3-5, 1989, Proceedings 1989 (0) 1989
    Conference paper
    Jürgen Avenhaus, Richard Göbel, Bernhard Gramlich, Klaus Madlener, Joachim Steinbach.
    TRSPEC: A Term Rewriting Based System for Algebraic Specifications.
    Conditional Term Rewriting Systems, 1st International Workshop, Orsay, France, July 8-10, 1987, Proceedings 1988 (0) 1987
    Conference paper
    Jürgen Avenhaus, Benjamin Benninghofen, Rüdiger Göbel, Klaus Madlener.
    TRSPEC: A Term Rewriting Based System for Algebraic Specifications.
    8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings 1986 (0) 1986
    Conference paper
    Jürgen Avenhaus.
    On the Descriptive Power of Term Rewriting Systems.
    J. Symb. Comput. 1986, Volume 2 (0) 1986
    Conference paper
    Norbert Heck, Jürgen Avenhaus.
    On Logic Programs with Data-Driven Computations.
    EUROCAL '85, European Conference on Computer Algebra, Linz, Austria, April 1-3, 1985, Proceedings Volume 2: Research Contributions 1985 (0) 1985
    Conference paper
    Norbert Heck, Jürgen Avenhaus.
    Automatic Implementation of Abstract Data Types Specified by the Logic Programming Language.
    FGCS 1984 (0) 1984
    Conference paper
    Jürgen Avenhaus, Ronald V. Book, Craig C. Squier.
    On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids.
    ITA 1984, Volume 18 (0) 1984
    Conference paper
    Jürgen Avenhaus, Klaus Madlener.
    The Nielsen Reduction and P-Complete Problems in Free Groups.
    Theor. Comput. Sci. 1984, Volume 32 (0) 1984
    Conference paper
    Jürgen Avenhaus, Klaus Madlener.
    On the Complexity of Intersection and Conjugacy Problems in Free Groups.
    Theor. Comput. Sci. 1984, Volume 32 (0) 1984
    Conference paper
    Jürgen Avenhaus, Klaus Madlener.
    The Nielsen Reduction as Key Problem to Polynomial Algorithms in Free Groups.
    Computer Algebra, EUROCAM '82, European Computer Algebra Conference, Marseille, France, 5-7 April, 1982, Proceedings 1982 (0) 1982
    Conference paper
    Jürgen Avenhaus, Klaus Madlener.
    How to Compute Generators for the Intersection of Subgroups in Free Groups.
    CAAP '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings 1981 (0) 1981
    Conference paper
    Jürgen Avenhaus, Klaus Madlener.
    P-Complete Problems in Free Groups.
    Theoretical Computer Science, 5th GI-Conference, Karlsruhe, Germany, March 23-25, 1981, Proceedings 1981 (0) 1981
    Conference paper
    Jürgen Avenhaus, Klaus Madlener.
    An Algorithm for the Word Problem in
    ITA 1981, Volume 15 (0) 1981
    Conference paper
    Jürgen Avenhaus, Klaus Madlener.
    Subrekursive Komplexität bei Gruppen: II. Der Einbettungssatz von Higman für entscheidbare Gruppen.
    Acta Inf. 1977, Volume 9 (0) 1978
    Conference paper
    Jürgen Avenhaus, Klaus Madlener.
    Subrekursive Komplexität bei Gruppen: I. Gruppen mit vorgeschriebener Komplexität.
    Acta Inf. 1977, Volume 9 (0) 1977
    Conference paper
    Jürgen Avenhaus, Klaus Madlener.
    E
    Automata Theory and Formal Languages, 2nd GI Conference, Kaiserslautern, May 20-23, 1975 1975 (0) 1975
    Show item 1 to 36 of 36  

    Your query returned 36 matches in the database.