Jürgen Avenhaus

Publication Activity (10 Years)

Years Active: 1971-2004
Publications (10 Years): 0

Publications

Jürgen Avenhaus
Efficient Algorithms for Computing Modulo Permutation Theories. IJCAR (2004)
Jürgen Avenhaus, Thomas Hillenbrand, Bernd Löchner
On using ground joinable equations in equational theorem proving. J. Symb. Comput. 36 (1-2) (2003)
Jürgen Avenhaus, Ulrich Kühler, Tobias Schmidt-Samoa, Claus-Peter Wirth
How to Prove Inductive Theorems? QUODLIBET! CADE (2003)
Jürgen Avenhaus, Bernd Löchner
CCE: Testing Ground Joinability. IJCAR (2001)
Jürgen Avenhaus, David A. Plaisted
General Algorithms for Permutations in Equational Inference. J. Autom. Reason. 26 (3) (2001)
Carsten Sinz, Jörg Denzinger, Jürgen Avenhaus, Wolfgang Küchlin
Combining Parallel and Distributed Search in Automated Equational Deduction. PPAM (2001)
Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp
Logicality of conditional rewrite systems. Theor. Comput. Sci. 236 (1-2) (2000)
Jürgen Avenhaus, Klaus Becker
A Framework for Operational Equational Specifications with Pre-defined Structures. J. Symb. Comput. 27 (3) (1999)
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. 13 (4) (1998)
Jürgen Avenhaus, Klaus Madlener
Theorem Proving in Hierarchical Causal Specifications. Advances in Algorithms, Languages, and Complexity (1997)
Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp
Logicality of Conditional Rewrite Systems. TAPSOFT (1997)
Jürgen Avenhaus, Klaus Madlener
Theorembeweisen in hierarchischen bedingten Spezifikationen. Inform. Forsch. Entwickl. 11 (2) (1996)
Jürgen Avenhaus, Jörg Denzinger, Matthias Fuchs
DISCOUNT: A SYstem for Distributed Equational Deduction. RTA (1995)
Jürgen Avenhaus, Carlos Loría-Sáenz
Higher Order Conditional Rewriting and Narrowing. CCL (1994)
Jürgen Avenhaus, Carlos Loría-Sáenz
On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs. LPAR (1994)
Jürgen Avenhaus, Klaus Becker
Operational Specifications with Built-Ins. STACS (1994)
Jürgen Avenhaus, Jörg Denzinger
Distributing Equational Theorem Proving. RTA (1993)
Jürgen Avenhaus
Proving Equational and Inductive Theorems by Completion and Embedding Techniques. RTA (1991)
Jürgen Avenhaus, Klaus Madlener, Joachim Steinbach
COMTES - An Experimental Environment for the Completion of Term Rewriting Systems. RTA (1989)
Jürgen Avenhaus, Dieter Wissmann
Using Rewriting Techniques to Solve the Generalized Word Problem in Polycyclic Groups. ISSAC (1989)
Jürgen Avenhaus, Jörg Denzinger, Jürgen Müller
THEOPOGLES - An efficient Theorem Prover based on Rewrite-Techniques. RTA (1989)
Jürgen Avenhaus, Richard Göbel, Bernhard Gramlich, Klaus Madlener, Joachim Steinbach
TRSPEC: A Term Rewriting Based System for Algebraic Specifications. CTRS (1987)
Jürgen Avenhaus
On the Descriptive Power of Term Rewriting Systems. J. Symb. Comput. 2 (2) (1986)
Jürgen Avenhaus, Benjamin Benninghofen, Rüdiger Göbel, Klaus Madlener
TRSPEC: A Term Rewriting Based System for Algebraic Specifications. CADE (1986)
Norbert Heck, Jürgen Avenhaus
On Logic Programs with Data-Driven Computations. European Conference on Computer Algebra (2) (1985)
Jürgen Avenhaus, Klaus Madlener
On the Complexity of Intersection and Conjugacy Problems in Free Groups. Theor. Comput. Sci. 32 (1984)
Norbert Heck, Jürgen Avenhaus
Automatic Implementation of Abstract Data Types Specified by the Logic Programming Language. FGCS (1984)
Jürgen Avenhaus, Klaus Madlener
The Nielsen Reduction and P-Complete Problems in Free Groups. Theor. Comput. Sci. 32 (1984)
Jürgen Avenhaus, Ronald V. Book, Craig C. Squier
On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids. RAIRO Theor. Informatics Appl. 18 (1) (1984)
Jürgen Avenhaus, Klaus Madlener
The Nielsen Reduction as Key Problem to Polynomial Algorithms in Free Groups. EUROCAM (1982)
Jürgen Avenhaus, Klaus Madlener
How to Compute Generators for the Intersection of Subgroups in Free Groups. CAAP (1981)
Jürgen Avenhaus, Klaus Madlener
P-Complete Problems in Free Groups. Theoretical Computer Science (1981)
Jürgen Avenhaus, Klaus Madlener
Extensions and the Dependence of Its Complexity on the Group Representation. RAIRO Theor. Informatics Appl. 15 (4) (1981)
Jürgen Avenhaus, Klaus Madlener
Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität. Arch. Math. Log. 19 (1) (1978)
Jürgen Avenhaus, Klaus Madlener
Subrekursive Komplexität bei Gruppen: II. Der Einbettungssatz von Higman für entscheidbare Gruppen. Acta Informatica 9 (1978)
Jürgen Avenhaus, Klaus Madlener
Subrekursive Komplexität bei Gruppen: I. Gruppen mit vorgeschriebener Komplexität. Acta Informatica 9 (1977)
Jürgen Avenhaus, Klaus Madlener
-entscheidbare Gruppen. Automata Theory and Formal Languages (1975)
Jürgen Avenhaus
Ein Verfahren zur Einschließung der Lösung des Anfangswertproblems. Computing 8 (1-2) (1971)