Internal Research Reports – Jörg Siekmann

since 1990

C. Benzmüller, M. Kohlhase, J. Siekmann. Abschlussbericht Projekt HOTEL. DFG research grant report, 2004.
S. Autexier, C. Benzmüller, M. Kohlhase, J. Siekmann, VERMATH: Distributed Mathematical Problem Solving. DFG Research grant proposal, 2004.
J. Siekmann, C. Benzmüller, und S. Autexier, OMEGA: Agent-oriented Proof Planning. Project proposal in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes, 2004.
M. Pinkal, J. Siekmann, C. Benzmüller, und I. Kruijff-Korbayova, DIALOG: Natural Language-based Interaction with a Mathematics Assistance System. Project proposal in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes, 2004.
J. Siekmann, C. Benzmüller, und E. Melis, OMEGA: Resource-adaptive Proof Planning. Project report in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes, 2004.
M. Pinkal, J. Siekmann, und C. Benzmüller, DIALOG: Tutorial Dialog with an Assistance System for Mathematics. Project report in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes, 2004.
J. Siekmann, C. Benzmüller, und E. Melis, OMEGA: Ressourcenadaptive Beweisplanung. Project proposal in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes, 2001.
M. Pinkal, J. Siekmann, und C. Benzmüller, DIALOG: Tutorieller Dialog mit einem Mathematik-Assistenzsystem. Project proposal in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes, 2001.
K. Fischer, Ch Gerber, J. Siekmann, G. Vierke: “Holonic Multi Agent Systems”, DFKI Research Report RR-99-03, Saarbrücken, 1999
Jörg H. Siekmann, H. J. Müller, Klaus Fischer, Norbet Kuhn, S. Abdennadher, J. P. Müller, M. Pischel, und A. Schupeta. Project overview and summary of result. DFKI report, DFKI, 1993.
Manfred Kerber, Michael Kohlhase, und Jörg H. Siekmann. Reasoning with assertions and examples. SEKI-Report SR–93, Universität des Saarlandes, 1993.
Erica Melis, Manfred Kerber, und Jörg H. Siekmann. Analogical reasoning with typical examples. SEKI-Report SR–92–13, Universität des Saarlandes, 1992.
Xiaorong Huang, Manfred Kerber, Michael Kohlhase, Erica Melis, Dan Nesmith, Jörn Richts, und Jörg H. Siekmann. Ω-MKRP. SEKI-Report SR– 92–22, Universität des Saarlandes, 1992.

until 1990

Christoph Beierle, Ulrich Hedtstück, Udo Pletat, and Jörg H. Siekmann. An order sorted predicate logic for knowledge representation systems. LLILOG Report and IWBS Report 113, IBM Stuttgart, 1990.
Franz Baader, Hans-Jürgen Bürckert, Bernd Hollunder, Werner Nutt, und Jörg H. Siekmann. Concept logic. Research Report RR-90-10, DFKI Kaiserslautern, 1990.
Christoph Beierle, Ulrich Hedtstück, Udo Pletat, und Jörg H. Siekmann. An order sorted predicate logic with closely coupled taxonomic information. IWBS Report and DFKI Report, 1989.
Karl-Hans Bläsius, Udo Pletat, und Jörg H. Siekmann. Konzeptuelle Probleme der Inferenzmaschine für L-LILOG. LILOG-Report 114, IBM Stuttgart, 1989.
Manfred Schmidt-Schauss und Jörg H. Siekmann. Unification algebras: An axiomatic approach to unification, equation solving and constraint solving. SEKI-Report SR–88–23, Universität Kaiserslautern, 1988.
Hans-Jürgen Ohlbach und Jörg H. Siekmann. Using automated theorem proving techniques for deductive databases. SEKI-Report SR–88–06, Universität Kaiserslautern, 1988.
Alexander Herold und Jörg H. Siekmann. Unification in Abelian Semigroups. Memo SEKI–1985–III, Universität Kaiserslautern, 1985.
Ronald Book und Jörg H. Siekmann. On the unification hierarchy. Memo– SEKI–1984, Universität Kaiserslautern, 1984.
Peter Raulefs und Jörg H. Siekmann. Seki Programmverifikation. Memo SEKI–1983–VI, 1983.
Jörg H. Siekmann und Peter Szabó. Universal unification and a classifi-cation of equational theories. Memo-seki–1981–ii, Universität Karlsruhe, 1981.
Jörg H. Siekmann und Peter Szabó. Universal unification and a classification of equational theories. Memo SEKI–1981–II, Universität Karlsruhe, 1981.
Jörg H. Siekmann und Peter Szabó. Universal unification in regular ACFM theories. Interner Bericht, Universität Karlsruhe, 1981.
Peter Raulefs, Jörg H. Siekmann, Peter Szabó, und Eva Unvericht. A short survey on the state of the art in matching and unification problems. Memoseki–1979–i, Universität Karlsruhe, 1979.
Suanne Daniels und Jörg H. Siekmann. Reduced connection graphs. Informatik internal report, Universität Karlsruhe, 1979.
Jörg H. Siekmann und Peter Szabó. The equivalence of term rewriting systems and type-0-grammars. Memo SEKI–1979–II, Universität Karlsruhe, 1979.
Jörg H. Siekmann und Werner Stephan. Completeness, consistency, and confluence properties of the connection graph proof procedure. MemoSEKI–1978–iii, Universität Karlsruhe, 1978.
Jörg H. Siekmann. Matching and unification problems. Memo-SEKI–1978– II Universität Karlsruhe and Memo 78, University of Essex, 1978.
Norbert Eisinger, Jörg H. Siekmann, und Graham Wrightson. Paramodulated connection graphs. Interner Bericht. Institut für Informatik, Universität Karlsruhe, 1978.
Peter Raulefs und Jörg H. Siekmann. Unification of idempotent functions. Memo-SEKI–1978–I, Universität Karlsruhe, 1978.
Jörg H. Siekmann und Graham Wrightson. Paramodulated connection graphs. Memo-SEKI–1977–I, Universität Karlsruhe, 1977.
Jörg H. Siekmann. Unification of commutative terms. Memo-SEKI–1976– IV, Universität Karlsruhe, 1976.
Mike Livesey und Jörg H. Siekmann. Unification of sets and multisets. Memo-SEKI-1976-II, Universität Karlsruhe, 1976.
Jörg H. Siekmann. String unification, part 1. Computer Science Memo–7, University of Essex, 1975.
Mike Livesey und Jörg H. Siekmann. Termination and decidability result for string unification. Internal Report CSM–12, University of Essex, 1975.
Jörg H. Siekmann. Building axioms into an automated theorem prover. Computer Science Memo-6, University of Essex, 1973.