Franz Baader, Hans-Jürgen Bürckert, Bernd Hollunder, Werner Nutt, and Jörg H. Siekmann: Concept logics. In J. W. Lloyd, editor, Proceedings of Symposium on Computational Logic, pages 177–201, Brussels, 1990. Springer. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Karl-Hans Bläsius, Claus-Reiner Rollinger, and Jörg H. Siekmann: Struktur des Inferenzsystems in L-LILOG. In Karl-Hans Bläsius, Ulrich Hedtstück, and Claus-Rainer Rollinger, editors, Sorts and Types in Artificial Intelligence, volume 418 of Lecture Notes in Artificial Intelligence, pages 165–182. Springer, 1990. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Jörg H. Siekmann. Social impacts of artificial intelligence. In Fifth Generation Computer Conference, pages 178 ff., 1988. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Karl-Hans Bläsius and Jörg H. Siekmann: Partial unification for graph based equational reasoning. In Ewing Lusk and Ross Overbeck, editors, Proceedings of 9th Conference on Automated Deduction, volume 310 of Lecture Notes in Computer Science, pages 397–414. Springer, 1988. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Manfred Schmidt-Schauss and Jörg H. Siekmann: An axiomatic approach to unification. In Proceedings of Second Workshop on Unification. Val d’Ajol, 1988. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Jörg H. Siekmann: Unification theory. In Benedict du Boulay, David Hogg, and Luc Steels, editors, Proceedings of 7th European Conference on Artifi- cial Intelligence, pages 365–400. Brighton, 1986. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Norbert Eisinger, Jörg H. Siekmann, and Eva Unvericht: The Markgraf Karl Refutation Procedure. In Jörg Siekmann, editor, Proceedings of 8th Conference on Automated Deduction (CADE), volume 230 of Lecture note in computer science, pages 682 ff. Springer, 1986. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Ronald Book and Jörg H. Siekmann: On the unification hierarchy. In Herbert Stoyan, editor, GWAI-85, 9th German Workshop on Artificial Intelligence, Dassel / Solling, number 118 in Informatik Fachberichte, pages 111–117. Springer, 1985. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Jörg H. Siekmann: Künstliche Intelligenz KI:1984. In Proceedings der Internationalen Konferenz zur Technologiefolgenabschätzung, OECD und BMFT, pages 676 ff., 1984. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Jörg H. Siekmann: Universal unification. In Robert E. Shostak, editor, Proceedings of the 7th International Conference on Automated Deduction (CADE-7), volume 170 of Lecture Notes in Computer Science, pages 1–42. Springer, 1984. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Jörg H. Siekmann: Einführung in die Künstliche Intelligenz. In Wolfgang Bibel and Jörg H. Siekmann, editors, KIFS, volume 59 of Informatik Fachberichte, pages 1–60. Springer, 1982. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Jörg H. Siekmann and Peter Szabó: Universal unification and a classification of equational theories. In D. Loveland, editor, Proceedings of 6th Conference on Automated Deduction (CADE-6), volume 138 of Lecture Notes in Computer Science, pages 369–389. Springer, 1982. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Jörg H. Siekmann and Peter Szabó: Universal unification. In Wolfgang Wahlster, editor, Proceedings of GI-Fachtagung Künstliche Intelligenz (GWAI-82), 6th German Workshop on Artificial Intelligence, Bad Honnef, September 27 – October 1, 1982, Proceedings, volume 58 of Informatik Fachberichte, pages 102–141. Springer, 1982. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Karl-Hans Bläsius, Norbert Eisinger, Jörg H. Siekmann, Gert Smolka, Alexander Herold, and Christoph Walther: The Markgraf Karl refutation procedure, fall 1981. In P. Hayes and R. Schank, editors, Proceedings of the 7th Intern. Joint Conference on Artificial Intelligence (IJCAI), volume 1, pages 511–518. Canada, 1981. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Jörg H. Siekmann and Peter Szabó: Universal unification in regular ACFM theories. In P. Hayes and P. Schauk, editors, 7th International Joint Conference on Artificial Intelligence (IJCAI), volume 1, pages 532–538. Vancouver, 1981. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Jörg H. Siekmann and Gert Smolka: Selection heuristics, deletion strategies, and n-level terminator configurations for the c-graph proof procedure. In Jörg H. Siekmann, editor, Proceedings of GI-Fachtagung Künstliche Intelligenz (GWAI-81), volume 47 of Informatik Fachberichte, pages 199–200. Springer, 1981. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Jörg H. Siekmann and Peter Szabó: A Noetherian rewrite system for idempotent semigroups. In Jörg H. Siekmann, editor, Proceedings of GIFachtagung Künstliche Intelligenz (GWAI-81), volume 47 of Informatik Fachberichte, pages 235–245. Springer, 1981. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Norbert Eisinger, Jörg H. Siekmann, Gert Smolka, Eva Unvericht, and Christoph Walther: Das Karlsruher Beweissystem. In Steven Hardy, editor, Proceedings of the Conference of the European Society for Artificial Intelligence and Simulation of Behavior (AISB), number 33 in Fachberichte Informatik. Amsterdam, 1980. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Norbert Eisinger, Jörg H. Siekmann, Gert Smolka, Eva Unvericht, and Christoph Walther: Das Karlsruher Beweissystem. In Tagungsband der 10. GI-Jahrestagung, number 33 in Informatik Fachberichte, pages 400–412. Springer, 1980. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Mike Livesey, Jörg H. Siekmann, Eva Unvericht, and Peter Szabó: Unification problems for combinations of Associativity, Commutativity, Distributivity, and Idempotence axioms. In William H. Joyner, editor, Proceedings of the 4th Workshop on Automated Deduction. Austin (Texas), 1979. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Norbert Eisinger, Jörg H. Siekmann, and Graham Wrightson: Paramodulated connection graphs. In Derek H. Sleeman, editor, Proceedings of AISB/GI Conference (Proceedings of the 4th European Conference on Artificial Intelligence), Hamburg, Germany, pages 105–109. Leeds University, 1978. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Jörg H. Siekmann and Werner Stephan: Completeness and soundness of the connection graph proof procedure. In Derek H. Sleeman, editor, Proceedings of AISB/GI Conference on Artificial Intelligence, pages 340–344, Hamburg, 1978. Leeds University. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Jörg H. Siekmann: Matching under commutativity. In Proceedings of Conference on Symbolic and Algebraic Manipulation, volume 72 of Lecture Notes in Computer Science, pages 531–545. Springer, 1978. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Stefan Kühner, Chris Matthis, Peter Raulefs, and Jörg H. Siekmann: Unification of idempotent functions. In Morgan Kaufmann, editor, Proceedings of 5th Intern. Joint Conference on Artificial Intelligence, volume 1, pages 528 ff., Boston, 1977. MIT Press. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Susane Daniels, Chris Matthis, Michael Lutze, Jörg H. Siekmann, and Eva Unvericht: Incorporating mathematical knowledge into an ATP-system, investigated for the case of automata theory. In Workshop on Automated Deduction, Cambridge Mass, 1977. MIT Press. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
Jörg H. Siekmann: String unification and pattern definable languages. In Wolfgang Bibel and Jörg H. Siekmann, editors, Proceedings of the 2nd German Workshop of Artificial Intelligence, Dortmund, 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. In Proceedings der GI-Fachtagung für Mustererkennung und Kognitive Verfahren, Karlsruhe, 1975. Univ. of Essex. |
[su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |