Deprecated: Creation of dynamic property Papercite::$options is deprecated in /var/www/clients/client89/web233/web/wp-content/plugins/papercite/papercite.php on line 198
since 1990
| C. Benzmüller, M. Kohlhase, J. Siekmann. Abschlussbericht Projekt HOTEL. DFG research grant report, 2004. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| S. Autexier, C. Benzmüller, M. Kohlhase, J. Siekmann, VERMATH: Distributed Mathematical Problem Solving. DFG Research grant proposal, 2004. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| K. Fischer, Ch Gerber, J. Siekmann, G. Vierke: “Holonic Multi Agent Systems”, DFKI Research Report RR-99-03, Saarbrücken, 1999 | [su_button url=“http://siekmann.dfki.de/wp-content/uploads/2016/11/Holonic-Multi-Agent-Systems.pdf“ target=“_blank“ background=“#ACCAEA“ size=“2″] PDF [/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Manfred Kerber, Michael Kohlhase, und Jörg H. Siekmann. Reasoning with assertions and examples. SEKI-Report SR–93, Universität des Saarlandes, 1993. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Erica Melis, Manfred Kerber, und Jörg H. Siekmann. Analogical reasoning with typical examples. SEKI-Report SR–92–13, Universität des Saarlandes, 1992. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Alexander Herold und Jörg H. Siekmann. Unification in Abelian Semigroups. Memo SEKI–1985–III, Universität Kaiserslautern, 1985. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Ronald Book und Jörg H. Siekmann. On the unification hierarchy. Memo– SEKI–1984, Universität Kaiserslautern, 1984. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Peter Raulefs und Jörg H. Siekmann. Seki Programmverifikation. Memo SEKI–1983–VI, 1983. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Jörg H. Siekmann und Peter Szabó. Universal unification and a classifi-cation of equational theories. Memo-seki–1981–ii, Universität Karlsruhe, 1981. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Jörg H. Siekmann und Peter Szabó. Universal unification and a classification of equational theories. Memo SEKI–1981–II, Universität Karlsruhe, 1981. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Jörg H. Siekmann und Peter Szabó. Universal unification in regular ACFM theories. Interner Bericht, Universität Karlsruhe, 1981. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Suanne Daniels und Jörg H. Siekmann. Reduced connection graphs. Informatik internal report, Universität Karlsruhe, 1979. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| 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. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Jörg H. Siekmann. Matching and unification problems. Memo-SEKI–1978– II Universität Karlsruhe and Memo 78, University of Essex, 1978. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Norbert Eisinger, Jörg H. Siekmann, und Graham Wrightson. Paramodulated connection graphs. Interner Bericht. Institut für Informatik, Universität Karlsruhe, 1978. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Peter Raulefs und Jörg H. Siekmann. Unification of idempotent functions. Memo-SEKI–1978–I, Universität Karlsruhe, 1978. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Jörg H. Siekmann und Graham Wrightson. Paramodulated connection graphs. Memo-SEKI–1977–I, Universität Karlsruhe, 1977. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Jörg H. Siekmann. Unification of commutative terms. Memo-SEKI–1976– IV, Universität Karlsruhe, 1976. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Mike Livesey und Jörg H. Siekmann. Unification of sets and multisets. Memo-SEKI-1976-II, Universität Karlsruhe, 1976. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Jörg H. Siekmann. String unification, part 1. Computer Science Memo–7, University of Essex, 1975. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Mike Livesey und Jörg H. Siekmann. Termination and decidability result for string unification. Internal Report CSM–12, University of Essex, 1975. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
| Jörg H. Siekmann. Building axioms into an automated theorem prover. Computer Science Memo-6, University of Essex, 1973. | [su_button background=“#ACCAEA“ size=“2″] PDF [/su_button][su_button background=“#ACCAEA“ size=“2″]BibTex[/su_button] |
[su_button url=“http://siekmann.dfki.de/de/alle-publikationen/“ background=“#ACCAEA“ size=“4″]<< zurück[/su_button]
