Selected Publications

button  J. Siekmann, P. Szabo:  "A noetherian and confluent rewriting system for idempotent semigroups"
Semigroup Forum 25, 1982, 83-110.

button   R. Book, J. Siekmann:  "On Unification: Equational theories are not bounded"
Journal of Symbolic Computation 2, 1986, 317-324.

button   A. Herold, J. Siekmann:  "Unification in abelian semigroups"
Journal of Automated Reasoning 3 (3), 1987, 247-283.

button   J. Siekmann, P. Szabo:  "The undecidability of the DA-unification problem"
Journal of Symbolic Logic, 54 (2), 1989, 402-414.

button   J. Siekmann:  "Unification Theory"
Journal of Symbolic Computation 7, 1989, 207-274

button   F. Baader, H.-J. Bürckert, B. Hollunder, W. Nutt, and J.Siekmann,:  "Concept Logics"
In J.W. Lloyd (Ed.), Computational Logic, Symposium Proceedings, Brussels, November 1990, Springer-Verlag, 177-201.

button   C. Beierle, U. Hedtstück, U. Pletat, P. Schmitt, J. Siekmann:  " An Order sorted Logic for Knowledge Representation"
Journal of Artificial Intelligence, vol. 55, 1992

button   J. Siekmann, M. Kohlhase, E. Melis:  "OMEGA: Ein mathematisches Assistenzsystem"
Kognitionswissenschaft, vol 7, No. 3, p 101-105, 1998
English in: JFAK, Essays dedicated to J. von Benthem, Amsterdam, Univ. Press, 1999

button   E. Melis, J. Siekmann:  "Knowledge-based proof planning"
Journal of Artificial Intelligence, vol 115, p 65-105, 1999

button   K. Fischer, Ch Gerber, J. Siekmann, G. Vierke:  "Holonic Multi Agent Systems"
(to appear: JAI, Elsevier)

button   J. Siekmann, G. Wrightson:  "Strong Completeness of A. Kowalski's Connection Graph Proof Procedure"
Springer Lecture Notes on AI, vol 2408, pp 231, 2002