Jürgen Avenhaus

According to our database1, Jürgen Avenhaus
  • authored at least 39 papers between 1971 and 2004.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2004
Efficient Algorithms for Computing Modulo Permutation Theories.
Proceedings of the Automated Reasoning - Second International Joint Conference, 2004

2003
On using ground joinable equations in equational theorem proving.
J. Symb. Comput., 2003

How to Prove Inductive Theorems? QUODLIBET!
Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2001
General Algorithms for Permutations in Equational Inference.
J. Autom. Reasoning, 2001

Combining Parallel and Distributed Search in Automated Equational Deduction.
Proceedings of the Parallel Processing and Applied Mathematics, 2001

CCE: Testing Ground Joinability.
Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000
Logicality of conditional rewrite systems.
Theor. Comput. Sci., 2000

1999
A Framework for Operational Equational Specifications with Pre-defined Structures.
J. Symb. Comput., 1999

1998
Entwicklung großer Systeme mit generischen Methoden - Eine Übersicht über den Sonderforschungsbereich 501.
Inform., Forsch. Entwickl., 1998

1997
Logicality of Conditional Rewrite Systems.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Theorem Proving in Hierarchical Causal Specifications.
Proceedings of the Advances in Algorithms, Languages, and Complexity, 1997

1996
Theorembeweisen in hierarchischen bedingten Spezifikationen.
Inform., Forsch. Entwickl., 1996

1995
DISCOUNT: A SYstem for Distributed Equational Deduction.
Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

Reduktionssysteme - Rechnen und Schliessen in gleichungsdefinierten Strukturen.
Springer-Lehrbuch, Springer, ISBN: 978-3-540-58559-6, 1995

1994
Operational Specifications with Built-Ins.
Proceedings of the STACS 94, 1994

On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs.
Proceedings of the Logic Programming and Automated Reasoning, 5th International Conference, 1994

Higher Order Conditional Rewriting and Narrowing.
Proceedings of the Constraints in Computational Logics, First International Conference, 1994

1993
Distributing Equational Theorem Proving.
Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

1991
Proving Equational and Inductive Theorems by Completion and Embedding Techniques.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1989
COMTES - An Experimental Environment for the Completion of Term Rewriting Systems.
Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

THEOPOGLES - An efficient Theorem Prover based on Rewrite-Techniques.
Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

Using Rewriting Techniques to Solve the Generalized Word Problem in Polycyclic Groups.
Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

1987
TRSPEC: A Term Rewriting Based System for Algebraic Specifications.
Proceedings of the Conditional Term Rewriting Systems, 1987

1986
On the Descriptive Power of Term Rewriting Systems.
J. Symb. Comput., 1986

TRSPEC: A Term Rewriting Based System for Algebraic Specifications.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

1985
On Logic Programs with Data-Driven Computations.
Proceedings of the EUROCAL '85, 1985

1984
On the Complexity of Intersection and Conjugacy Problems in Free Groups.
Theor. Comput. Sci., 1984

The Nielsen Reduction and P-Complete Problems in Free Groups.
Theor. Comput. Sci., 1984

On Expressing Commutativity by Finite Church-Rosser Presentations: A Note on Commutative Monoids.
ITA, 1984

Automatic Implementation of Abstract Data Types Specified by the Logic Programming Language.
FGCS, 1984

1982
The Nielsen Reduction as Key Problem to Polynomial Algorithms in Free Groups.
Proceedings of the Computer Algebra, 1982

1981
An Algorithm for the Word Problem in HNN Extensions and the Dependence of Its Complexity on the Group Representation.
ITA, 1981

P-Complete Problems in Free Groups.
Proceedings of the Theoretical Computer Science, 1981

How to Compute Generators for the Intersection of Subgroups in Free Groups.
Proceedings of the CAAP '81, 1981

1978
Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität.
Arch. Math. Log., 1978

Subrekursive Komplexität bei Gruppen: II. Der Einbettungssatz von Higman für entscheidbare Gruppen.
Acta Inf., 1978

1977
Subrekursive Komplexität bei Gruppen: I. Gruppen mit vorgeschriebener Komplexität.
Acta Inf., 1977

1975
En\En-1-entscheidbare Gruppen.
Proceedings of the Automata Theory and Formal Languages, 1975

1971
Ein Verfahren zur Einschließung der Lösung des Anfangswertproblems.
Computing, 1971


  Loading...