Jörg Siekmann

Selected Publications


C. P. Wirth, J.Siekmann, V.Peckhaus, M. Gabbay, D. Gabbay: “David Hilbert, Paul Bernays: Grundlagen Mathematik I”, Foundations of Mathematics I, bilingual 8-volume edition, 2016; subsequent volumes to appear. grundlagen-mathe-1
P. Szabo, J. Siekmann, M.Hoche: “What is essential Unification?” in: “Martin Davis on Computability, Computational Logic, and Mathematical Foundations”, Alberto Policri, Springer Verlag, 2016 martin-davis
J. Siekmann: “Computational Logic” erschienen in: D.Gabbay, J.Siekmann,J.Woods (eds) “Handbook on the History of Logic”, vol 9, North Holland, Elsevier, 2014. computational-logic
S. Autexier, Chr. Benzmüller, D. Dietrich, J. Siekmann: OMEGA in: „Resource Adaptive Cognitive Processes“ , Springer Cognitive Technologies, Springer Verlag, 2010 978-3-540-89407-0_crocker_CoverRawData.indd
E. Melis, A. Meier, J. Siekmann:Proof Planning with mutiple Strategies” Journal of Artificial Intelligence, vol 172, pp656-658, 2007
E. Melis, J. Siekmann: “E-Learning Mathematics: What we have and what we still need” in: Volume in honour of Dov Gabbay, Elsevier, 2005

der Band hiess: “We will show them”, zwei Bände

E. Melis, J. Siekmann: ActiveMath: An Intelligent Tutoring System for Mathematics: Int. Conf. on AI and Soft Computing, LNAI vol. 3070, 2004
J. Siekmann, C. Benzmüller, A. Fiedler, A. Maier, M. Pollet: Proof-development in OMEGA: The irrationality of sqrt(2). In: Thirty five years of Automating Mathematics, Appl. Logic Series, vol. 28, Kluwer Publishing Company, 2003
J. Siekmann, G. Wrightson: “Strong Completeness of A. Kowalski’s Connection Graph Proof Procedure” Springer Lecture Notes on AI, vol 2408, pp 231, 2002 strong-completeness-of-a-kowalskis-connection-graph-proof-procedure
Dieter Hutter, Bruno Langenstein, Georg Rock, Jörg H. Siekmann, Werner Stephan & Roland Vogt: Formal software development in the Verification Support Environment (VSE), Journal of Experimental & Theoretical Artificial Intelligence”, pages 383-406, Volume 12, Issue 4, 2000
E. Melis, J. Siekmann: “Knowledge-based proof planning” Journal of Artificial Intelligence, vol 115, p 65-105, 1999
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 ai
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. computational-logic-2
J. Siekmann: “Unification Theory” Journal of Symbolic Computation 7, 1989, 207-274. journal-symbolic-computation
J. Siekmann, P. Szabo: “The undecidability of the DA-unification problem” Journal of Symbolic Logic, 54 (2), 1989, 402-414. journal-of-symbolic-logic
A. Herold, J. Siekmann: “Unification in abelian semigroups” Journal of Automated Reasoning 3 (3), 1987, 247-283. journal-of-automated-reasoning
R. Book, J. Siekmann: “On Unification: Equational theories are not bounded”, Journal of Symbolic Computation 2, 1986, 317-324.
Jörg H. Siekmann and Graham Wrightson: Automation of Reasoning, volume 1 and 2. Springer, 1983.
J. Siekmann, P. Szabo: “A noetherian and confluent rewriting system for idempotent semigroups” Semigroup Forum 25, 1982, 83-110. semigroup-forum