since 2001
| M. Hoche, J.Siekmann, P.Szabo: “String unification is essentially infinitary”, IFCOLOG Journal of Logics and their Applications, Volume 3 Number 5, 2016 | [su_button url=”http://www.collegepublications.co.uk/downloads/ifcolog00009.pdf” target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| 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 | [su_button url=”http://www.springer.com/us/book/9783319418414″ target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| 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. | [su_button url=”http://store.elsevier.com/Computational-Logic/isbn-9780444516244/” target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| S. Autexier, Chr. Benzmüller, D. Dietrich, J. Siekmann: OMEGA in: „Resource Adaptive Cognitive Processes“ , Springer Cognitive Technologies, Springer Verlag, 2010 | [su_button url=”http://www.springer.com/us/book/9783540894070″ target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Ch. Benzmüller, M. Schiller, J. Siekmann: „Resource Bounded Modelling and Analysis of Human-Level Interactive Proofs“ in: Springer, Cognitive Technologies, Springer Verlag, 2010 | [su_button url=”http://link.springer.com/chapter/10.1007/978-3-540-89408-7_13″ target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| E. Melis, A. Meier, J. Siekmann: “Proof Planning with mutiple Strategies” Journal of Artificial Intelligence, vol 172, pp656-658, 2007 | [su_button url=”https://siekmann.dfki.de/wp-content/uploads/2016/11/Proof-planning-with-mutiple-Strategies.pdf” target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| C. Benzmüller, A. Fiedler, A. Meier, M. Pollet, and J. Siekmann: OMEGA. In F. Wieddijk (ed.), The seventeen provers of the world, LNAI, vol 3600, pp. 127-141, Springer. 2006. | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| C. Benzmüller, H. Horacek, I. Kruijff-Korbayova, M. Pinkal, J. Siekmann, M. Wolskam, Natural Language Dialog with a Tutor System for Mathematical Proofs. Journal of Computer Science and Technology. 2006 | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| J. Siekmann, C. Benzmüller, and S. Autexier, Computer Supported Mathematics with OMEGA. Special Issue on Mathematics Assistance Systems, Journal of Applied Logic, vol 4 (4), Elsevier. 2005 | [su_button url=”https://siekmann.dfki.de/wp-content/uploads/2016/11/Computer-supported-mathematics-with-OMEGA.pdf” target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| C. Benzmüller, I. Kruijff-Korbayova, M. Pinkal, J. Siekmann: Natural Language Dialog with a Tutor System for Mathematical Proof. Journal JCST, 2005. | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| J. Siekmann, C. Benzmüller: OMEGA: Computer Supported Mathematics. In: Advances in Artificial Intelligence, Springer LNAI, Vol. 3228, 2004 | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| E. Melis, J. Siekmann: ActiveMath: An Intelligent Tutoring System for Mathematics: Int. Conf. on AI and Soft Computing, LNAI vol. 3070, 2004 | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| J. Siekmann, C. Benzmüller, A. Fiedler, A. Meier, I. Normann, and M. Pollet: Proof Developtment in OMEGA – The Irrationality of Square Root of 2. In Fairouz Kamareddine (ed.), Thirty Five Years of Automating Mathematics, Applied Logic Series. Volume 28, pp. 271-314. Kluwer Academic Publishers, July 2003. | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| J. Siekmann, G. Wrightson: “Strong Completeness of A. Kowalski’s Connection Graph Proof Procedure” Springer Lecture Notes on AI, vol 2408, pp 231, 2002 | [su_button url=”http://link.springer.com/chapter/10.1007%2F3-540-45632-5_10″ target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
until 2000
| 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 | [su_button url=”http://www.tandfonline.com/doi/abs/10.1080/095281300454784″ target=”blank” background=”#ACCAEA” size=”2″] PDF [/su_button] [su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Erica Melis and Jörg H. Siekmann: Knowledge-based proof planning. Artificial Intelligence, 115(1):65–105, 1999. | [su_button url=”https://siekmann.dfki.de/wp-content/uploads/2016/08/Knowledge-based-proof-planning.pdf” target=”blank” background=”#ACCAEA” size=”2″] PDF [/su_button] [su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Jörg H. Siekmann, Stephan Hess, Christoph Benzmüller, Lassaad Cheikhrouhou, Armin Fiedler, Helmut Horacek, Michael Kohlhase, Karsten Konrad, Andreas Meier, Erica Melis, Martin Pollet, and Volker Sorge: LOUI Lovely Omega User Interface. Formal Aspects of Computing, 11:326–342, 1999. | [su_button url=”https://siekmann.dfki.de/wp-content/uploads/2016/08/Lovely-Omega-User-Interface.-Formal-Aspects-of-Computing.pdf” target=”blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Jörg H. Siekmann, Helmut Horacek, Michael Kohlhase, Christoph Benzmüller, Lassad Cheikhrouhou, Detlef Fehrer, Armin Fiedler, Stephan Hess, Karsten Konrad, Andreas Meier, Erica Melis, and Volker Sorge: An Interactive Proof Development Environment + Anticipation = A Mathematical Assistant. In Daniel M. Dubois, editor, International Journal of Computing Anticipatory Systems (CASYS), volume 3, pages 101–110, Liege, Belgium, 1999. CHAOS. | [su_button url=”https://siekmann.dfki.de/wp-content/uploads/2016/08/An-Interactive-Proof-Development-Environment-Anticipation-A-Mathematical-Assistant.pdf” target=”blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Michael Kohlhase, Erica Melis, and Jörg H. Siekmann: OMEGA: A mathematical assistant. In Maarten de Rijke, editor, Liber Amicorum J. von Bentham. Amsterdam, 1999. | [su_button url=”https://siekmann.dfki.de/wp-content/uploads/2016/08/OMEGA-A-mathematical-assistant.pdf” target=”blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| J. Siekmann, M. Kohlhase, E. Melis: “OMEGA: Ein mathematisches Assistenzsystem” Kognitionswissenschaft, vol 7, No. 3, p 101-105, 1998 (Englisch in: JFAK, Essays dedicated to J. von Benthem, Amsterdam, Univ. Press, 1999) | [su_button url=”https://siekmann.dfki.de/wp-content/uploads/2016/11/omega-ein-mathematisches-assistenzsystem.pdf” target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button] |
| Jörg H. Siekmann, Stephan Hess, Christoph Benzmüller, Lassaad Cheikhrouhou, Detlef Fehrer, Armin Fiedler, Helmut Horacek, Michael Kohlhase, Karsten Konrad, Andreas Meier, Erica Melis, and Volker Sorge: LOUI: A distributed graphical user interface for the interactive proof system Omega. In Roland C. Backhouse, editor, User Interfaces for Theorem Provers, number 98–08 in Computing Science Reports, pages 130–138, Department of Mathematics and Computing Science, Eindhoven Technical University, 1998. | [su_button url=”https://siekmann.dfki.de/wp-content/uploads/2016/08/LOUI-A-distributed-graphical-user-interface-for-the-interactive-proof-system-Omega.pdf” target=”blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Manfred Kerber, Erica Melis, and Jörg H. Siekmann. Calculemus et exemplificamus: Reasoning with hybrid knowledge bases. In T. Dartnall, editor, Creativity, Cognition and Computation, Proceedings of AAAI. MIT Press, 1996. | [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, and Jörg H. Siekmann: Die Beweisentwicklungsumgebung Ω-MKRP. Informatik Forschung und Entwicklung, 11(1), 1996. | [su_button url=”https://siekmann.dfki.de/wp-content/uploads/2016/08/Die-Beweisentwicklungsumgebung.pdf” target=”blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Dieter Hutter, Bruno Langenstein, Claus Sengler, Jörg H. Siekmann, Werner Stephan, and Andreas Wolpers: Verification support environment (VSE). Journal of High Integrity Systems, 1(6):523–530, 1996. | [su_button url=”https://siekmann.dfki.de/wp-content/uploads/2016/08/Verification-support-environment-VSE.pdf” target=”blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| K. Fischer, N. Kuhn, H. J. Müller, J. P. Müller, M. Pischel, A. Schupeta, und J. Siekmann. Güter, Trucks und Speditionen: eine ausgezeichnete Domäne für Multiagentenforschung. Magazin Forschung, 1:10-16, 1994 | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Franz Baader and Jörg H. Siekmann: Unification theory. In Dov M. Gabbay, C. J. Hogger, and J. Alan Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 2. Oxford Univ. Press, 1994. | [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, and Jörg H. Siekmann: A predicate logic with closely coupled taxonomic information. In K. Meinke and J. K. Tucker, editors, Many sorted Logics and its Applications. John Wiley & Sons, 1993. | [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, Peter H. Schmitt, and Jörg H. Siekmann: An order sorted logic for knowledge representation systems. Journal of Artificial Intelligence, vol 55: 149–191, 1992. | [su_button url=”http://www.sciencedirect.com/science/article/pii/0004370292900553″ target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Jörg H. Siekmann: Künstliche Intelligenz und Logik. Sonderheft Zeitschrift KI, 3, 1992. | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Michael McRobbie and Jörg H. Siekmann: Artificial intelligence: Perspectives and predictions. Applied Artificial Intelligence, vol 5: 187–207, 1991. | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Hans Jürgen Ohlbach and Jörg H. Siekmann: The Markgraf Karl refutation procedure. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: essays in honor of Alan Robinson. MIT-Press, Cambridge, 1991. | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
until 1990
| 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. | [su_button url=”https://link.springer.com/chapter/10.1007%2F978-3-642-76274-1_10″ target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Jörg H. Siekmann: An introduction to unification theory. In R. B. Banerji, editor, Formal Techniques of Artificial Intelligence. North Holland, 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. ICOT-Journal, (1), 1990. | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Jörg H. Siekmann: Unification theory: A survey. In Claude Kirchner, editor, Unification, pages 207–274. Academic Press, 1990. | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Jörg H. Siekmann: An introduction to unification theory. In R. B. Banerji, editor, A Sourcebook on Formal Techniques in Artificial Intelligence. Elsevier, 1989. | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Hans-Jürgen Bürckert, Alexander Herold, Deepak Kapur, Jörg H. Siekmann, Mark Stickel, M. Tepp, and Hantao Zhang: Opening the ACunification race. Journal of Automated Reasoning, 4:465–475, 1989. | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Jörg H. Siekmann: Unification theory: A survey. Journal of Symbolic Computation, 7(3):207–274, 1989. | [su_button url=”http://ac.els-cdn.com/S0747717189800124/1-s2.0-S0747717189800124-main.pdf?_tid=6e194932-a614-11e6-9d2b-00000aab0f01&acdnat=1478651915_8df7c9ee3a24215d159061978067aa58″ target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Jörg H. Siekmann and Peter Szabó: The undecidability of the DA-unification problem. Journal of Symbolic Logic, 54(2):402–414, 1989. | [su_button url=”https://www.jstor.org/stable/2274856?seq=1#page_scan_tab_contents” target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Michael McRobbie and Jörg H. Siekmann: Artificial intelligence: Perspectives and predictions. European Journal on AI (AI Communications), 1(4), 1988. | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Alexander Herold and Jörg H. Siekmann: Unification in Abelian Semigroups. Journal of Automated Reasoning, 3(3):247–283, 1987. | [su_button url=”http://link.springer.com/article/10.1007/BF00243791″ target=”_blank” 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: Computergestützte Frühwarn- und Entscheidungssysteme. Informatik Spektrum, 10(1):24–39, 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 unification: Equational theories are not bounded. Journal of Symbolic Computation, 2:317–324, 1986. | [su_button url=”https://siekmann.dfki.de/wp-content/uploads/2016/11/On-Unification-Equational-theories-are-not-bounded.pdf” target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Jörg H. Siekmann and Peter Szabó: Uniwersalnaja unifikazija i klassifikazija ekwazionalnich teorij. Perewod na russkij jasyk, 1985. | [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: Computergestützte Frühwarn- und Entscheidungssysteme. In Wissenschaft und Rüstung, pages 163–199. Steinweg, 1985. | [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 and confluent rewrite system for idempotent semigroups. Semigroup Forum, 25:83–110, 1982. | [su_button background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
| Jörg H. Siekmann and Graham Wrightson: Paramodulated connection graphs. Acta Informatica, 13:67–86, 1980. | [su_button url=”http://link.springer.com/article/10.1007%2FBF02573590?LI=true” target=”_blank” background=”#ACCAEA” size=”2″] PDF [/su_button][su_button background=”#ACCAEA” size=”2″]BibTex[/su_button] |
[su_button url=”https://siekmann.dfki.de/en/all-publications/” background=”#ACCAEA” size=”4″]<< back[/su_button]