Jürgen Avenhaus

39 papers A 5B 2Misc 1Journal 15Unranked 15

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