default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJürgen Avenhaus
Person information
- affiliation: Kaiserslautern University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1995
[b1]Jürgen Avenhaus:
Reduktionssysteme - Rechnen und Schliessen in gleichungsdefinierten Strukturen. Springer-Lehrbuch, Springer 1995, ISBN 978-3-540-58559-6, pp. I-VIII, 1-251
Journal Articles
- 2003
- [j15]Jürgen Avenhaus, Thomas Hillenbrand, Bernd Löchner:
On using ground joinable equations in equational theorem proving. J. Symb. Comput. 36(1-2): 217-233 (2003) - 2001
- [j14]Jürgen Avenhaus, David A. Plaisted:
General Algorithms for Permutations in Equational Inference. J. Autom. Reason. 26(3): 223-268 (2001) - 2000
- [j13]Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp:
Logicality of conditional rewrite systems. Theor. Comput. Sci. 236(1-2): 209-232 (2000) - 1999
- [j12]Jürgen Avenhaus, Klaus Becker:
A Framework for Operational Equational Specifications with Pre-defined Structures. J. Symb. Comput. 27(3): 271-310 (1999) - 1998
- [j11]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): 227-234 (1998) - 1996
- [j10]Jürgen Avenhaus, Klaus Madlener:
Theorembeweisen in hierarchischen bedingten Spezifikationen. Inform. Forsch. Entwickl. 11(2): 53-60 (1996) - 1986
- [j9]Jürgen Avenhaus:
On the Descriptive Power of Term Rewriting Systems. J. Symb. Comput. 2(2): 109-122 (1986) - 1984
- [j8]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): 47-52 (1984) - [j7]Jürgen Avenhaus, Klaus Madlener:
The Nielsen Reduction and P-Complete Problems in Free Groups. Theor. Comput. Sci. 32: 61-76 (1984) - [j6]Jürgen Avenhaus, Klaus Madlener:
On the Complexity of Intersection and Conjugacy Problems in Free Groups. Theor. Comput. Sci. 32: 279-295 (1984) - 1981
- [j5]Jürgen Avenhaus, Klaus Madlener:
An Algorithm for the Word Problem in HNN Extensions and the Dependence of Its Complexity on the Group Representation. RAIRO Theor. Informatics Appl. 15(4): 335-371 (1981) - 1978
- [j4]Jürgen Avenhaus, Klaus Madlener:
Subrekursive Komplexität bei Gruppen: II. Der Einbettungssatz von Higman für entscheidbare Gruppen. Acta Informatica 9: 183-193 (1978) - [j3]Jürgen Avenhaus, Klaus Madlener:
Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität. Arch. Math. Log. 19(1): 3-12 (1978) - 1977
- [j2]Jürgen Avenhaus, Klaus Madlener:
Subrekursive Komplexität bei Gruppen: I. Gruppen mit vorgeschriebener Komplexität. Acta Informatica 9: 87-104 (1977) - 1971
- [j1]Jürgen Avenhaus:
Ein Verfahren zur Einschließung der Lösung des Anfangswertproblems. Computing 8(1-2): 182-190 (1971)
Conference and Workshop Papers
- 2004
- [c23]Jürgen Avenhaus:
Efficient Algorithms for Computing Modulo Permutation Theories. IJCAR 2004: 415-429 - 2003
- [c22]Jürgen Avenhaus, Ulrich Kühler, Tobias Schmidt-Samoa, Claus-Peter Wirth:
How to Prove Inductive Theorems? QUODLIBET! CADE 2003: 328-333 - 2001
- [c21]Jürgen Avenhaus, Bernd Löchner:
CCE: Testing Ground Joinability. IJCAR 2001: 658-662 - [c20]Carsten Sinz, Jörg Denzinger, Jürgen Avenhaus, Wolfgang Küchlin:
Combining Parallel and Distributed Search in Automated Equational Deduction. PPAM 2001: 819-832 - 1997
- [c19]Jürgen Avenhaus, Klaus Madlener:
Theorem Proving in Hierarchical Causal Specifications. Advances in Algorithms, Languages, and Complexity 1997: 1-51 - [c18]Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp:
Logicality of Conditional Rewrite Systems. TAPSOFT 1997: 141-152 - 1995
- [c17]Jürgen Avenhaus, Jörg Denzinger, Matthias Fuchs:
DISCOUNT: A SYstem for Distributed Equational Deduction. RTA 1995: 397-402 - 1994
- [c16]Jürgen Avenhaus, Carlos Loría-Sáenz:
Higher Order Conditional Rewriting and Narrowing. CCL 1994: 269-284 - [c15]Jürgen Avenhaus, Carlos Loría-Sáenz:
On Conditional Rewrite Systems with Extra Variables and Deterministic Logic Programs. LPAR 1994: 215-229 - [c14]Jürgen Avenhaus, Klaus Becker:
Operational Specifications with Built-Ins. STACS 1994: 263-274 - 1993
- [c13]Jürgen Avenhaus, Jörg Denzinger:
Distributing Equational Theorem Proving. RTA 1993: 62-76 - 1991
- [c12]Jürgen Avenhaus:
Proving Equational and Inductive Theorems by Completion and Embedding Techniques. RTA 1991: 361-373 - 1989
- [c11]Jürgen Avenhaus, Dieter Wissmann:
Using Rewriting Techniques to Solve the Generalized Word Problem in Polycyclic Groups. ISSAC 1989: 322-337 - [c10]Jürgen Avenhaus, Jörg Denzinger
, Jürgen Müller:
THEOPOGLES - An efficient Theorem Prover based on Rewrite-Techniques. RTA 1989: 538-541 - [c9]Jürgen Avenhaus, Klaus Madlener, Joachim Steinbach:
COMTES - An Experimental Environment for the Completion of Term Rewriting Systems. RTA 1989: 542-546 - 1987
- [c8]Jürgen Avenhaus, Richard Göbel, Bernhard Gramlich, Klaus Madlener, Joachim Steinbach:
TRSPEC: A Term Rewriting Based System for Algebraic Specifications. CTRS 1987: 245-248 - 1986
- [c7]Jürgen Avenhaus, Benjamin Benninghofen, Rüdiger Göbel, Klaus Madlener:
TRSPEC: A Term Rewriting Based System for Algebraic Specifications. CADE 1986: 665-667 - 1985
- [c6]Norbert Heck, Jürgen Avenhaus:
On Logic Programs with Data-Driven Computations. European Conference on Computer Algebra (2) 1985: 433-443 - 1984
- [c5]Norbert Heck, Jürgen Avenhaus:
Automatic Implementation of Abstract Data Types Specified by the Logic Programming Language. FGCS 1984: 210-219 - 1982
- [c4]Jürgen Avenhaus, Klaus Madlener:
The Nielsen Reduction as Key Problem to Polynomial Algorithms in Free Groups. EUROCAM 1982: 49-56 - 1981
- [c3]Jürgen Avenhaus, Klaus Madlener:
How to Compute Generators for the Intersection of Subgroups in Free Groups. CAAP 1981: 88-100 - [c2]Jürgen Avenhaus, Klaus Madlener:
P-Complete Problems in Free Groups. Theoretical Computer Science 1981: 42-51 - 1975
- [c1]Jürgen Avenhaus, Klaus Madlener:
En\En-1-entscheidbare Gruppen. Automata Theory and Formal Languages 1975: 42-51
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 01:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
