Jörg Siekmann

Internal Research Reports

since 1990

C. Benzmüller, M. Kohlhase, J. Siekmann. Abschlussbericht Projekt HOTEL. DFG research grant report, 2004.   PDF   BibTex
S. Autexier, C. Benzmüller, M. Kohlhase, J. Siekmann, VERMATH: Distributed Mathematical Problem Solving. DFG Research grant proposal, 2004.   PDF   BibTex
J. Siekmann, C. Benzmüller, and S. Autexier, OMEGA: Agent-oriented Proof Planning. Project proposal in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes, 2004.   PDF   BibTex
M. Pinkal, J. Siekmann, C. Benzmüller, and 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.   PDF   BibTex
J. Siekmann, C. Benzmüller, and E. Melis, OMEGA: Resource-adaptive Proof Planning. Project report in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes, 2004.   PDF   BibTex
M. Pinkal, J. Siekmann, and 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.   PDF   BibTex
J. Siekmann, C. Benzmüller, and E. Melis, OMEGA: Ressourcenadaptive Beweisplanung. Project proposal in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes, 2001.   PDF   BibTex
M. Pinkal, J. Siekmann, and 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.   PDF   BibTex
Christian Gerber, Jörg H. Siekmann, and Gero Vierke. Holonic multi-agent systems. Technical report, DFKI, 1999.   PDF   BibTex
Jörg H. Siekmann, H. J. Müller, Klaus Fischer, Norbet Kuhn, S. Abdennadher, J. P. Müller, M. Pischel, and A. Schupeta. Project overview and summary of result. DFKI report, DFKI, 1993.   PDF   BibTex
Manfred Kerber, Michael Kohlhase, and Jörg H. Siekmann. Reasoning with assertions and examples. SEKI-Report SR–93, Universität des Saarlandes, 1993.   PDF   BibTex
Erica Melis, Manfred Kerber, and Jörg H. Siekmann. Analogical reasoning with typical examples. SEKI-Report SR–92–13, Universität des Saarlandes, 1992.   PDF   BibTex
Xiaorong Huang, Manfred Kerber, Michael Kohlhase, Erica Melis, Dan Nesmith, Jörn Richts, and Jörg H. Siekmann. Ω-MKRP. SEKI-Report SR– 92–22, Universität des Saarlandes, 1992.   PDF   BibTex

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

 

<< back