var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=http%3A%2F%2Fpage.mi.fu-berlin.de%2Fcbenzmueller%2Fpapers%2Fchris.bib&jsonp=1&commas=true&fullnames=0&noTitleLinks=true&showSearch=true&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=http%3A%2F%2Fpage.mi.fu-berlin.de%2Fcbenzmueller%2Fpapers%2Fchris.bib&jsonp=1&commas=true&fullnames=0&noTitleLinks=true&showSearch=true\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=http%3A%2F%2Fpage.mi.fu-berlin.de%2Fcbenzmueller%2Fpapers%2Fchris.bib&jsonp=1&commas=true&fullnames=0&noTitleLinks=true&showSearch=true\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2024\n \n \n (15)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Special Issue on Non-Classical Reasoning for Contemporary AI Applications.\n \n \n\n\n \n Steen, A., & Benzmüller, C.,\n editors.\n \n\n\n \n\n\n\n KI – Künstliche Intelligenz, 2024.\n To appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@book{E31,\n  Keywords =\t {own, Argumentation, Logic},\n  editor =\t {Steen, Alexander and Benzmüller, Christoph},\n  title =\t {Special Issue on Non-Classical Reasoning for Contemporary AI Applications},\n  publisher =\t {KI -- Künstliche Intelligenz},\n  year =\t 2024,\n  OPTurl = {https://link.springer.com/journal/13218/updates/25263164},\n  OPTdoi =          {},\n  note =         {To appear},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The LogiKEy Methodology: Applications in AI Ethics & Prospects for Logic Education.\n \n \n\n\n \n Benzmüller, C., & Fuenmayor, D.\n\n\n \n\n\n\n In Formal Methods and Science in Philosophy IV, Book of Talk Abstracts, 2024. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{R91,\n  Author =\t {Benzm{\\"u}ller, Christoph and Fuenmayor, David},\n  Title =\t {The LogiKEy Methodology: Applications in AI Ethics \\& Prospects\nfor Logic Education},\n  OPTEditor =\t {},\n  Booktitle =\t {Formal Methods and Science in Philosophy IV,\n                  Book of Talk Abstracts},\n  Year =\t 2024,\n  OPTPages =\t {3--4},\n  Adress =\t {Dubrovnik, Croatia},\n  OPTUrl =          {},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n On the maximum of positive properties and modal collapse in Gödel's ontological argument compared to its variants.\n \n \n\n\n \n Mülenbeck, C., & Benzmüller, C.\n\n\n \n\n\n\n In Formal Methods and Science in Philosophy IV, Book of Talk Abstracts, 2024. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{R90,\n  Author =\t {Cordelia M{\\"u}lenbeck and Benzm{\\"u}ller, Christoph},\n  Title =\t {On the maximum of positive properties and modal collapse in Gödel's ontological argument compared to its variants},\n  OPTEditor =\t {},\n  Booktitle =\t {Formal Methods and Science in Philosophy IV,\n                  Book of Talk Abstracts},\n  Year =\t 2024,\n  OPTPages =\t {3--4},\n  Adress =\t {Dubrovnik, Croatia},\n  OPTUrl =          {},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Modelling Value-oriented Legal Reasoning in LogiKEy.\n \n \n\n\n \n Benzmüller, C., Fuenmayor, D., & Lomfeld, B.\n\n\n \n\n\n\n Logics, 2(1): 31-78. 2024.\n preprint arXiv:2006.12789\n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{J69,\n  author       = {Christoph Benzm{\\"u}ller and David Fuenmayor and Bertram Lomfeld},\n  title        = {Modelling Value-oriented Legal Reasoning in LogiKEy},\n  journal      = {Logics},\n  year         = {2024},\n  volume = 2,\n  number = 1,\n  pages = {31-78},\n  doi = {10.3390/logics2010003},\n  note        = {preprint arXiv:2006.12789},\n  addendum        = {preprint arXiv:2006.12789}\n}\n\n\n% @article{J68,  author       = {Xavier Parent and Christoph Benzm{\\"u}ller},  title        = {Conditional normative reasoning as a fragment of {HOL}},  journal      = {Journal of Applied Non-Classical Logics},  year         = {2024},  addendum        = {minor revisions, revision submitted, preprint: \\url{https://arxiv.org/abs/2308.10686}}}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Conditional normative reasoning as a fragment of HOL (Isabelle/HOL dataset).\n \n \n\n\n \n Parent, X., & Benzmüller, C.\n\n\n \n\n\n\n Archive of Formal Proofs, 2024. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"ConditionalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{J68afp,\n  author       = {Xavier Parent and Christoph Benzm{\\"u}ller},\n  title        = {Conditional normative reasoning as a fragment of {HOL} ({Isabelle/HOL} dataset)},\n  journal      = {Archive of Formal Proofs},\n  volume       = {2024},\n  year         = {2024},\n  url          = {https://www.isa-afp.org/entries/CondNormReasHOL.html},\n  }\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Church’s Type Theory.\n \n \n\n\n \n Benzmüller, C., & Andrews, P.\n\n\n \n\n\n\n In Zalta, E. N., & Nodelman, U., editor(s), The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Spring 2024 edition, 2024.\n \n\n\n\n
\n\n\n\n \n \n \"Church’sPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InCollection{B28,\n  author       =\t{Benzm{\\"u}ller, Christoph and Andrews, Peter},\n  title        =\t{{Church’s Type Theory}},\n  booktitle    =\t{The {Stanford} Encyclopedia of Philosophy},\n  editor       =\t{Edward N. Zalta and Uri Nodelman},\n  url          =\t{https://plato.stanford.edu/archives/spr2024/entries/type-theory-church/},\n  year         =\t{2024},\n  edition      =\t{{S}pring 2024},\n  publisher    =\t{Metaphysics Research Lab, Stanford University},\n  addendum = {(substantive revision Jan 2024)},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Check News in One Click: NLP-Empowered Pro-Kremlin Propaganda Detection.\n \n \n\n\n \n Solopova, V., Herman, V., Benzmüller, C., & Landgraf, T.\n\n\n \n\n\n\n In Aletras, N., & Clercq, O. D., editor(s), Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics, EACL 2024 - System Demonstrations, St. Julians, Malta, March 17-22, 2024, pages 44–51, 2024. Association for Computational Linguistics\n \n\n\n\n
\n\n\n\n \n \n \"CheckPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{C99,\n  author       = {Veronika Solopova and Viktoriia Herman and Christoph Benzm{\\"u}ller and Tim Landgraf},\n  editor       = {Nikolaos Aletras and Orph{\\'{e}}e De Clercq},\n  title        = {Check News in One Click: NLP-Empowered Pro-Kremlin Propaganda Detection},\n booktitle    = {Proceedings of the 18th Conference of the European Chapter of the\n                  Association for Computational Linguistics, {EACL} 2024 - System Demonstrations,\n                  St. Julians, Malta, March 17-22, 2024},\n  pages        = {44--51},\n  publisher    = {Association for Computational Linguistics},\n  year         = {2024},\n  url          = {https://aclanthology.org/2024.eacl-demo.6},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Check News in One Click: NLP-Empowered Pro-Kremlin Propaganda Detection.\n \n \n\n\n \n Solopova, V., Herman, V., Benzmüller, C., & Landgraf, T.\n\n\n \n\n\n\n 2024.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"CheckPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R89arxiv,\n  Author =\t {Veronika Solopova and Viktoriia Herman and Christoph Benzm{\\"u}ller and Tim Landgraf},\n  Title =\t {Check News in One Click: NLP-Empowered Pro-Kremlin Propaganda Detection},\n  Url =\t\t {https://arxiv.org/abs/2401.15717},\n  Doi =\t\t {10.48550/arXiv.2401.15717},\n  Publisher =\t {arXiv:2401.15717},\n  Note =         {Preprint},\n  Year =\t {2024},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automated Reasoning. IJCAR 2024.\n \n \n\n\n \n Benzmüller, C., Heule, M., & Schmidt, R.,\n editors.\n \n\n\n \n\n\n\n Springer. 2024.\n To appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@proceedings{E30,\n  Keywords =\t {own, Automated Reasoning, Logic},\n  editor =\t {Christoph Benzm{\\"u}ller and Marijn Heule and Renate Schmidt},\n  title =\t {Automated Reasoning. IJCAR 2024},\n  OPTvolume =       {},\n  OPTseries =\t {Lecture Notes in Artificial Intelligence},\n  publisher =\t {Springer},\n  year =\t 2024,\n  OPTpages =\t {},\n  OPTurl =       {},\n  OPTdoi =       {},\n  OPTisbn =\t {},\n  OPTissn =\t {},\n  addendum =     {Forthcoming/accepted},\n  note =         {To appear},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n What are Non-Classical Logics and why do we need them? An extended interview with Dov Gabbay and Leon van der Torre.\n \n \n\n\n \n Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n Künstliche Intelligenz. 2024.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{J67,\n  author       = {Alexander Steen and Christoph Benzm{\\"u}ller},\n  title        = {What are Non-Classical Logics and why do we need them? An extended interview with Dov Gabbay and Leon van der Torre},\n  journal      = {K{\\"{u}}nstliche Intelligenz},\n  OPTvolume       = {},\n  OPTnumber       = {},\n  OPTpages        = {},\n  year         = {2024},\n  OPTurl          = {},\n  doi          = {10.1007/s13218-023-00824-7},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Verantwortung.\n \n \n\n\n \n Höper, L., Schulte, C., & Benzmüller, C.\n\n\n \n\n\n\n In Furbach, U., Kitzelmann, E., Michaeli, T., & Schmid, U., editor(s), Künstliche Intelligenz für Lehrkräfte. Springer Nature, 2024.\n To appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@incollection{B27,\n  author =\t {Lukas H{\\"o}per and Carsten Schulte and Christoph Benzm{\\"u}ller},\n  title =\t {Verantwortung},\n  booktitle = {Künstliche Intelligenz für Lehrkräfte},\n  editor = {Ulrich Furbach and Emanuel Kitzelmann and Tilmann Michaeli and Ute Schmid},\n  publisher = {Springer Nature},\n  year =\t 2024,\n  OPTdoi = {},\n  OPTurl = {},\n  addendum =     {Forthcoming/accepted},\n  note =         {To appear},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Schließen aus Wissen.\n \n \n\n\n \n Furbach, U., & Benzmüller, C.\n\n\n \n\n\n\n In Furbach, U., Kitzelmann, E., Michaeli, T., & Schmid, U., editor(s), Künstliche Intelligenz für Lehrkräfte. Springer Nature, 2024.\n To appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@incollection{B26,\n  author =\t {Uli Furbach and Christoph Benzm{\\"u}ller},\n  title =\t {Schließen aus Wissen},\n  booktitle = {Künstliche Intelligenz für Lehrkräfte},\n  editor = {Ulrich Furbach and Emanuel Kitzelmann and Tilmann Michaeli and Ute Schmid},\n  publisher = {Springer Nature},\n  year =\t 2024,\n  OPTdoi = {},\n  OPTurl = {},\n  addendum =     {Forthcoming/accepted},\n  note =         {To appear},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Logikbasierte Wissensverarbeitung.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Furbach, U., Kitzelmann, E., Michaeli, T., & Schmid, U., editor(s), Künstliche Intelligenz für Lehrkräfte. Springer Nature, 2024.\n To appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@incollection{B25,\n  note =         {To appear},\n  author =\t {Christoph Benzm{\\"u}ller},\n  title =\t {Logikbasierte Wissensverarbeitung},\n  booktitle = {Künstliche Intelligenz für Lehrkräfte},\n  editor = {Ulrich Furbach and Emanuel Kitzelmann and Tilmann Michaeli and Ute Schmid},\n  publisher = {Springer Nature},\n  year =\t 2024,\n  OPTdoi = {},\n  OPTurl = {},\n  addendum =     {Forthcoming/accepted},\n  note =         {To appear},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Reflections on the Ontological Proof of Kurt Gödel.\n \n \n\n\n \n Vestrucci, A., & Benzmüller, C.\n\n\n \n\n\n\n In Marcacci, F., & Allen, P., editor(s), Divined Explanations. The Theological and Philosophical Context for the Development of the Sciences (1600-2000), of Philosophical Studies in Science and Religion. Brill, 2024.\n To appear\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@incollection{B24,\n  author =\t {Vestrucci, Andrea  and Benzm{\\"u}ller, Christoph},\n  title =\t {Reflections on the Ontological Proof of {Kurt Gödel}},\n  booktitle = {Divined Explanations. The Theological and Philosophical Context for the Development of the Sciences (1600-2000)},\n  editor = {Flavia Marcacci and Paul Allen},\n  publisher = {Brill},\n  series = {Philosophical Studies in Science and Religion},\n  year =\t 2024,\n  OPTdoi = {},\n  OPTurl = {},\n  isbn = {978-90-04-70188-5},\n  addendum =     {Forthcoming/accepted},\n  note =         {To appear},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Mathematical Proof Between Generations.\n \n \n\n\n \n Bayer, J., Benzmüller, C., Buzzard, K., David, M., Lamport, L., Matiyasevich, Y., Paulson, L., Schleicher, D., Stock, B., & Zelmanov, E.\n\n\n \n\n\n\n Notices of the AMS, 71(1): 79-92. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"MathematicalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{J66,\n  author =\t {Bayer, Jonas and Benzm{\\"u}ller, Christoph and\n                  Buzzard, Kevin and David, Marco and Lamport, Leslie\n                  and Matiyasevich, Yuri and Paulson, Lawrence and\n                  Schleicher, Dierk and Stock, Benedikt and Zelmanov,\n                  Efim},\n  title =\t {Mathematical Proof Between Generations},\n  journal =\t {Notices of the AMS},\n  doi =          {10.1090/noti2860},\n  url =\t\t {https://www.ams.org/notices/202401/rnoti-p79.pdf},\n  number =\t {1},\n  volume =\t {71},\n  pages =\t {79-92},\n  year =\t 2024,\n}\n\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (23)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Is HOL (as a metalogic) all we need for flexible normative reasoning?.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Ciabattoni, A., Horty, J. F., Slavkovik, M., van der Torre, L., & Knoks, A., editor(s), Normative Reasoning for AI, pages 22-23, 2023. DROPS\n Talk abstract\n\n\n\n
\n\n\n\n \n \n \"IsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{R89,\n  Author =\t {Christoph Benzmüller},\n  Title =\t {Is {HOL} (as a metalogic) all we need for flexible normative reasoning?},\n  Booktitle = {Normative Reasoning for AI},\n  Editor = {Ciabattoni, Agata and Horty, John F. and Slavkovik, Marija and  van der Torre, Leendert and Knoks, Alex},\n  Url =\t\t {https://drops.dagstuhl.de/opus/volltexte/2023/19236/},\n  Doi =\t\t {10.4230/DagRep.13.4.1},\n  Pages =        {22-23},\n  Publisher =\t {DROPS},\n  Note =         {Talk abstract},\n  Year =\t 2023,\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Searching for Wormholes in Proof-Space.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n In Korovin, K., & Rawson, M., editor(s), IWIL@LPAR 2023 Workshop, 2023. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W69,\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  title =\t {Searching for Wormholes in Proof-Space},\n  Booktitle =\t {IWIL@LPAR 2023 Workshop},\n  Editor =\t {Konstantin Korovin and Michael Rawson},\n  year = 2023,\n  OPTnote = {to appear},\n}\n\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Simplified Variant of Gödel's Ontological Argument.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Vestrucci, A., editor(s), Beyond Babel: Religions and Linguistic Pluralism, volume 43, of Sophia Studies in Cross-cultural Philosophy of Traditions and Cultures. Springer, Cham, 2023.\n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 26 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B23,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, Computational Metaphysics, OntologicalArgument},\n  Title =\t {A Simplified Variant of {Gödel's} Ontological Argument},\n  Year =\t 2023,\n  OPTPages =\t {271-286},\n  Doi =          {10.1007/978-3-031-42127-3_19},\n  url_preprint = {https://www.researchgate.net/publication/358607847},\n  Editor =\t {Andrea Vestrucci},\n  booktitle =\t {Beyond Babel: Religions and Linguistic Pluralism},\n  publisher =\t {Springer},\n  address = {Cham},\n  series =       {Sophia Studies in Cross-cultural Philosophy of Traditions and Cultures},\n  volume =       43,\n  year =\t 2023,\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Who Finds the Short Proof?.\n \n \n\n\n \n Benzmüller, C., Fuenmayor, D., Steen, A., & Sutcliffe, G.\n\n\n \n\n\n\n Logic Journal of the IGPL. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"WhoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{J63,\n  author = {Benzmüller, Christoph and Fuenmayor, David and Steen, Alexander and Sutcliffe, Geoff},\n  title =\t {Who Finds the Short Proof?},\n  journal =\t {Logic Journal of the IGPL},\n  publisher = {Oxford University Press},\n  OPTnumber =\t {},\n  OPTvolume =\t {},\n  OPTpages =\t {},\n  doi = {10.1093/jigpal/jzac082},\n  url = {https://www.researchgate.net/publication/367464450_Who_Finds_the_Short_Proof},\n  year =\t 2023,\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Theorem Proving in Dependently-Typed Higher-Order Logic.\n \n \n\n\n \n Rothgang, C., Rabe, F., & Benzmüller, C.\n\n\n \n\n\n\n In Pientka, B., & Tinelli, C., editor(s), Automated Deduction - CADE 29. CADE 2023, volume 14132, of Lecture Notes in Artificial Intelligence, pages 438–455, Cham, 2023. Springer\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{C94,\n  author = {Colin Rothgang and Florian Rabe and Christoph Benzmüller},\n  title =\t {Theorem Proving in Dependently-Typed Higher-Order Logic},\n  booktitle = {Automated Deduction - CADE 29. CADE 2023},\n  editor = {Brigitte Pientka and Cesare Tinelli},\n  publisher = {Springer},\n  address = {Cham},\n  series = {Lecture Notes in Artificial Intelligence},\n  volume = {14132},\n  pages = {438–455},\n  doi =  {10.1007/978-3-031-38499-8_25},\n  year = 2023,\n}\n\n\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n PapagAI: Automated Feedback for Reflective Essays.\n \n \n\n\n \n Solopova, V., Rostom, E., Cremer, F., Gruszczynski, A., Witte, S., Zhang, C., Plößl, L., Romeike, R., Gläser-Zikuda, M., Benzmüller, C., & Landgraf, T.\n\n\n \n\n\n\n In Seipel, D., & Steen, A., editor(s), KI 2023: Advances in Artificial Intelligence – 46th German Conference on Artificial Intelligence, Berlin, Germany, September 26-29, 2023, Proceedings, volume 14236, of Lecture Notes in Artificial Intelligence, pages 198–206, 2023. Springer, Cham\n \n\n\n\n
\n\n\n\n \n \n \"PapagAI:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{C98,\n  Author =\t {Veronika Solopova and Eiad Rostom and Fritz Cremer and Adrian\nGruszczynski and Sascha Witte and Chengming Zhang and Lea Pl{\\"o}{\\ss}l and Ralf Romeike and Michaela Gl{\\"a}ser-Zikuda and Christoph Benzmüller and Tim Landgraf},\n  Title =\t {PapagAI: Automated Feedback for Reflective Essays},\n  Url =       {https://link.springer.com/chapter/10.1007/978-3-031-42608-7_16},\n  Doi =\t\t {10.1007/978-3-031-42608-7_16},\n  Booktitle =\t {{KI} 2023: Advances in Artificial Intelligence --\n                  46th German Conference on Artificial Intelligence,\n                  Berlin, Germany, September 26-29, 2023,\n                  Proceedings},\n  editor =\t {Dietmar Seipel and Alexander Steen},\n  series =\t {Lecture Notes in Artificial Intelligence},\n  volume =\t {14236},\n  pages =\t {198–206},\n  publisher =\t {Springer, Cham},\n  year =\t 2023,\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Solving Modal Logic Problems by Translation to Higher-order Logic.\n \n \n\n\n \n Steen, A., Sutcliffe, G., Scholl, T., & Benzmüller, C.\n\n\n \n\n\n\n In Herzig, A., Luo, J., & Pardo, P., editor(s), Logic and Argumentation, 5th International Conference, CLAR 2023, Hangzhou, China, September 2023, Proceedings, volume 14156, of Lecture Notes in Artificial Intelligence, pages 25-43, 2023. Springer\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{C97,\n  Author =\t {Alexander Steen and  Geoff Sutcliffe and Tobias Scholl and Christoph Benzmüller},\n  Title =\t {Solving Modal Logic Problems by Translation to Higher-order Logic},\n  Booktitle =\t {Logic and Argumentation, 5th International\n                  Conference, CLAR 2023, Hangzhou, China, September 2023, Proceedings},\n  OPTUrl =          {https://link.springer.com/chapter/10.1007/978-3-031-40875-5_3},\t\t  \n  Doi =\t\t {10.1007/978-3-031-40875-5_3},\n  Editor =\t {Andreas Herzig and Jieting Luo and Pere Pardo},\n  Pages =\t {25-43},\n  Publisher =\t {Springer},\n  Series =\t {Lecture Notes in Artificial Intelligence},\n  Volume =\t 14156,\n  Year =\t 2023,\n  addendum =  {Best Paper Award},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Normative Conditional Reasoning as a Fragment of HOL.\n \n \n\n\n \n Parent, X., & Benzmüller, C.\n\n\n \n\n\n\n 2023.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"NormativePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R88arxiv,\n  Author =\t {Xavier Parent and Christoph Benzmüller},\n  Title =\t {Normative Conditional Reasoning as a Fragment of {HOL}},\n  Url =\t\t {https://arxiv.org/abs/2308.10686},\n  Doi =\t\t {10.48550/arXiv.2308.10686},\n  Publisher =\t {arXiv:2308.10686},\n  Note =         {Preprint},\n  Year =\t 2023,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n PapagAI: Automated Feedback for Reflective Essays (Preprint).\n \n \n\n\n \n Solopova, V., Rostom, E., Cremer, F., Gruszczynski, A., Witte, S., Zhang, C., Plößl, L., Romeike, R., Gläser-Zikuda, M., Benzmüller, C., & Landgraf, T.\n\n\n \n\n\n\n 2023.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"PapagAI:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R87arxiv,\n  Author =\t {Veronika Solopova and Eiad Rostom and Fritz Cremer and Adrian\nGruszczynski and Sascha Witte and Chengming Zhang and Lea Pl{\\"o}{\\ss}l and Ralf Romeike and Michaela Gl{\\"a}ser-Zikuda and Christoph Benzmüller and Tim Landgraf},\n  Title =\t {PapagAI: Automated Feedback for Reflective Essays (Preprint)},\n  Url =\t\t {https://arxiv.org/abs/2307.07523},\n  Doi =\t\t {10.48550/arXiv.2307.07523},\n  publisher =\t {arXiv:2307.07523},\n  note =         {Preprint},\n  year =\t 2023,\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Reasonable, Trusted AI through Symbolic Ethico-legal Control and Reflection? (Keynote Abstract).\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Proceedings of FLAIRS-36, May 14-17, 2023, Clearwater Beach, FL, volume 2023, Florida, 2023. LibraryPress@UF\n \n\n\n\n
\n\n\n\n \n \n \"Reasonable,Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{C96,\n\tauthor = {Christoph Benzmüller},\n\ttitle = {Reasonable, Trusted AI through Symbolic Ethico-legal Control and Reflection? (Keynote Abstract)},\n\tyear = {2023},\n\tpublisher = {LibraryPress@UF},\n\taddress = {Florida},\n\tjournal = {The Florida Artificial Interlligence Research Society},\n\tvolume = {2023},\n\tnumber = {36},\n\tbooktitle = {Proceedings of FLAIRS-36, May 14-17, 2023, Clearwater Beach, FL},\t\n\turl = {https://journals.flvc.org/FLAIRS/article/view/133952/137945},\n\turl = {https://fis.uni-bamberg.de/handle/uniba/59598},\n\tdoi = {10.32473/flairs.36},\n\tissn = {2334-0762},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation – Preprint.\n \n \n\n\n \n Bayer, J., Gonus, A., Benzmüller, C., & Scott, D. S.\n\n\n \n\n\n\n 2023.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"CategoryPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R86arxiv,\n  OPTdoi = {10.48550/arXiv.2305.15382},\n  url =\t\t {https://arxiv.org/abs/2306.09074},\n  author = {Jonas Bayer and Aleksey Gonus and Christoph Benzmüller and Dana S. Scott},\n  Title =\t {Category Theory in {Isabelle/HOL} as a Basis for Meta-logical Investigation -- Preprint},\n  publisher =\t {arXiv:2306.09074},\n  note =         {Preprint},\n  year =\t 2023,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation.\n \n \n\n\n \n Bayer, J., Gonus, A., Benzmüller, C., & Scott, D. S.\n\n\n \n\n\n\n In Dubois, C., & Kerber, M., editor(s), Intelligent Computer Mathematics - International Conference, CICM 2023, September 4–8, 2023, Cambridge, UK, Proceedings, volume 14101, of Lecture Notes in Computer Science, pages 69–83, 2023. Springer\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{C95,\n  Author =\t {Jonas Bayer and Aleksey Gonus and Christoph Benzmüller and Dana S. Scott},\n  Title =\t {Category Theory in {Isabelle/HOL} as a Basis for Meta-logical Investigation},\n  Booktitle =\t {Intelligent Computer Mathematics - International\n                  Conference, {CICM} 2023, September 4–8, 2023, Cambridge, UK, Proceedings},\n  Doi =\t\t {10.1007/978-3-031-42753-4_5},\n  Editor =\t {Catherine Dubois and Manfred Kerber},\n  Pages =\t {69–83},\n  Publisher =\t {Springer},\n  Series =\t {Lecture Notes in Computer Science},\n  Volume =\t 14101,\n  Year =\t 2023,\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Theorem Proving in Dependently-Typed Higher-Order Logic – Extended Preprint.\n \n \n\n\n \n Rothgang, C., Rabe, F., & Benzmüller, C.\n\n\n \n\n\n\n 2023.\n Extended Preprint\n\n\n\n
\n\n\n\n \n \n \"TheoremPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R85arxiv,\n  doi = {10.48550/arXiv.2305.15382},\n  url =\t\t {https://arxiv.org/abs/2305.15382},\n  author = {Colin Rothgang and Florian Rabe and Christoph Benzmüller},\n  title =\t {Theorem Proving in Dependently-Typed Higher-Order Logic -- Extended Preprint},\n  publisher =\t {arXiv:2305.15382},\n  note =         {Extended Preprint},\n  year =\t 2023,\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Mathematical Proof Assistants for Teaching Logic: The LogiKEy Methodology.\n \n \n\n\n \n Benzmüller, C., & Fuenmayor, D.\n\n\n \n\n\n\n In Book of Abstracts — V Congress Tools for Teaching Logic, Madrid, Spain, March 23-24 2023, 2023. \n \n\n\n\n
\n\n\n\n \n \n \"MathematicalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{C93,\n  Author =\t {Christoph Benzm{\\"u}ller and David Fuenmayor},\n  Title =\t {Mathematical Proof Assistants for Teaching Logic: The LogiKEy Methodology},\n  Booktitle =\t {Book of Abstracts --- V Congress Tools for Teaching Logic},\n  year =\t 2023,\n  Address =\t {Madrid, Spain, March 23-24 2023},\n  Url =          {https://www.researchgate.net/publication/371044093}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The evolution of Pro-Kremlin propaganda from Machine Learning and linguistic perspective.\n \n \n\n\n \n Solopova, V., Benzmüller, C., & Landgraf, T.\n\n\n \n\n\n\n In Romanyshyn, M., editor(s), Proceedings of the Second Ukrainian Natural Language Processing Workshop (UNLP 2023), pages 40-48, 2023. Association for Computational Linguistics\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W68,\n  keywords =\t {own, Normative Reasoning, Machine Ethics},\n  author =\t {Veronica Solopova and Christoph Benzm{\\"u}ller and Tim Landgraf},\n  editor =       {Romanyshyn, Mariana},\n  booktitle =\t {Proceedings of the Second Ukrainian Natural Language Processing Workshop (UNLP 2023)},\n  title =\t {The evolution of Pro-Kremlin propaganda from Machine Learning and linguistic perspective},\n  publisher = {Association for Computational Linguistics},\n  doi = {10.18653/v1/2023.unlp-1.5},\n  year      = {2023},\n  isbn    = {978-1-959429-52-4},\n  pages  = {40-48},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automated multilingual detection of Pro-Kremlin propaganda in newspapers and Telegram posts.\n \n \n\n\n \n Solopova, V., Popescu, O., Benzmüller, C., & Landgraf, T.\n\n\n \n\n\n\n Datenbank Spektrum, 23(1): 5-14. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"AutomatedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{J65,\n  author = {Solopova, Veronika  and Popescu, Oana-Iuliana and Benzm{\\"u}ller, Christoph and Landgraf, Tim},\n  title = {Automated multilingual detection of {Pro-Kremlin} propaganda in newspapers and {Telegram} posts},\n  journal = {Datenbank Spektrum},\n  publisher = {Springer},\n  volume = {23},\n  number = {1},\n  pages = {5-14},\n  year =\t 2023,\n  doi = {10.1007/s13222-023-00437-2},\n  url = {https://link.springer.com/article/10.1007/s13222-023-00437-2},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automated multilingual detection of Pro-Kremlin propaganda in newspapers and Telegram posts.\n \n \n\n\n \n Solopova, V., Popescu, O., Benzmüller, C., & Landgraf, T.\n\n\n \n\n\n\n 2023.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"AutomatedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R84arxiv,\n  author =\t {Solopova, Veronika and Popescu, Oana-Iuliana  and Benzm{\\"u}ller, Christoph and Landgraf, Tim},\n  title =\t {Automated multilingual detection of {Pro-Kremlin} propaganda in newspapers and {Telegram} posts},\n  publisher =\t {arXiv:2301.10604},\n  note =         {Preprint},\n  year =\t 2023,\n  doi = {10.48550/arXiv.2301.10604},\n  url =\t\t {https://arxiv.org/abs/2301.10604},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Preface: Special Issue on Logic and Argumentation.\n \n \n\n\n \n Baroni, P., Benzmüller, C., & N Wáng, Y.\n\n\n \n\n\n\n Journal of Logic and Computation, 33(2). 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Preface:Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J64,\n  keywords =\t {own, Argumentation, Logic},\n    author = {Baroni, Pietro and Benzmüller, Christoph and N Wáng, Yì},\n    title = {Preface: Special Issue on Logic and Argumentation},\n    journal = {Journal of Logic and Computation},\n    volume = {33},\n    number = {2},\n    page = {189-191},\n    year = {2023},\n    issn = {0955-792X},\n    doi = {10.1093/logcom/exac091},\n    url = {https://doi.org/10.1093/logcom/exac091},\n    OPTeprint = {https://academic.oup.com/logcom/advance-article-pdf/doi/10.1093/logcom/exac091/48747721/exac091.pdf},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Special Issue on Logic and Argumentation.\n \n \n\n\n \n Baroni, P., Benzmüller, C., & N Wáng, Y.,\n editors.\n \n\n\n \n\n\n\n Journal of Logic and Computation. Oxford University Press, 2023.\n \n\n\n\n
\n\n\n\n \n \n \"SpecialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@book{E28,\n  Keywords =\t {own, Argumentation, Logic},\n  editor =\t {Baroni, Pietro and Benzmüller, Christoph and N Wáng, Yì},\n  title =\t {Special Issue on Logic and Argumentation},\n  publisher =\t {Journal of Logic and Computation. Oxford University Press},\n  year =\t 2023,\n  url = {https://academic.oup.com/logcom/issue/33/2},\n  doi =          {10.1093/logcom/exac091},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n On Gödel and the Nonexistence of Time – Gödel und die Nichtexistenz der Zeit.\n \n \n\n\n \n Passon, O., Benzmüller, C., & Falkenburg, B.,\n editors.\n \n\n\n \n\n\n\n Springer Spektrum Berlin, Heidelberg, 2023.\n \n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n \n \"On website\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@book{E27,\n  Keywords =\t {own, Kurt Goedel, Philosophy, Physics},\n  editor =\t {Oliver Passon and Christoph Benzm{\\"u}ller and Brigitte Falkenburg},\n  title =\t {On Gödel and the Nonexistence of Time – Gödel und die Nichtexistenz der Zeit},\n  publisher =\t {Springer Spektrum Berlin},\n  address = {Heidelberg},\n  year =\t 2023,\n  pages =\t {1-153},\n  isbn = {978-3-662-67044-6},\n  doi = {10.1007/978-3-662-67045-3},\n  url =\t {https://link.springer.com/book/9783662670446},\n  url_website =\t {https://kurtgoedel.de/press-release-2021/},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n ARQNL 2022: Automated Reasoning in Quantified Non-Classical Logics. Proceedings of the 4th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2022) affiliated with the 11th International Joint Conference on Automated Reasoning (IJCAR 2022). Haifa, Israel, August 11, 2022.\n \n \n\n\n \n Benzmüller, C., & Otten, J.\n\n\n \n\n\n\n Volume 3326 CEUR Workshop Proceedings, CEUR-WS.org, 2023.\n \n\n\n\n
\n\n\n\n \n \n \"ARQNLPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@book{E29,\n  Keywords =\t {own, Quantified Non-Classical Logics},\n  Author =\t {Christoph Benzm{\\"u}ller and Jens Otten},\n  Title =\t {ARQNL 2022: Automated Reasoning in Quantified Non-Classical Logics. Proceedings of the 4th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2022) affiliated with the 11th International Joint Conference on Automated Reasoning (IJCAR 2022). Haifa, Israel, August 11, 2022},\n  publisher = {{CEUR} Workshop Proceedings, CEUR-WS.org},\n  volume = {3326},\n  year      = {2023},\n  url       = {https://ceur-ws.org/Vol-3326},\n  urn = {urn:nbn:de:0074-3326-4},\n  issn = {1613-0073},\n  pages =        {1-108},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automated Verification of Deontic Correspondences in Isabelle/HOL – First Results.\n \n \n\n\n \n Parent, X., & Benzmüller, C.\n\n\n \n\n\n\n In Benzmüller, C., & Otten, J., editor(s), ARQNL 2022: Automated Reasoning in Quantified Non-Classical Logics. Proceedings of the 4th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2022) affiliated with the 11th International Joint Conference on Automated Reasoning (IJCAR 2022). Haifa, Israel, August 11, 2022, volume 3326, pages 92-108, 2023. CEUR Workshop Proceedings, CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"AutomatedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W67,\n  Keywords =\t {own, Normative Reasoning, Machine Ethics},\n  Author =\t {Xavier Parent and Christoph Benzm{\\"u}ller},\n  Editor =       {Christoph Benzm{\\"u}ller and Jens Otten},\n  booktitle =\t {ARQNL 2022: Automated Reasoning in Quantified Non-Classical Logics. Proceedings of the 4th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2022) affiliated with the 11th International Joint Conference on Automated Reasoning (IJCAR 2022). Haifa, Israel, August 11, 2022},\n  Title =\t {Automated Verification of Deontic Correspondences in\n                  {Isabelle/HOL} -- First Results},\n  publisher = {{CEUR} Workshop Proceedings, CEUR-WS.org},\n  volume = {3326},\n  year      = {2023},\n  url       = {https://ceur-ws.org/Vol-3326/},\n  urn = {urn:nbn:de:0074-3326-4},\n  issn = {1613-0073},\n  pages =        {92-108},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automating Public Announcement Logic with Relativized Common Knowledge as a Fragment of HOL in LogiKEy.\n \n \n\n\n \n Benzmüller, C., & Reiche, S.\n\n\n \n\n\n\n Journal of Logic and Computation, 33(6): 1243–1269. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Automating preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J58,\n  Author =\t {Christoph Benzm{\\"u}ller and Sebastian Reiche},\n  Journal =\t {Journal of Logic and Computation},\n  Keywords =\t {own, Artificial Intelligence, Non-Classical Logics,\n                  Semantical Embedding, Common Knowledge},\n  Title =\t {Automating Public Announcement Logic with\n                  Relativized Common Knowledge as a Fragment of {HOL} in\n                  {LogiKEy}},\n  Year =\t 2023,\n  Volume = {33},\n  Number = {6},\n  Pages =\t {1243–1269},\n  url_preprint = {https://www.researchgate.net/publication/355872829},\n  OPTurl =          {https://doi.org/10.1093/logcom/exac029},\n  doi =\t\t {10.1093/logcom/exac029}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (11)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Automation of Boolos' Curious Inference in Isabelle/HOL.\n \n \n\n\n \n Benzmüller, C., Fuenmayor, D., Steen, A., & Sutcliffe, G.\n\n\n \n\n\n\n Archive of Formal Proofs, 2022. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"AutomationPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{J63afp,\n author       = {Christoph Benzm{\\"{u}}ller and\n                  David Fuenmayor and\n                  Alexander Steen and\n                  Geoff Sutcliffe},\n  title        = {Automation of Boolos' Curious Inference in Isabelle/HOL},\n  journal      = {Archive of Formal Proofs},\n  volume       = {2022},\n  year         = {2022},\n  url          = {https://www.isa-afp.org/entries/Boolos\\_Curious\\_Inference\\_Automated.html},\n  }\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Solving QMLTP Problems by Translation to Higher-order Logic.\n \n \n\n\n \n Steen, A., Sutcliffe, G., Gleißner, T., & Benzmüller, C.\n\n\n \n\n\n\n 2022.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"SolvingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R83arxiv,\n  doi = {10.48550/arXiv.2212.09570},\n  url =\t\t {https://arxiv.org/abs/2212.09570},\n  author = {Steen, Alexander and Sutcliffe, Geoff and Glei{\\ss}ner, Tobias and Benzmüller, Christoph},\n  title =\t {Solving QMLTP Problems by Translation to Higher-order Logic},\n  publisher =\t {arXiv:2212.09570},\n  note =         {Preprint},\n  year =\t 2022,\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Who Finds the Short Proof? An Exploration of Variants of Boolos' Curious Inference using Higher-order Automated Theorem Provers.\n \n \n\n\n \n Benzmüller, C., Fuenmayor, D., Steen, A., & Sutcliffe, G.\n\n\n \n\n\n\n 2022.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"WhoPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{J63arxiv,\n  doi = {10.48550/arXiv.2208.06879},\n  url =\t\t {https://arxiv.org/abs/2208.06879},\n  author = {Benzmüller, Christoph and Fuenmayor, David and Steen, Alexander and Sutcliffe, Geoff},\n  title =\t {Who Finds the Short Proof? An Exploration of Variants of Boolos' Curious Inference using Higher-order Automated Theorem Provers},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2022,\n}\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Mathematical Proof Between Generations.\n \n \n\n\n \n Bayer, J., Benzmüller, C., Buzzard, K., David, M., Lamport, L., Matiyasevich, Y., Paulson, L., Schleicher, D., Stock, B., & Zelmanov, E.\n\n\n \n\n\n\n 2022.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"MathematicalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 9 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@misc{J62arxiv,\n  doi =\t\t {10.48550/ARXIV.2207.04779},\n  url =\t\t {https://arxiv.org/abs/2207.04779},\n  author =\t {Bayer, Jonas and Benzm{\\"u}ller, Christoph and\n                  Buzzard, Kevin and David, Marco and Lamport, Leslie\n                  and Matiyasevich, Yuri and Paulson, Lawrence and\n                  Schleicher, Dierk and Stock, Benedikt and Zelmanov,\n                  Efim},\n  keywords =\t {History and Overview (math.HO), FOS: Mathematics,\n                  FOS: Mathematics},\n  title =\t {Mathematical Proof Between Generations},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2022,\n  copyright =\t {arXiv.org perpetual, non-exclusive license},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Collaborative Speculations on Future Themes for Participatory Design in Germany.\n \n \n\n\n \n Mucha, H., de Barros, A. C., Benjamin, J. J., Benzmüller, C., Bischof, A., Buchmüller, S., de Carvalho, A., Dhungel, A., Draude, C., Fleck, M., Jarke, J., Klein, S., Kortekaas, C., Kurze, A., Linke, D., Maas, F., Marsden, N., Melo, R., Michel, S., Müller-Birn, C., Pröbster, M., Rießenberger, K. A., Schäfer, M. T., Sörries, P., Stilke, J., Volkmann, T., Weibert, A., Weinhold, W., Wolf, S., Zorn, I., Heidt, M., & Berger, A.\n\n\n \n\n\n\n i-com, 21(2): 283–298. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"CollaborativePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{J61,\n  author =\t {Henrik Mucha and Ana Correia de Barros and Jesse\n                  Josua Benjamin and Christoph Benzmüller and Andreas\n                  Bischof and Sandra Buchmüller and Alexandra de\n                  Carvalho and Anna-Katharina Dhungel and Claude\n                  Draude and Marc-Julian Fleck and Juliane Jarke and\n                  Stefanie Klein and Caroline Kortekaas and Albrecht\n                  Kurze and Diane Linke and Franzisca Maas and Nicola\n                  Marsden and Ricardo Melo and Susanne Michel and\n                  Claudia Müller-Birn and Monika Pröbster and Katja\n                  Antonia Rießenberger and Mirko Tobias Schäfer and\n                  Peter Sörries and Julia Stilke and Torben Volkmann\n                  and Anne Weibert and Wilhelm Weinhold and Sara Wolf\n                  and Isabel Zorn and Michael Heidt and Arne Berger},\n  doi =\t\t {doi:10.1515/icom-2021-0030},\n  url =\t\t {https://doi.org/10.1515/icom-2021-0030},\n  title =\t {Collaborative Speculations on Future Themes for\n                  Participatory Design in Germany},\n  journal =\t {i-com},\n  number =\t 2,\n  volume =\t 21,\n  year =\t 2022,\n  pages =\t {283--298},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Symbolic AI and Gödel's Ontological Argument.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Zygon(r), 57: 953-962. 2022.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@article{J60,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Journal =\t {Zygon(r)},\n  Keywords =\t {Artificial Intelligence, Ontological Argument},\n  Title =\t {Symbolic {AI} and {Gödel's} Ontological Argument},\n  Year =\t 2022,\n  Issn =         {05912385, 14679744},\n  Volume =       {57},\n  Issue =        {4},\n  pages =\t {953-962},\n  OPTurl = {https://onlinelibrary.wiley.com/doi/abs/10.1111/zygo.12830},\n  OPTeprint = {https://onlinelibrary.wiley.com/doi/pdf/10.1111/zygo.12830},\n  doi =       {10.1111/zygo.12830}\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automated Reasoning in Non-classical Logics in the TPTP World.\n \n \n\n\n \n Steen, A., Fuenmayor, D., Gleißner, T., Sutcliffe, G., & Benzmüller, C.\n\n\n \n\n\n\n In Konev, B., Schon, C., & Steen, A., editor(s), Proceedings of the Workshop on Practical Aspects of Automated Reasoning Co-located with the 11th International Joint Conference on Automated Reasoning (FLoC/IJCAR 2022), Haifa, Israel, August, 11 - 12, 2022, volume 3201, of CEUR Workshop Proceedings, 2022. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"AutomatedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W66,\n  author    = {Alexander Steen and\n               David Fuenmayor and\n               Tobias Glei{\\ss}ner and\n               Geoff Sutcliffe and\n               Christoph Benzm{\\"{u}}ller},\n  editor    = {Boris Konev and\n               Claudia Schon and\n               Alexander Steen},\n  title     = {Automated Reasoning in Non-classical Logics in the {TPTP} World},\n  booktitle = {Proceedings of the Workshop on Practical Aspects of Automated Reasoning\n               Co-located with the 11th International Joint Conference on Automated\n               Reasoning (FLoC/IJCAR 2022), Haifa, Israel, August, 11 - 12, 2022},\n  series    = {{CEUR} Workshop Proceedings},\n  volume    = {3201},\n  publisher = {CEUR-WS.org},\n  year      = {2022},\n  url       = {http://ceur-ws.org/Vol-3201/paper11.pdf},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automated Reasoning in Non-classical Logics in the TPTP World.\n \n \n\n\n \n Steen, A., Fuenmayor, D., Gleißner, T., Sutcliffe, G., & Benzmüller, C.\n\n\n \n\n\n\n 2022.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"AutomatedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{W66arxiv,\n  doi = {10.48550/arXiv.2202.09836},\n  url =\t\t {https://arxiv.org/abs/2202.09836},\n  author    = {Alexander Steen and\n               David Fuenmayor and\n               Tobias Glei{\\ss}ner and\n               Geoff Sutcliffe and\n               Christoph Benzm{\\"{u}}ller},\n  title     = {Automated Reasoning in Non-classical Logics in the {TPTP} World},\n  year      = {2022},\n  url       = {https://arxiv.org/abs/2202.09836},\n  publisher = {arXiv},\n  note =      {Preprint},\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Higher-order Logic as a Lingua Franca for Logico-Pluralist Argumentation.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n In Liao, B., Markovich, R., & Wáng, Y. N., editor(s), Logics for New-Generation AI. Second International Workshop. 10-12 June 2022, Zhuhai, pages 83-94, 2022. College Publications\n \n\n\n\n
\n\n\n\n \n \n \"Higher-orderPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W65,\n  Keywords =\t {own, Normative Reasoning, Machine Ethics},\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Editor =\t {Beishui Liao and Reka Markovich and W\\'ang, Y\\`i N.},\n  Booktitle =\t {Logics for New-Generation AI. Second International\n                  Workshop. 10-12 June 2022, Zhuhai},\n  Title =\t {Higher-order Logic as a Lingua Franca for\n                  Logico-Pluralist Argumentation},\n  pages =\t {83-94},\n  isbn =\t {978-1-84890-406-4},\n  publisher =\t {College Publications},\n  url =\n                  {http://www.collegepublications.co.uk/downloads/LNGAI00002.pdf},\n  Year =\t 2022,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Simplified Variant of Gödel's Ontological Argument.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n 2022.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 13 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{B23arxiv,\n  doi =\t\t {10.48550/ARXIV.2202.06264},\n  url =\t\t {https://arxiv.org/abs/2202.06264},\n  author =\t {Benzm{\\"u}ller, Christoph},\n  title =\t {A Simplified Variant of Gödel's Ontological\n                  Argument},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2022,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Dyadic Deontic Logic in HOL: Faithful Embedding and Meta-Theoretical Experiments.\n \n \n\n\n \n Benzmüller, C., Farjami, A., & Parent, X.\n\n\n \n\n\n\n In Rahman, S., Armgardt, M., Kvernenes, N., & Christian, H., editor(s), New Developments in Legal Reasoning and Logic: From Ancient Law to Modern Legal Systems, volume 23, of Logic, Argumentation & Reasoning. Springer Nature Switzerland AG, 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Dyadic preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 23 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B22,\n  Keywords =\t {own, Higher Order Logic, Deontic Logic, Automated\n                  Reasoning, Universal Reasoning},\n  Author =\t {Benzm{\\"u}ller, Christoph and Farjami, Ali and\n                  Parent, Xavier},\n  editor =\t {Shahid Rahman and Matthias Armgardt and Nordtveit\n                  Kvernenes and Hans Christian},\n  booktitle =\t {New Developments in Legal Reasoning and Logic: From\n                  Ancient Law to Modern Legal Systems},\n  series =\t {Logic, Argumentation \\& Reasoning},\n  title =\t {Dyadic Deontic Logic in {HOL}: Faithful Embedding and\n                  Meta-Theoretical Experiments},\n  volume =\t 23,\n  publisher =\t {Springer Nature Switzerland AG},\n  year =\t 2022,\n  doi =\t\t {10.1007/978-3-030-70084-3_14},\n  url_preprint = {https://doi.org/10.13140/RG.2.2.35175.88487},\n  isbn =\t {978-3-030-70083-6},\n  issn =\t {2214-9120},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (10)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Automating Public Announcement Logic with Relativized Common Knowledge as a Fragment of HOL in LogiKEy.\n \n \n\n\n \n Benzmüller, C., & Reiche, S.\n\n\n \n\n\n\n 2021.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"AutomatingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{J58arxiv,\n  doi =\t\t {10.48550/ARXIV.2111.01654},\n  url =\t\t {https://arxiv.org/abs/2111.01654},\n  author =\t {Benzm{\\"u}ller, Christoph and Reiche, Sebastian},\n  title =\t {Automating Public Announcement Logic with\n                  Relativized Common Knowledge as a Fragment of {HOL} in\n                  {LogiKEy}},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2021,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A German Corpus of Reflective Sentences.\n \n \n\n\n \n Solopova, V., Popescu, O., Chikobava, M., Romeike, R., Landgraf, T., & Benzmüller, C.\n\n\n \n\n\n\n In Bandyopadhyay, S., Devi, S. L., & Bhattacharyya, P., editor(s), Proceedings of the 18th International Conference on Natural Language Processing (ICON), pages 593–600, National Institute of Technology Silchar, Silchar, India, December 2021. NLP Association of India (NLPAI)\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{C92,\n  author =\t {Solopova, Veronika  and\n      Popescu, Oana-Iuliana  and\n      Chikobava, Margarita  and\n      Romeike, Ralf  and\n      Landgraf, Tim  and\n      Benzm{\\"u}ller, Christoph},\n  editor =\t {Bandyopadhyay, Sivaji and Devi, Sobha Lalitha and Bhattacharyya, Pushpak},\n  title =\t {A {G}erman Corpus of Reflective Sentences},\n  booktitle =\t {Proceedings of the 18th International Conference on Natural Language Processing (ICON)},\n    month = dec,\n    year = 2021,\n    address = {National Institute of Technology Silchar, Silchar, India},\n    publisher = {NLP Association of India (NLPAI)},\n    url = "https://aclanthology.org/2021.icon-main.72",\n    pages = "593--600",\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automating Public Announcement Logic and the Wise Men Puzzle in Isabelle/HOL.\n \n \n\n\n \n Benzmüller, C., & Reiche, S.\n\n\n \n\n\n\n Archive of Formal Proofs,1-5. 2021.\n Note: data publication\n\n\n\n
\n\n\n\n \n \n \"AutomatingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J56,\n  Author =\t {Christoph Benzm{\\"u}ller and Sebastian Reiche},\n  Journal =\t {Archive of Formal Proofs},\n  Keywords =\t {own, Artificial Intelligence, Non-Classical Logics,\n                  Semantical Embedding, Common Knowledge},\n  Note =\t {Note: data publication},\n  Title =\t {Automating Public Announcement Logic and the Wise\n                  Men Puzzle in {Isabelle/HOL}},\n  Url =\t\t {https://www.isa-afp.org/entries/PAL.html},\n  Year =\t 2021,\n  Pages =\t {1-5},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Value-oriented Legal Argumentation in Isabelle/HOL.\n \n \n\n\n \n Benzmüller, C., & Fuenmayor, D.\n\n\n \n\n\n\n In Cohen, L., & Kaliszyk, C., editor(s), International Conference on Interactive Theorem Proving (ITP), Proceedings, volume 193, of LIPIcs, pages 23:1-23:18, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"Value-oriented preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C91,\n  Keywords =\t {own, Ethical and Legal Reasoning},\n  Author =\t {Benzm{\\"u}ller, Christoph and Fuenmayor, David},\n  Editor =\t {Liron Cohen and Cezary Kaliszyk},\n  doi =\t\t {10.4230/LIPIcs.ITP.2021.7},\n  Title =\t {Value-oriented Legal Argumentation in\n                  {Isabelle/HOL}},\n  Booktitle =\t {{International Conference on Interactive Theorem\n                  Proving (ITP), Proceedings}},\n  series =\t {LIPIcs},\n  volume =\t 193,\n  number =\t 23,\n  pages =\t {23:1-23:18},\n  publisher =\t {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r\n                  Informatik},\n  url_preprint = {https://dx.doi.org/10.13140/RG.2.2.21514.80320},\n  Year =\t 2021,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Cantor's Theorem without Reductio Ad Absurdum.\n \n \n\n\n \n Benzmüller, C., & Fuenmayor, D.\n\n\n \n\n\n\n 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Cantor's preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R82,\n  Keywords =\t {own, Logic, Mathematics, Set Theory},\n  Author =\t {Benzm{\\"u}ller, Christoph and Fuenmayor, David},\n  doi =\t\t {10.13140/RG.2.2.31069.95201/1},\n  Title =\t {Cantor's Theorem without Reductio Ad Absurdum},\n  url_preprint = {https://dx.doi.org/10.13140/RG.2.2.31069.95201/1},\n  Year =\t 2021,\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Wider den Reduktionismus – Ausgewählte Beiträge zum Kurt Gödel Preis 2019.\n \n \n\n\n \n Passon, O., & Benzmüller, C.,\n editors.\n \n\n\n \n\n\n\n Springer Spektrum, 2021.\n \n\n\n\n
\n\n\n\n \n \n \"WiderPaper\n  \n \n \n \"Wider website\n  \n \n \n \"Wider preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@book{E26,\n  Keywords =\t {own, Kurt Goedel, Reductionism, Philosophy, Physics},\n  editor =\t {Oliver Passon and Christoph Benzm{\\"u}ller},\n  title =\t {Wider den Reduktionismus -- Ausgewählte Beiträge zum\n                  Kurt Gödel Preis 2019},\n  publisher =\t {Springer Spektrum},\n  year =\t 2021,\n  pages =\t {1--150},\n  isbn =\t {978-3-662-63187-4},\n  doi =\t\t {10.1007/978-3-662-63187-4},\n  url =\t\t {https://www.springer.com/de/book/9783662631867},\n  url_website =\t {https://kurtgoedel.de/kurt-goedel-prize-2019/},\n  url_preprint = {https://www.researchgate.net/publication/349493659},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Logic and Argumentation, 4th International Conference, CLAR 2021, Hangzhou, China, October 20–22, 2021, Proceedings.\n \n \n\n\n \n Baroni, P., Benzmüller, C., & Wáng, Y. N.,\n editors.\n \n\n\n \n\n\n\n of Lecture Notes in Artificial Intelligence.Springer. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"LogicPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Proceedings{E25,\n  Keywords =\t {own, Argumentation, Logic},\n  editor =\t {Pietro Baroni and Christoph Benzm{\\"u}ller and\n                  W\\'ang, Y\\`i N.},\n  title =\t {Logic and Argumentation, 4th International\n                  Conference, CLAR 2021, Hangzhou, China, October\n                  20–22, 2021, Proceedings},\n  series =\t {Lecture Notes in Artificial Intelligence},\n  publisher =\t {Springer},\n  year =\t 2021,\n  pages =\t {1-552},\n  url =          {https://link.springer.com/book/10.1007/978-3-030-89391-0},\n  doi =\t\t {10.1007/978-3-030-89391-0},\n  isbn =\t {978-3-030-89390-3},\n  issn =\t {0302-9743}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers from the 2nd International Joint Conference on Rules and Reasoning (RuleML+RR 2018).\n \n \n\n\n \n Benzmüller, C., Parent, X., & Ricca, F.\n\n\n \n\n\n\n Theory and Practice of Logic Programmming, 21(1): 1–3. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"IntroductionPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{J54,\n  author =\t {Christoph Benzm{\\"{u}}ller and Xavier Parent and\n                  Francesco Ricca},\n  title =\t {Introduction to the Special Issue on Logic Rules and\n                  Reasoning: Selected Papers from the 2nd\n                  International Joint Conference on Rules and\n                  Reasoning (RuleML+RR 2018)},\n  journal =\t {Theory and Practice of Logic Programmming},\n  volume =\t 21,\n  number =\t 1,\n  pages =\t {1--3},\n  year =\t 2021,\n  url =\t\t {https://doi.org/10.1017/S1471068420000113},\n  doi =\t\t {10.1017/S1471068420000113},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automating Public Announcement Logic with Relativized Common Knowledge as a Fragment of HOL in LogiKEy.\n \n \n\n\n \n Benzmüller, C., & Reiche, S.\n\n\n \n\n\n\n Technical Report arXiv:2111.01654, CoRR, 2021.\n \n\n\n\n
\n\n\n\n \n \n \"AutomatingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@techreport{R78,\n  Author =\t {Benzm{\\"u}ller, Christoph and Reiche, Sebastian},\n  Keywords =\t {own, Higher Order Logic, Hintikka Sets, Completeness\n                  Proofs},\n  Title =\t {Automating Public Announcement Logic with\n                  Relativized Common Knowledge as a Fragment of {HOL} in\n                  {LogiKEy}},\n  Institution =\t {CoRR},\n  Number =\t {arXiv:2111.01654},\n  eprint =\t {2111.01654},\n  Url =\t\t {https://arxiv.org/abs/2111.01654},\n  Year =\t 2021\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Extensional Higher-Order Paramodulation in Leo-III.\n \n \n\n\n \n Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n Journal of Automated Reasoning, 65(6): 775–807. 2021.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{J51,\n  Author =\t {Steen, Alexander and Benzm{\\"u}ller, Christoph},\n  title =\t {Extensional Higher-Order Paramodulation in {Leo-III}},\n  journal =\t {Journal of Automated Reasoning},\n  volume    = {65},\n  number    = {6},\n  pages     = {775--807},\n  year      = {2021},\n  OPTurl       = {https://doi.org/10.1007/s10817-021-09588-x},\n  doi       = {10.1007/s10817-021-09588-x}\n}\n\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (24)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Modelling Value-oriented Legal Reasoning in LogiKEy.\n \n \n\n\n \n Benzmüller, C., Fuenmayor, D., & Lomfeld, B.\n\n\n \n\n\n\n 2020.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"ModellingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{J59arxiv,\n  doi =\t\t {10.48550/ARXIV.2006.12789},\n  url =\t\t {https://arxiv.org/abs/2006.12789},\n  author =\t {Benzm{\\"u}ller, Christoph and Fuenmayor, David and\n                  Lomfeld, Bertram},\n  title =\t {Modelling Value-oriented Legal Reasoning in LogiKEy},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2020,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n KI als Laboratorium? Ethik als Aufgabe!.\n \n \n\n\n \n Ammon, S., Beck, B., Benzmüller, C., Burchardt, A., Heidingsfelder, M. L., Kaiser, S., Lomfeld, B., Mühlhoff, R., Remmers, P., & Schraudner, M.,\n editors.\n \n\n\n \n\n\n\n of #VerantwortungKI - Künstliche Intelligenz und gesellschaftliche FolgenInterdisziplinäre Arbeitsgruppe Verantwortung: Maschinelles Lernen und Künstliche Intelligenz, 2020.\n \n\n\n\n
\n\n\n\n \n \n \"KIPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@book{E24,\n  Keywords =\t {own, AI, Ethics},\n  editor =\t {Sabine Ammon and Birgit Beck and Christoph\n                  Benzm{\\"u}ller and Aljoscha Burchardt and Marie Lena\n                  Heidingsfelder and Simone Kaiser and Bertram Lomfeld\n                  and Rainer M{\\"u}hlhoff and Peter Remmers and\n                  Martina Schraudner},\n  title =\t {KI als Laboratorium? Ethik als Aufgabe!},\n  isbn =\t {978-3-939818-93-9},\n  publisher =\t {Interdisziplin{\\"a}re Arbeitsgruppe Verantwortung:\n                  Maschinelles Lernen und K{\\"u}nstliche Intelligenz},\n  series =\t {\\#VerantwortungKI - K{\\"u}nstliche Intelligenz und\n                  gesellschaftliche Folgen},\n  number =\t 3,\n  pages =\t 52,\n  year =\t 2020,\n  url =          {https://edoc.bbaw.de/frontdoor/index/index/docId/3449}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Träumen vernünftige Maschinen von Gründen? Eine reale Utopie.\n \n \n\n\n \n Benzmüller, C., & Lomfeld, B.\n\n\n \n\n\n\n VerantwortungKI – Künstliche Intelligenz und gesellschaftliche Folgen (Berlin-Brandenburgische Akademie der Wissenschaften), 3. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"TräumenPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{J55,\n  keywords =\t {own, Artificial Intelligence, Ethical and Legal\n                  Issues},\n  title =\t {Tr{\\"a}umen vernünftige Maschinen von Gr{\\"u}nden?\n                  Eine reale Utopie},\n  author =\t {Christoph Benzm{\\"u}ller and Bertram Lomfeld},\n  journal =\t {VerantwortungKI – Künstliche Intelligenz und\n                  gesellschaftliche Folgen (Berlin-Brandenburgische\n                  Akademie der Wissenschaften)},\n  publisher =\t {Interdisziplinäre Arbeitsgruppe Verantwortung:\n                  Maschinelles Lernen und Künstliche Intelligenz der\n                  Berlin-Brandenburgischen Akademie der\n                  Wissenschaften},\n  volume =\t 3,\n  year =\t 2020,\n  isbn =\t {978-3-939818-90-8},\n  url =          {https://www.bbaw.de/files-bbaw/user_upload/publikationen/BBAW_Verantwortung-KI-3-2020_PDF-A-1b.pdf},\n  annote = {Open access},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Public Announcement Logic in HOL.\n \n \n\n\n \n Reiche, S., & Benzmüller, C.\n\n\n \n\n\n\n In Martins, M. A., & Igor, S., editor(s), Dynamic Logic. New Trends and Applications. DaLi 2020, volume 12569, of Lecture Notes in Computer Science, 2020. Springer, Cham\n \n\n\n\n
\n\n\n\n \n \n \"Public preprint\n  \n \n \n \"PublicPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{C90,\n  Keywords =\t {own, Artificial Intelligence, Non-Classical Logics},\n  Author =\t {Sebastian Reiche and Christoph Benzm{\\"u}ller},\n  Title =\t {Public Announcement Logic in {HOL}},\n  url_preprint = {https://arxiv.org/abs/2010.00810},\n  Url =\t\t {https://doi.org/10.1007/978-3-030-65840-3_14},\n  Doi =\t\t {10.1007/978-3-030-65840-3_14},\n  Booktitle =\t {Dynamic Logic. New Trends and Applications. DaLi\n                  2020},\n  editor =\t {Martins, Manuel A. and Sedl\\'{a}r Igor},\n  series =\t {Lecture Notes in Computer Science},\n  volume =\t 12569,\n  publisher =\t {Springer, Cham},\n  year =\t 2020,\n  isbn =\t {978-3-030-65839-7},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Public Announcement Logic in HOL.\n \n \n\n\n \n Reiche, S., & Benzmüller, C.\n\n\n \n\n\n\n 2020.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"PublicPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{C90arxiv,\n  doi =\t\t {10.48550/ARXIV.2010.00810},\n  url =\t\t {https://arxiv.org/abs/2010.00810},\n  author =\t {Reiche, Sebastian and Benzm{\\"u}ller, Christoph},\n  title =\t {Public Announcement Logic in {HOL}},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2020,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Designing Normative Theories for Ethical and Legal Reasoning: LogiKEy Framework, Methodology, and Tool Support (extended abstract).\n \n \n\n\n \n Benzmüller, C., Parent, X., & van der Torre, L.\n\n\n \n\n\n\n In 17th Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Recently Published Research track, 2020. \n \n\n\n\n
\n\n\n\n \n \n \"Designing preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{C89,\n  Author =\t {Benzm{\\"u}ller, Christoph and Parent, Xavier and van\n                  der Torre, Leendert},\n  Keywords =\t {own, Normative Reasoning, Deontic Logic, Machine\n                  Ethics, Formal Methods, Automated Reasoning, ProoF\n                  Assistants, Explainable AI},\n  Title =\t {Designing Normative Theories for Ethical and Legal\n                  Reasoning: LogiKEy Framework, Methodology, and Tool\n                  Support (extended abstract)},\n  Booktitle =\t {17th Conference on Principles of Knowledge\n                  Representation and Reasoning (KR 2020), Recently\n                  Published Research track},\n  Year =\t 2020,\n  url_preprint = {https://www.researchgate.net/publication/343676062},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Higher-order Logic as Lingua Franca – Integrating Argumentative Discourse and Deep Logical Analysis.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n 2020.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"Higher-orderPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R81arxiv,\n  doi =\t\t {10.48550/ARXIV.2007.01019},\n  url =\t\t {https://arxiv.org/abs/2007.01019},\n  author =\t {Fuenmayor, David and Benzm{\\"u}ller, Christoph},\n  title =\t {Higher-order Logic as Lingua Franca -- Integrating\n                  Argumentative Discourse and Deep Logical Analysis},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2020,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Encoding Legal Balancing: Automating an Abstract Ethico-Legal Value Ontology in Preference Logic.\n \n \n\n\n \n Benzmüller, C., Fuenmayor, D., & Lomfeld, B.\n\n\n \n\n\n\n In Maranhao, J., & Sartor, G., editor(s), Workshop on Models of Legal Reasoning, hosted by 17th Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020. \n \n\n\n\n
\n\n\n\n \n \n \"Encoding arxiv\n  \n \n \n \"Encoding preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{C88,\n  Keywords =\t {own, Artificial Intelligence, Ethical and Legal\n                  Issues},\n  Author =\t {Christoph Benzm{\\"u}ller and David Fuenmayor and\n                  Bertram Lomfeld},\n  Title =\t {Encoding Legal Balancing: Automating an Abstract\n                  Ethico-Legal Value Ontology in Preference Logic},\n  Booktitle =\t {Workshop on Models of Legal Reasoning, hosted by\n                  17th Conference on Principles of Knowledge\n                  Representation and Reasoning (KR 2020)},\n  Editor =\t {Juliano Maranhao and Giovanni Sartor},\n  url_arxiv =\t {https://arxiv.org/abs/2006.12789},\n  url_preprint = {https://www.researchgate.net/publication/342380027},\n  year =\t 2020,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Reasonable Machines: A Research Manifesto.\n \n \n\n\n \n Benzmüller, C., & Lomfeld, B.\n\n\n \n\n\n\n In Schmid, U., Klügl, F., & Wolter, D., editor(s), KI 2020: Advances in Artificial Intelligence – 43rd German Conference on Artificial Intelligence, Bamberg, Germany, September 21–25, 2020, Proceedings, volume 12352, of Lecture Notes in Artificial Intelligence, pages 251–258, 2020. Springer, Cham\n \n\n\n\n
\n\n\n\n \n \n \"Reasonable preprint\n  \n \n \n \"ReasonablePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{C87,\n  Keywords =\t {own, Artificial Intelligence, Ethical and Legal\n                  Issues},\n  Author =\t {Christoph Benzm{\\"u}ller and Bertram Lomfeld},\n  Title =\t {Reasonable Machines: A Research Manifesto},\n  url_preprint = {https://dx.doi.org/10.13140/RG.2.2.28918.63045},\n  Url =\t\t {https://doi.org/10.1007/978-3-030-58285-2_20},\n  Doi =\t\t {10.1007/978-3-030-58285-2_20},\n  Booktitle =\t {{KI} 2020: Advances in Artificial Intelligence --\n                  43rd German Conference on Artificial Intelligence,\n                  Bamberg, Germany, September 21–25, 2020,\n                  Proceedings},\n  editor =\t {Ute Schmid and Franziska Klügl and Diedrich Wolter},\n  series =\t {Lecture Notes in Artificial Intelligence},\n  volume =\t 12352,\n  pages =\t {251--258},\n  publisher =\t {Springer, Cham},\n  year =\t 2020,\n  isbn =\t {978-3-030-30178-1},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Positive Free Higher-Order Logic and its Automation via a Semantical Embedding.\n \n \n\n\n \n Makarenko, I., & Benzmüller, C.\n\n\n \n\n\n\n In Schmid, U., Klügl, F., & Wolter, D., editor(s), KI 2020: Advances in Artificial Intelligence – 43rd German Conference on Artificial Intelligence, Bamberg, Germany, September 21–25, 2020, Proceedings, volume 12352, of Lecture Notes in Artificial Intelligence, pages 116–131, 2020. Springer, Cham\n EasyChair Preprint no. 3621, EasyChair\n\n\n\n
\n\n\n\n \n \n \"PositivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{C86,\n  Keywords =\t {own, Artificial Intelligence, Free Logic, Higher\n                  Order Logic},\n  Author =\t {Irina Makarenko and Christoph Benzm{\\"{u}}ller},\n  Title =\t {Positive Free Higher-Order Logic and its Automation\n                  via a Semantical Embedding},\n  Note =\t {EasyChair Preprint no. 3621, EasyChair},\n  Url =\t\t {https://doi.org/10.1007/978-3-030-58285-2_9},\n  Doi =\t\t {10.1007/978-3-030-58285-2_9},\n  Booktitle =\t {{KI} 2020: Advances in Artificial Intelligence --\n                  43rd German Conference on Artificial Intelligence,\n                  Bamberg, Germany, September 21–25, 2020,\n                  Proceedings},\n  editor =\t {Ute Schmid and Franziska Kl{\\"{u}}gl and Diedrich\n                  Wolter},\n  series =\t {Lecture Notes in Artificial Intelligence},\n  volume =\t 12352,\n  publisher =\t {Springer, Cham},\n  year =\t 2020,\n  pages =\t {116--131},\n  isbn =\t {978-3-030-30178-1},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A (Simplified) Supreme Being Necessarily Exists, says the Computer: Computationally Explored Variants of Gödel's Ontological Argument.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, pages 779–789, 9 2020. IJCAI organization\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{C85,\n  Keywords =\t {own, Ontological Argument, Computational\n                  Metaphysics, Higher Order Logic, Semantic Embedding,\n                  Modal Logics, Automated Reasoning, Ontology\n                  Reasoning},\n  title =\t {{A (Simplified) Supreme Being Necessarily Exists,\n                  says the Computer: Computationally Explored Variants\n                  of Gödel's Ontological Argument}},\n  author =\t {Benzm{\\"u}ller, Christoph},\n  booktitle =\t {{Proceedings of the 17th International Conference on\n                  Principles of Knowledge Representation and\n                  Reasoning, KR 2020}},\n  pages =\t {779--789},\n  year =\t 2020,\n  month =\t 9,\n  doi =\t\t {10.24963/kr.2020/80},\n  url =\t\t {https://doi.org/10.24963/kr.2020/80},\n  publisher =\t {IJCAI organization},\n}\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Studies in Computational Metaphysics, Results of an Interdisciplinary Research Project.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Cukierman, H., & Bertato, F., editor(s), Tópicos em História e Filosofia da Computação, volume 87, of COLEÇÃO CLE, pages 129-160. Centre for Logic, Epistemology and the History of Science (CLE), University of Campinas (UNICAMP), 2020.\n \n\n\n\n
\n\n\n\n \n \n \"StudiesPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B21,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Title =\t {Studies in Computational Metaphysics, Results of an\n                  Interdisciplinary Research Project},\n  Booktitle =\t {Tópicos em História e Filosofia da Computação},\n  Editor =\t {Cukierman, Henrique and Bertato, Fabio},\n  Keywords =\t {own, Ontology Reasoning, Automated Reasoning, Higher\n                  Order Logic, Computational Metaphysics},\n  Volume   =     {87},\n  Series =       {COLEÇÃO CLE},\n  Publisher =\t {Centre for Logic, Epistemology and the History of\n                  Science (CLE), University of Campinas (UNICAMP)},\n  Year =\t 2020,\n  url =          {https://www.cle.unicamp.br/ebooks/index.php/publicacoes/catalog/book/31},\n  ISSN =         {0103-3247},\n  OPTISBN =         {978-65-88097-04-5},\n  pages =        {129-160},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n On Reductions of Hintikka Sets for Higher-Order Logic.\n \n \n\n\n \n Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n 2020.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"OnPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R77arxiv,\n  doi =\t\t {10.48550/ARXIV.2004.07506},\n  url =\t\t {https://arxiv.org/abs/2004.07506},\n  author =\t {Steen, Alexander and Benzm{\\"u}ller, Christoph},\n  title =\t {On Reductions of Hintikka Sets for Higher-Order\n                  Logic},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2020,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Intelligent Computer Mathematics - 13th International Conference, CICM 2020, Bertinoro, Italy, July 26-31, 2020, Proceedings.\n \n \n\n\n \n Benzmüller, C., & Miller, B.,\n editors.\n \n\n\n \n\n\n\n Volume 12236, of Lecture Notes in Artificial Intelligence.Springer. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"IntelligentPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@Proceedings{E23,\n  Keywords =\t {own},\n  editor =\t {Christoph Benzm{\\"u}ller and Bruce Miller},\n  title =\t {Intelligent Computer Mathematics - 13th\n                  International Conference, {CICM} 2020, Bertinoro,\n                  Italy, July 26-31, 2020, Proceedings},\n  series =\t {Lecture Notes in Artificial Intelligence},\n  volume =\t 12236,\n  publisher =\t {Springer},\n  year =\t 2020,\n  pages =\t {1--337},\n  url =\t\t {https://doi.org/10.1007/978-3-030-53518-6},\n  doi =\t\t {10.1007/978-3-030-53518-6},\n  isbn =\t {978-3-030-53517-9},\n  issn =\t {0302-9743}\n}\n\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n LogiKEy Workbench: Deontic Logics, Logic Combinations and Expressive Ethical and Legal Reasoning (Isabelle/HOL Dataset).\n \n \n\n\n \n Benzmüller, C., Farjami, A., Fuenmayor, D., Meder, P., Parent, X., Steen, A., van der Torre, L., & Zahoransky, V.\n\n\n \n\n\n\n Data in Brief, 33(106409): 1-10. 2020.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J53,\n  Keywords =\t {own, Normative Reasoning, Deontic Logic, Machine\n                  Ethics, Formal Methods, Automated Reasoning, ProoF\n                  Assistants, Explainable AI},\n  Author =\t {Benzm{\\"u}ller, Christoph and Farjami, Ali and\n                  Fuenmayor, David and Meder, Paul and Parent, Xavier\n                  and Steen, Alexander and van der Torre, Leendert and\n                  Zahoransky, Valeria},\n  Journal =\t {Data in Brief},\n  Publisher =\t {Elsevier},\n  Title =\t {LogiKEy Workbench: Deontic Logics, Logic\n                  Combinations and Expressive Ethical and Legal\n                  Reasoning ({Isabelle/HOL} Dataset)},\n  Volume =\t 33,\n  Number =\t 106409,\n  Year =\t 2020,\n  OPTUrl =       {https://doi.org/10.1016/j.dib.2020.106409},\n  Doi =\t\t {10.1016/j.dib.2020.106409},\n  Pages =\t {1-10},\n  OPTNote =\t {Note: data publication},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computer-supported Analysis of Arguments in Climate Engineering.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n In Dastani, M., Dong, H., & van der Torre, L., editor(s), Logic and Argumentation, Fourth International Conference, CLAR 2021, Hangzhou, China, April 6-9, 2020, Proceedings, volume 12061, of Lecture Notes in Computer Science, pages 104-115, 2020. Springer, Cham\n \n\n\n\n
\n\n\n\n \n \n \"Computer-supportedPaper\n  \n \n \n \"Computer-supported preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C82,\n  Keywords =\t {own, Normative Reasoning, Deontic Logic, Machine\n                  Ethics, Formal Methods, Automated Reasoning, ProoF\n                  Assistants, Explainable AI},\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Logic and Argumentation, Fourth International\n                  Conference, {CLAR} 2021, Hangzhou, China, April 6-9,\n                  2020, Proceedings},\n  Editor =\t {Dastani, Mehdi and Dong, Huimin and van der Torre,\n                  Leon},\n  Series =\t {Lecture Notes in Computer Science},\n  volume =\t 12061,\n  pages =\t {104-115},\n  Publisher =\t {Springer, Cham},\n  Year =\t 2020,\n  Title =\t {Computer-supported Analysis of Arguments in Climate\n                  Engineering},\n  Url =\n                  {https://link.springer.com/chapter/10.1007/978-3-030-44638-3_7},\n  url_preprint = {https://www.researchgate.net/publication/338829452},\n  doi =\t\t {10.1007/978-3-030-44638-3_7},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Normative Reasoning with Expressive Logic Combinations.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n In De Giacomo, G., Catala, A., Dilkina, B., Milano, M., Barro, S., Bugarín, A., & Lang, J., editor(s), ECAI 2020 – 24th European Conference on Artificial Intelligence, June 8-12, Santiago de Compostela, Spain, volume 325, of Frontiers in Artificial Intelligence and Applications, pages 2903-2904, 2020. IOS Press\n \n\n\n\n
\n\n\n\n \n \n \"NormativePaper\n  \n \n \n \"Normative preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C81,\n  Keywords =\t {own, Normative Reasoning, Deontic Logic, Machine\n                  Ethics, Formal Methods, Automated Reasoning, ProoF\n                  Assistants, Explainable AI},\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {{ECAI} 2020 -- 24th European Conference on\n                  Artificial Intelligence, June 8-12, Santiago de\n                  Compostela, Spain},\n  Editor =\t {De Giacomo, G. and Catala, A. and Dilkina, B. and\n                  Milano, M. and Barro, S. and Bugarín, A. and Lang,\n                  J.},\n  Series =\t {Frontiers in Artificial Intelligence and\n                  Applications},\n  volume =\t 325,\n  Publisher =\t {{IOS} Press},\n  Year =\t 2020,\n  Url =\t\t {https://dx.doi.org/10.3233/FAIA200445},\n  Title =\t {Normative Reasoning with Expressive Logic\n                  Combinations},\n  url_preprint = {https://www.researchgate.net/publication/339413206},\n  pages =\t {2903-2904},\n  doi =\t\t {10.3233/FAIA200445},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The Higher-Order Prover Leo-III.\n \n \n\n\n \n Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n In De Giacomo, G., Catala, A., Dilkina, B., Milano, M., Barro, S., Bugarín, A., & Lang, J., editor(s), ECAI 2020 – 24th European Conference on Artificial Intelligence, June 8-12, Santiago de Compostela, Spain, volume 325, of Frontiers in Artificial Intelligence and Applications, pages 2937-2938, 2020. IOS Press\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n \n \"The preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C80,\n  Keywords =\t {own, Higher Order Logic, Automated Reasoning, LEO\n                  Prover},\n  Author =\t {Alexander Steen and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {{ECAI} 2020 -- 24th European Conference on\n                  Artificial Intelligence, June 8-12, Santiago de\n                  Compostela, Spain},\n  Editor =\t {De Giacomo, G. and Catala, A. and Dilkina, B. and\n                  Milano, M. and Barro, S. and Bugarín, A. and Lang,\n                  J.},\n  Series =\t {Frontiers in Artificial Intelligence and\n                  Applications},\n  volume =\t 325,\n  Publisher =\t {{IOS} Press},\n  Year =\t 2020,\n  Title =\t {The Higher-Order Prover {Leo-III}},\n  Url =\t\t {https://dx.doi.org/10.3233/FAIA200462},\n  url_preprint = {https://www.researchgate.net/publication/339413198},\n  pages =\t {2937-2938},\n  doi =\t\t {10.3233/FAIA200462},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computer-supported Exploration of a Categorical Axiomatization of Modeloids.\n \n \n\n\n \n Tiemens, L., Scott, D. S., Benzmüller, C., & Benda, M.\n\n\n \n\n\n\n In Relational and Algebraic Methods in Computer Science – 18th International Conference, RAMiCS 2020, Palaiseau, France, April 8–11, 2020, Proceedings, volume 12062, of Lecture Notes in Computer Science, pages 302–317, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Computer-supportedPaper\n  \n \n \n \"Computer-supported preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{C78,\n  Keywords =\t {own, Automated Reasoning, Free Logic, Higher Order\n                  Logic, Category Theory, Algebraic Structures,\n                  Modeloids},\n  Author =\t {Lucca Tiemens and Dana S. Scott and Christoph\n                  Benzm{\\"u}ller and Miroslav Benda},\n  title =\t {Computer-supported Exploration of a Categorical\n                  Axiomatization of Modeloids},\n  booktitle =\t {Relational and Algebraic Methods in Computer Science\n                  -- 18th International Conference, {RAMiCS 2020},\n                  Palaiseau, France, April 8--11, 2020, Proceedings},\n  editors =\t {Uli Fahrenberg and Peter Jipsen and Michael Winter},\n  year =\t 2020,\n  series =\t {Lecture Notes in Computer Science},\n  url =\n                  {https://www.springerprofessional.de/computer-supported-exploration-of-a-categorical-axiomatization-o/17853766},\n  publisher =\t {Springer},\n  volume =\t 12062,\n  pages =\t {302--317},\n  doi =\t\t {10.1007/978-3-030-43520-2_19},\n  url_preprint = {https://www.researchgate.net/publication/336838722},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computer-supported Analysis of Positive Properties, Ultrafilters and Modal Collapse in Variants of Gödel's Ontological Argument.\n \n \n\n\n \n Benzmüller, C., & Fuenmayor, D.\n\n\n \n\n\n\n Bulletin of the Section of Logic, 49(2): 127-148. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Computer-supported preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J52,\n  Author =\t {Christoph Benzm{\\"u}ller and David Fuenmayor},\n  Journal =\t {Bulletin of the Section of Logic},\n  Publisher =\t {Department of Logic, University of Lodz},\n  Keywords =\t {own, Ontological Argument, Computational\n                  Metaphysics, Higher Order Logic, Semantic Embedding,\n                  Modal Logics, Automated Reasoning, Ontology\n                  Reasoning},\n  Title =\t {Computer-supported Analysis of Positive Properties,\n                  Ultrafilters and Modal Collapse in Variants of\n                  {G\\"odel's} Ontological Argument},\n  OPTUrl =\t\t {https://czasopisma.uni.lodz.pl/bulletin/article/view/7976},\n  Year =\t 2020,\n  Volume =\t 49,\n  Number =\t 2,\n  Doi =\t\t {10.18778/0138-0680.2020.08},\n  url_preprint = {https://www.researchgate.net/publication/336742445},\n  Pages =\t {127-148},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Mechanizing Principia Logico-Metaphysica in Functional Type Theory.\n \n \n\n\n \n Kirchner, D., Benzmüller, C., & Zalta, E. N.\n\n\n \n\n\n\n Review of Symbolic Logic, 13(1): 206-218. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Mechanizing preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J50,\n  Author =\t {Kirchner, Daniel and Benzm{\\"u}ller, Christoph and\n                  Zalta, Edward N.},\n  Keywords =\t {own, Higher Order Logic, Higher Order Modal Logic,\n                  Universal Reasoning, Computational Metaphysics},\n  Title =\t {Mechanizing Principia Logico-Metaphysica in\n                  Functional Type Theory},\n  Journal =\t {Review of Symbolic Logic},\n  Volume =\t 13,\n  Number =\t 1,\n  Publisher =\t {Cambridge University Press},\n  Doi =\t\t {10.1017/S1755020319000297},\n  pages =\t {206-218},\n  url_preprint = {https://www.researchgate.net/publication/321160582},\n  Year =\t 2020,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Designing Normative Theories for Ethical and Legal Reasoning: LogiKEy Framework, Methodology, and Tool Support.\n \n \n\n\n \n Benzmüller, C., Parent, X., & van der Torre, L.\n\n\n \n\n\n\n Artificial Intelligence, 287: 103348. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Designing preprint\n  \n \n \n \"Designing arxiv\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J48,\n  Author =\t {Benzm{\\"u}ller, Christoph and Parent, Xavier and van\n                  der Torre, Leendert},\n  Keywords =\t {own, Trustworthy and responsible AI, Knowledge\n                  representation and reasoning, Automated theorem\n                  proving, Model finding, Normative reasoning,\n                  Normative systems, Ethical issues, Semantical\n                  embedding, Higher-order logic},\n  Journal =\t {Artificial Intelligence},\n  Publisher =\t {Elsevier},\n  Title =\t {Designing Normative Theories for Ethical and Legal\n                  Reasoning: {LogiKEy} Framework, Methodology, and\n                  Tool Support},\n  Year =\t 2020,\n  Volume =\t 287,\n  Pages =\t 103348,\n  issn =\t {0004-3702},\n  Doi =\t\t {10.1016/j.artint.2020.103348},\n  OPTUrl =       {https://doi.org/10.1016/j.artint.2020.103348},\n  url_preprint = {https://www.researchgate.net/publication/342146653},\n  url_arxiv =\t {https://arxiv.org/abs/1903.10187},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automating Free Logic in HOL, with an Experimental Application in Category Theory.\n \n \n\n\n \n Benzmüller, C., & Scott, D. S.\n\n\n \n\n\n\n Journal of Automated Reasoning, 64(1): 53–72. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Automating preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J40,\n  author =\t {Christoph Benzm{\\"u}ller and Scott, Dana S.},\n  Keywords =\t {own, Automated Reasoning, Free Logic, Higher Order\n                  Logic, Category Theory},\n  title =\t {Automating Free Logic in {HOL}, with an Experimental\n                  Application in Category Theory},\n  volume =\t 64,\n  number =\t 1,\n  pages =\t {53--72},\n  year =\t 2020,\n  OPTurl =       {http://doi.org/10.13140/RG.2.2.11432.83202},\n  journal =\t {Journal of Automated Reasoning},\n  publisher =\t {Springer Netherlands},\n  doi =\t\t {10.1007/s10817-018-09507-7},\n  url_preprint = {http://doi.org/10.13140/RG.2.2.11432.83202},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Case Study On Computational Hermeneutics: E. J. Lowe's Modal Ontological Argument.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n In Silvestre, R., Göcke, B., Béziau, J., & Bilimoria, P., editor(s), Beyond Faith and Rationality: Essays on Logic, Religion and Philosophy, volume 34, of Sophia Studies in Cross-cultural Philosophy of Traditions and Cultures, 12. Springer Nature Switzerland AG, 2020.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B17,\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Beyond Faith and Rationality: Essays on Logic,\n                  Religion and Philosophy},\n  Editor =\t {Silvestre, Ricardo and G\\"{o}cke, Benedikt and\n                  B\\'{e}ziau, Jean-Yves and Bilimoria, Purushottama},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, Higher Order Logic,\n                  Computational Metaphysics},\n  Publisher =\t {Springer Nature Switzerland AG},\n  Series =\t {Sophia Studies in Cross-cultural Philosophy of\n                  Traditions and Cultures},\n  Volume =\t 34,\n  Chapter =\t 12,\n  Title =\t {A Case Study On Computational Hermeneutics:\n                  {E.~J.~Lowe's} Modal Ontological Argument},\n  Year =\t 2020,\n  Doi =\t\t {10.1007/978-3-030-43535-6_12},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (24)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Modelling the US Constitution to establish constitutional dictatorship.\n \n \n\n\n \n Zahoransky, V., & Benzmüller, C.\n\n\n \n\n\n\n In Proceedings of the 4th International Workshop on MIning and REasoning with Legal texts, co-located with the 32nd International Conference on Legal Knowledge and Information Systems (JURIX 2019), 2019. CEUR Workshop Proceedings, Vol-2632\n \n\n\n\n
\n\n\n\n \n \n \"ModellingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{C79,\n  Keywords =\t {own, Automated Reasoning, Higher Order Logic, Legal\n                  Reasoning, Formal Methods},\n  Author =\t {Valeria Zahoransky and Christoph Benzm{\\"u}ller},\n  title =\t {Modelling the US Constitution to establish\n                  constitutional dictatorship},\n  booktitle =\t {Proceedings of the 4th International Workshop on\n                  MIning and REasoning with Legal texts, co-located\n                  with the 32nd International Conference on Legal\n                  Knowledge and Information Systems (JURIX 2019)},\n  year =\t 2019,\n  publisher =\t {CEUR Workshop Proceedings, Vol-2632},\n  Url =\t\t {http://ceur-ws.org/Vol-2632/MIREL-19_paper_1.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computer-supported Exploration of a Categorical Axiomatization of Modeloids.\n \n \n\n\n \n Tiemens, L., Scott, D. S., Benzmüller, C., & Benda, M.\n\n\n \n\n\n\n 2019.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"Computer-supportedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{C78arxiv,\n  doi =\t\t {10.48550/ARXIV.1910.12863},\n  url =\t\t {https://arxiv.org/abs/1910.12863},\n  author =\t {Tiemens, Lucca and Scott, Dana S. and\n                  Benzm{\\"u}ller, Christoph and Benda, Miroslav},\n  title =\t {Computer-supported Exploration of a Categorical\n                  Axiomatization of Modeloids},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2019,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computer-supported Analysis of Positive Properties, Ultrafilters and Modal Collapse in Variants of Gödel's Ontological Argument.\n \n \n\n\n \n Benzmüller, C., & Fuenmayor, D.\n\n\n \n\n\n\n 2019.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"Computer-supportedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{J52arxiv,\n  doi =\t\t {10.48550/ARXIV.1910.08955},\n  url =\t\t {https://arxiv.org/abs/1910.08955},\n  author =\t {Benzm{\\"u}ller, Christoph and Fuenmayor, David},\n  title =\t {Computer-supported Analysis of Positive Properties,\n                  Ultrafilters and Modal Collapse in Variants of\n                  Gödel's Ontological Argument},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2019,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Extensional Higher-Order Paramodulation in Leo-III.\n \n \n\n\n \n Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n 2019.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"ExtensionalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{J51arxiv,\n  doi =\t\t {10.48550/ARXIV.1907.11501},\n  url =\t\t {https://arxiv.org/abs/1907.11501},\n  author =\t {Steen, Alexander and Benzm{\\"u}ller, Christoph},\n  title =\t {Extensional Higher-Order Paramodulation in {Leo-III}},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2019,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Explicit Normative Reasoning and Machine Ethics.\n \n \n\n\n \n Benzmüller, C., & Sutcliffe, G.\n\n\n \n\n\n\n 2019.\n The Second International ARCADE (Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements) Workshop.\n\n\n\n
\n\n\n\n \n \n \"Explicit preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@misc{W64,\n  Author =\t {Benzm{\\"u}ller, Christoph and Sutcliffe, Geoff},\n  Keywords =\t {own, Normative Reasoning, Machine Ethics},\n  Note =\t {The Second International ARCADE (Automated\n                  Reasoning: Challenges, Applications, Directions,\n                  Exemplary Achievements) Workshop.},\n  url_preprint = {http://christoph-benzmueller.de/papers/W64.pdf},\n  Title =\t {Explicit Normative Reasoning and Machine Ethics},\n  Year =\t 2019,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Computational-Hermeneutic Approach for Conceptual Explicitation.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n In Nepomuceno, A., Magnani, L., Salguero, F., Bares, C., & Fontaine, M., editor(s), Model-Based Reasoning in Science and Technology. Inferential Models for Logic, Language, Cognition and Computation, volume 49, of SAPERE, pages 441-469. Springer, 2019.\n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B19,\n  Keywords =\t {own, Computational Hermeneutics, Higher Order Logic,\n                  Universal Reasoning, Rational Argumentation,\n                  Human-Machine Interaction},\n  Author =\t {Fuenmayor, David and Benzm{\\"u}ller, Christoph},\n  Title =\t {A Computational-Hermeneutic Approach for Conceptual\n                  Explicitation},\n  Booktitle =\t {Model-Based Reasoning in Science and\n                  Technology. Inferential Models for Logic, Language,\n                  Cognition and Computation},\n  Editor =\t {A. Nepomuceno and L. Magnani and F. Salguero and\n                  C. Bares and M. Fontaine},\n  Publisher =\t {Springer},\n  Series =\t {SAPERE},\n  Volume =\t 49,\n  Pages =\t {441-469},\n  Year =\t 2019,\n  Doi =\t\t {10.1007/978-3-030-32722-4_25},\n  url_preprint = {http://doi.org/10.13140/RG.2.2.30869.78564},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Computational-Hermeneutic Approach for Conceptual Explicitation.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n 2019.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{B19arxiv,\n  doi =\t\t {10.48550/ARXIV.1906.06582},\n  url =\t\t {https://arxiv.org/abs/1906.06582},\n  author =\t {Fuenmayor, David and Benzm{\\"u}ller, Christoph},\n  title =\t {A Computational-Hermeneutic Approach for Conceptual\n                  Explicitation},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2019,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Mechanised Assessment of Complex Natural-Language Arguments using Expressive Logic Combinations.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n In Herzig, A., & AndreiPopescu, editor(s), Frontiers of Combining Systems, 12th International Symposium, FroCoS 2019, London, September 4-6, volume 11715, of Lecture Notes in Artificial Intelligence, pages 112–128, 2019. Springer Nature Switzerland AG\n \n\n\n\n
\n\n\n\n \n \n \"Mechanised preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{C77,\n  Keywords =\t {own, Higher Order Logic, Universal Reasoning, Logic\n                  Combinations, Machine Ethics},\n  author =\t {Fuenmayor, David and Benzm{\\"u}ller, Christoph},\n  title =\t {Mechanised Assessment of Complex Natural-Language\n                  Arguments using Expressive Logic Combinations},\n  booktitle =\t {Frontiers of Combining Systems, 12th International\n                  Symposium, FroCoS 2019, London, September 4-6},\n  editor =\t {Andreas Herzig and AndreiPopescu},\n  year =\t 2019,\n  series =\t {Lecture Notes in Artificial Intelligence},\n  volume =\t 11715,\n  publisher =\t {Springer Nature Switzerland AG},\n  doi =\t\t {10.1007/978-3-030-29007-8_7},\n  url_preprint = {http://doi.org/10.13140/RG.2.2.20803.45608/1},\n  pages =\t {112--128},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Harnessing Higher-Order (Meta-)Logic to Represent and Reason with Complex Ethical Theories.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n In Nayak, A., & Sharma, A., editor(s), PRICAI 2019: Trends in Artificial Intelligence, volume 11670, of Lecture Notes in Artificial Intelligence, pages 418–432, 2019. Springer, Cham\n \n\n\n\n
\n\n\n\n \n \n \"Harnessing preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{C76,\n  Keywords =\t {own, Higher Order Logic, Deontic Logic, Automated\n                  Reasoning, Universal Reasoning, Machine Ethics},\n  author =\t {Fuenmayor, David and Benzm{\\"u}ller, Christoph},\n  editor =\t {Abhaya Nayak and Alok Sharma},\n  title =\t {Harnessing Higher-Order (Meta-)Logic to Represent\n                  and Reason with Complex Ethical Theories},\n  booktitle =\t {PRICAI 2019: Trends in Artificial Intelligence},\n  year =\t 2019,\n  series =\t {Lecture Notes in Artificial Intelligence},\n  volume =\t 11670,\n  publisher =\t {Springer, Cham},\n  url_preprint = {http://arxiv.org/abs/1903.09818},\n  pages =\t {418--432},\n  doi =\t\t {10.1007/978-3-030-29908-8_34},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Harnessing Higher-Order (Meta-)Logic to Represent and Reason with Complex Ethical Theories.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n 2019.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"HarnessingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{C76arxiv,\n  doi =\t\t {10.48550/ARXIV.1903.09818},\n  url =\t\t {https://arxiv.org/abs/1903.09818},\n  author =\t {Fuenmayor, David and Benzm{\\"u}ller, Christoph},\n  title =\t {Harnessing Higher-Order (Meta-)Logic to Represent\n                  and Reason with Complex Ethical Theories},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2019,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Selected Student Contributions and Workshop Papers of LuxLogAI 2018.\n \n \n\n\n \n Benzmüller, C., Parent, X., & Steen, A.,\n editors.\n \n\n\n \n\n\n\n Volume 10, of Kalpa Publications in Computing.EasyChair. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"SelectedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{E22,\n  title =\t {Selected Student Contributions and Workshop Papers\n                  of LuxLogAI 2018},\n  editor =\t {Christoph Benzm{\\"u}ller and Xavier Parent and\n                  Alexander Steen},\n  series =\t {Kalpa Publications in Computing},\n  volume =\t 10,\n  year =\t 2019,\n  publisher =\t {EasyChair},\n  bibsource =\t {EasyChair, https://easychair.org},\n  issn =\t {2515-1762},\n  url =\n                  {https://easychair.org/publications/volume/LuxLogAI_2018},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Report on the Second International Joint Conference on Rules and Reasoning.\n \n \n\n\n \n Benzmüller, C., Parent, X., & Ricca, F.\n\n\n \n\n\n\n AI Magazine, 40(2): 73-74. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"Report preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J49,\n  Author =\t {Benzm{\\"u}ller, Christoph and Parent, Xavier and\n                  Ricca, Francesco},\n  Keywords =\t {own, Artificial Intelligence, Rules and Reasoning},\n  Journal =\t {AI Magazine},\n  Title =\t {Report on the Second International Joint Conference\n                  on Rules and Reasoning},\n  Year =\t 2019,\n  Volume =\t 40,\n  Number =\t 2,\n  Pages =\t {73-74},\n  Doi =\t\t {10.1609/aimag.v40i2.2888},\n  url_preprint =\n                  {http://page.mi.fu-berlin.de/cbenzmueller/papers/J49.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computational Metaphysics: New Insights on Gödel's Ontological Argument and Modal Collapse.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Kovac, S., & Swietorzecka, K., editor(s), Formal Methods and Science in Philosophy III, Informal Proceedings, pages 3–4, 2019. \n \n\n\n\n
\n\n\n\n \n \n \"ComputationalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{R74,\n  Author =\t {Benzm{\\"u}ller, Christoph},\n  Title =\t {Computational Metaphysics: New Insights on\n                  {G{\\"o}del's} Ontological Argument and Modal\n                  Collapse},\n  Editor =\t {Srecko Kovac and Kordula Swietorzecka},\n  Booktitle =\t {Formal Methods and Science in Philosophy III,\n                  Informal Proceedings},\n  Year =\t 2019,\n  Pages =\t {3--4},\n  Adress =\t {Dubrovnik, Croatia},\n  Url =\n                  {http://christoph-benzmueller.de/papers/2019-FMSPh-Proceedings.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Designing Normative Theories for Ethical and Legal Reasoning: LogiKEy Framework, Methodology, and Tool Support.\n \n \n\n\n \n Benzmüller, C., Parent, X., & van der Torre, L.\n\n\n \n\n\n\n 2019.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"DesigningPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@misc{J48arxiv,\n  doi =\t\t {10.48550/ARXIV.1903.10187},\n  url =\t\t {https://arxiv.org/abs/1903.10187},\n  author =\t {Benzm{\\"u}ller, Christoph and Parent, Xavier and van\n                  der Torre, Leendert},\n  keywords =\t {Artificial Intelligence (cs.AI), FOS: Computer and\n                  information sciences, FOS: Computer and information\n                  sciences, I.2.3; I.2.4; I.2.0; F.4, 03B60, 03B15,\n                  68T27, 68T30, 68T15},\n  title =\t {Designing Normative Theories for Ethical and Legal\n                  Reasoning: LogiKEy Framework, Methodology, and Tool\n                  Support},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2019,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automated Reasoning with Complex Ethical Theories–A Case Study Towards Responsible AI.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n In 16th International Congress on Logic, Methodology and Philosophy of Science and Technology (CLMPST 2019) — Bridging across Academic Cultures, Book of Abstracts, pages 183-184, Prague, Czechia, August 5-10, 2019, 2019. \n \n\n\n\n
\n\n\n\n \n \n \"AutomatedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InProceedings{C75,\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, Formal Ethics, Machine Ethics, Knowledge\n                  Representation and Reasoning, Higher Order Logic,\n                  Universal Reasoning},\n  Title =\t {Automated Reasoning with Complex Ethical Theories--A\n                  Case Study Towards Responsible AI},\n  Booktitle =\t {16th International Congress on Logic, Methodology\n                  and Philosophy of Science and Technology (CLMPST\n                  2019) --- Bridging across Academic Cultures, Book of\n                  Abstracts},\n  pages =\t {183-184},\n  year =\t 2019,\n  Address =\t {Prague, Czechia, August 5-10, 2019},\n  Url =\n                  {http://clmpst2019.flu.cas.cz/wp-content/uploads/2019/08/BoA_CLMPST2019_web.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computer Science and Metaphysics: A Cross-Fertilization.\n \n \n\n\n \n Kirchner, D., Benzmüller, C., & Zalta, E. N.\n\n\n \n\n\n\n Open Philosophy, 2(1): 230–251. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"Computer preprint\n  \n \n \n \"ComputerPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 7 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J47,\n  Keywords =\t {own, Higher Order Logic, Higher Order Modal Logic,\n                  Universal Reasoning, Computational Metaphysics,\n                  Philosophy},\n  Author =\t {Kirchner, Daniel and Benzm{\\"u}ller, Christoph and\n                  Zalta, Edward N.},\n  Journal =\t {Open Philosophy},\n  Title =\t {Computer Science and Metaphysics: A\n                  Cross-Fertilization},\n  Editor =\t {Patrick Grim},\n  Year =\t 2019,\n  Volume =\t 2,\n  number =\t 1,\n  Pages =\t {230–251},\n  Doi =\t\t {10.1515/opphil-2019-0015},\n  url_preprint = {http://doi.org/10.13140/RG.2.2.25229.18403},\n  Url =\t\t {https://arxiv.org/abs/1905.00787},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n I/O Logic in HOL.\n \n \n\n\n \n Benzmüller, C., Farjami, A., Meder, P., & Parent, X.\n\n\n \n\n\n\n Journal of Applied Logics – IfCoLoG Journal of Logics and their Applications (Special Issue: Reasoning for Legal AI), 6(5): 715–732. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"I/O preprint\n  \n \n \n \"I/OPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{J46,\n  Author =\t {Christoph Benzm{\\"u}ller and Ali Farjami and Paul\n                  Meder and Xavier Parent},\n  Journal =\t {Journal of Applied Logics -- IfCoLoG Journal of\n                  Logics and their Applications (Special Issue:\n                  Reasoning for Legal AI)},\n  Editor =\t {Robaldo, Livio and van der Torre, Leon},\n  Title =\t {{I/O} Logic in {HOL}},\n  Pages =\t {715--732},\n  Volume =\t 6,\n  Number =\t 5,\n  url_preprint = {https://www.researchgate.net/publication/332786587},\n  Url =\n                  {https://www.collegepublications.co.uk/ifcolog/?00034},\n  Year =\t 2019,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Åqvist's Dyadic Deontic Logic E in HOL.\n \n \n\n\n \n Benzmüller, C., Farjami, A., & Parent, X.\n\n\n \n\n\n\n Journal of Applied Logics – IfCoLoG Journal of Logics and their Applications (Special Issue: Reasoning for Legal AI), 6(5): 733–755. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"Åqvist's preprint\n  \n \n \n \"Åqvist'sPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{J45,\n  Author =\t {Christoph Benzm{\\"u}ller and Ali Farjami and Xavier\n                  Parent},\n  Journal =\t {Journal of Applied Logics -- IfCoLoG Journal of\n                  Logics and their Applications (Special Issue:\n                  Reasoning for Legal AI)},\n  Editor =\t {Robaldo, Livio and van der Torre, Leon},\n  Title =\t {{{\\AA}qvist's} Dyadic Deontic Logic {E} in {HOL}},\n  Volume =\t 6,\n  Number =\t 5,\n  Pages =\t {733--755},\n  url_preprint = {https://www.researchgate.net/publication/332786724},\n  Url =\n                  {https://www.collegepublications.co.uk/ifcolog/?00034},\n  Year =\t 2019,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n KI 2019: Advances in Artificial Intelligence – 42nd German Conference on AI, Kassel, Germany, September 23-26, 2019, Proceedings.\n \n \n\n\n \n Benzmüller, C., & Stuckenschmidt, H.,\n editors.\n \n\n\n \n\n\n\n Volume 11793, of Lecture Notes in Artificial Intelligence.Springer. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"KIPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Proceedings{E21,\n  editor =\t {Christoph Benzm{\\"u}ller and Heiner Stuckenschmidt},\n  title =\t {{KI} 2019: Advances in Artificial Intelligence --\n                  42nd German Conference on AI, Kassel, Germany,\n                  September 23-26, 2019, Proceedings},\n  series =\t {Lecture Notes in Artificial Intelligence},\n  volume =\t 11793,\n  publisher =\t {Springer},\n  year =\t 2019,\n  pages =\t {1--355},\n  url =\t\t {https://doi.org/10.1007/978-3-030-30179-8},\n  doi =\t\t {10.1007/978-3-030-30179-8},\n  isbn =\t {978-3-030-30178-1},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Universal (Meta-)Logical Reasoning: The Wise Men Puzzle (Isabelle/HOL Dataset).\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Data in Brief, 24(103823): 1–5. 2019.\n Open Access\n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@article{J44,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Journal =\t {Data in Brief},\n  Keywords =\t {own, Universal Logical Reasoning},\n  Note =\t {Note: data publication},\n  Title =\t {Universal (Meta-)Logical Reasoning: The Wise Men\n                  Puzzle ({Isabelle/HOL Dataset})},\n  Year =\t 2019,\n  Volume =\t 24,\n  Pages =\t {1--5},\n  Number =\t 103823,\n  Note =\t {Open Access},\n  Doi =\t\t {10.1016/j.dib.2019.103823},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Church's Type Theory.\n \n \n\n\n \n Benzmüller, C., & Andrews, P.\n\n\n \n\n\n\n In Zalta, E. N., editor(s), The Stanford Encyclopedia of Philosophy, pages 1–62 (in pdf version). Metaphysics Research Lab, Stanford University, Summer 2019 edition, 2019.\n \n\n\n\n
\n\n\n\n \n \n \"Church'sPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InCollection{J43,\n  author =\t {Benzm{\\"u}ller, Christoph and Andrews, Peter},\n  title =\t {Church's Type Theory},\n  booktitle =\t {The Stanford Encyclopedia of Philosophy},\n  editor =\t {Edward N. Zalta},\n  year =\t 2019,\n  edition =\t {Summer 2019},\n  pages =\t {1--62 (in pdf version)},\n  publisher =\t {Metaphysics Research Lab, Stanford University},\n  url =\n                  {https://plato.stanford.edu/entries/type-theory-church/},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n What is a proof? What should it be?.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n 2019.\n \n\n\n\n
\n\n\n\n \n \n \"What preprint\n  \n \n \n \"WhatPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@misc{R72arxiv,\n  Keywords =\t {own, Formal Proof, Mathematical Proof\n                  Assistant, Higher Order Logic, Universal Reasoning},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Publisher =\t {arXiv},\n  Title =\t {What is a proof? What should it be?},\n  url_preprint = {https://www.researchgate.net/publication/330310239},\n  Url =\t\t {http://arxiv.org/abs/1904.06332},\n  Doi =\t\t {10.13140/RG.2.2.13405.87521/1},\n  year =\t 2019,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computational Hermeneutics: An Integrated Approach for the Logical Analysis of Natural-Language Arguments.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n In Liao, B., Agotnes, T., & Wang, Y. N., editor(s), Dynamics, Uncertainty and Reasoning – The Second Chinese Conference on Logic and Argumentation, of Logic in Asia: Studia Logica Library, pages 187–207. Springer Singapore, 2019.\n \n\n\n\n
\n\n\n\n \n \n \"Computational preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@InCollection{B18,\n  author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, Computational Hermeneutics, Higher Order Logic,\n                  Universal Reasoning, Rational Argumentation,\n                  Human-Machine Interaction},\n  title =\t {Computational Hermeneutics: An Integrated Approach\n                  for the Logical Analysis of Natural-Language\n                  Arguments},\n  booktitle =\t {Dynamics, Uncertainty and Reasoning -- The Second\n                  Chinese Conference on Logic and Argumentation},\n  publisher =\t {Springer Singapore},\n  pages =\t {187--207},\n  doi =\t\t {10.1007/978-981-13-7791-4_9},\n  year =\t 2019,\n  editor =\t {Liao, Beishui and Agotnes, Thomas and Wang, Yi N.},\n  series =\t {Logic in Asia: Studia Logica Library},\n  url_preprint = {http://doi.org/10.13140/RG.2.2.11784.26881},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Universal (Meta-)Logical Reasoning: Recent Successes.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Science of Computer Programming, 172: 48-62. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"Universal preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{J41,\n  author =\t {Christoph Benzm{\\"u}ller},\n  title =\t {Universal (Meta-)Logical Reasoning: Recent\n                  Successes},\n  journal =\t {Science of Computer Programming},\n  year =\t 2019,\n  volume =\t 172,\n  pages =\t {48-62},\n  url_preprint = {http://doi.org/10.13140/RG.2.2.11039.61609/2},\n  doi =\t\t {10.1016/j.scico.2018.10.008},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (27)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Formalisation and Evaluation of Alan Gewirth's Proof for the Principle of Generic Consistency in Isabelle/HOL.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n Archive of Formal Proofs,1-15. 2018.\n Note: data publication\n\n\n\n
\n\n\n\n \n \n \"FormalisationPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J42,\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Journal =\t {Archive of Formal Proofs},\n  Keywords =\t {own, Machine Ethics, Ethics, Artificial General\n                  Intelligence, Dyadic Deontic Logic, Higher Order\n                  Logic, Computational Metaphysics, Semantical\n                  Embedding},\n  Note =\t {Note: data publication},\n  Title =\t {Formalisation and Evaluation of {Alan Gewirth's}\n                  Proof for the {Principle of Generic Consistency} in\n                  {Isabelle/HOL}},\n  Url =\n                  {https://www.isa-afp.org/entries/GewirthPGCProof.html},\n  Year =\t 2018,\n  Pages =\t {1-15},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n I/O Logic in HOL.\n \n \n\n\n \n Farjami, A., Meder, P., Parent, X., & Benzmüller, C.\n\n\n \n\n\n\n 2018.\n MIREL 2018 workshop on MIning and REasoning with Legal texts.\n\n\n\n
\n\n\n\n \n \n \"I/O preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@misc{W63,\n  Author =\t {Farjami, Ali and Meder, Paul and Parent, Xavier and\n                  Benzm{\\"u}ller, Christoph},\n  Booktitle =\t {MIREL 2018},\n  Keywords =\t {own, Input/Output Logic, Higher Order Logic,\n                  Semantic Embedding, Automated Reasoning, General\n                  Data Protection Regulation},\n  Note =\t {MIREL 2018 workshop on MIning and REasoning with\n                  Legal texts.},\n  url_preprint = {http://orbilu.uni.lu/handle/10993/37013},\n  Title =\t {{I/O} Logic in {HOL}},\n  Year =\t 2018,\n  Pages =\t {1--18},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Aqvist's Dyadic Deontic Logic E in HOL.\n \n \n\n\n \n Benzmüller, C., Farjami, A., & Parent, X.\n\n\n \n\n\n\n 2018.\n MIREL 2018 workshop on MIning and REasoning with Legal texts.\n\n\n\n
\n\n\n\n \n \n \"Aqvist's preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@misc{W62,\n  Author =\t {Benzm{\\"u}ller, Christoph and Farjami, Ali and\n                  Parent, Xavier},\n  Booktitle =\t {MIREL 2018},\n  Keywords =\t {own, Dyadic Deontic Logic E, Preference Models,\n                  Higher Order Logic, Semantic Embedding, Automated\n                  Reasoning},\n  Note =\t {MIREL 2018 workshop on MIning and REasoning with\n                  Legal texts.},\n  url_preprint = {http://orbilu.uni.lu/handle/10993/37014},\n  Title =\t {Aqvist's Dyadic Deontic Logic {E} in {HOL}},\n  Year =\t 2018,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Can Computers Help to Sharpen our Understanding of Ontological Arguments?.\n \n \n\n\n \n Benzmüller, C., & Fuenmayor, D.\n\n\n \n\n\n\n In Gosh, S., Uppalari, R., Rao, K. V., Agarwal, V., & Sharma, S., editor(s), Mathematics and Reality, Proceedings of the 11th All India Students' Conference on Science & Spiritual Quest (AISSQ), 6-7 October, 2018, IIT Bhubaneswar, Bhubaneswar, India, pages 195-226, 2018. The Bhaktivedanta Institute, Kolkata, ˘rlwww.binstitute.org\n \n\n\n\n
\n\n\n\n \n \n \"Can preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C74,\n  Author =\t {Christoph Benzm{\\"u}ller and Fuenmayor, David},\n  Booktitle =\t {Mathematics and Reality, Proceedings of the 11th All\n                  India Students' Conference on Science \\& Spiritual\n                  Quest (AISSQ), 6-7 October, 2018, IIT Bhubaneswar,\n                  Bhubaneswar, India},\n  Editor =\t {Gosh, Sudipto and Uppalari, Ramgopal and Rao,\n                  K. Vasudeva and Agarwal, Varun and Sharma, Sushant},\n  Keywords =\t {own, Ontological Argument, Computational\n                  Metaphysics, Higher Order Logic, Semantic Embedding,\n                  Modal Logics, Automated Reasoning, Ontology\n                  Reasoning},\n  Publisher =\t {The Bhaktivedanta Institute, Kolkata,\n                  \\url{www.binstitute.org}},\n  Title =\t {Can Computers Help to Sharpen our Understanding of\n                  Ontological Arguments?},\n  url_preprint = {http://doi.org/10.13140/RG.2.2.31921.84323},\n  pages =\t {195-226},\n  isbn =\t {81-89635-31-X},\n  Year =\t 2018,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Faithful Semantic Embedding of the Dyadic Deontic Logic E in HOL.\n \n \n\n\n \n Benzmüller, C., Farjami, A., & Parent, X.\n\n\n \n\n\n\n 2018.\n Poster presented at the 6th World Congress and School on Universal Logic, 16-26 June, Vichy, France\n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R71,\n  Author =\t {Benzm{\\"u}ller, Christoph and Farjami, Ali and\n                  Parent, Xavier},\n  Keywords =\t {own, Higher Order Logic, Deontic Logic, Automated\n                  Reasoning, Universal Reasoning},\n  Note =\t {Poster presented at the 6th World Congress and\n                  School on Universal Logic, 16-26 June, Vichy,\n                  France},\n  Title =\t {A Faithful Semantic Embedding of the Dyadic Deontic\n                  Logic {E} in {HOL}},\n  url_preprint = {http://christoph-benzmueller.de/papers/R59.pdf},\n  Year =\t 2018,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Implementation of Dyadic Deontic Logic E in Isabelle/HOL.\n \n \n\n\n \n Benzmüller, C., Farjami, A., & Parent, X.\n\n\n \n\n\n\n 2018.\n 10th edition of PhDs in Logic, Institute of Philosophy of the Czech Academy of Sciences, Prague on May 1–4 2018\n\n\n\n
\n\n\n\n \n \n \"Implementation preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R70,\n  Author =\t {Benzm{\\"u}ller, Christoph and Farjami, Ali and\n                  Parent, Xavier},\n  Keywords =\t {own, Higher Order Logic, Deontic Logic, Automated\n                  Reasoning, Universal Reasoning},\n  Note =\t {10th edition of PhDs in Logic, Institute of\n                  Philosophy of the Czech Academy of Sciences, Prague\n                  on May 1–4 2018},\n  Title =\t {Implementation of Dyadic Deontic Logic {E} in\n                  {Isabelle/HOL}},\n  url_preprint = {http://christoph-benzmueller.de/papers/R58.pdf},\n  Year =\t 2018,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computational Hermeneutics: Using Automated Reasoning for the Logical Analysis of Natural-Language Arguments (Abstract).\n \n \n\n\n \n Fuenmayor, D., & Benzmüller (PhD Advisor), C.\n\n\n \n\n\n\n 2018.\n Deduktionstreffen, LuxLogAI 2018\n\n\n\n
\n\n\n\n \n \n \"Computational preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R69,\n  Author =\t {David Fuenmayor and Benzm{\\"u}ller (PhD Advisor),\n                  Christoph},\n  Keywords =\t {own, Computational Hermeneutics, Higher Order Logic,\n                  Universal Reasoning, Rational Argumentation,\n                  Human-Machine Interaction},\n  Title =\t {Computational Hermeneutics: Using Automated\n                  Reasoning for the Logical Analysis of\n                  Natural-Language Arguments (Abstract)},\n  Note =\t {Deduktionstreffen, LuxLogAI 2018},\n  url_preprint = {http://christoph-benzmueller.de/papers/R69.pdf},\n  year =\t 2018,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computational Hermeneutics: Using Automated Reasoning for the Logical Analysis of Natural-Language Arguments (Abstract).\n \n \n\n\n \n Fuenmayor, D., & Benzmüller (PhD Advisor), C.\n\n\n \n\n\n\n 2018.\n Doctoral Consortium, RuleML+RR 2018\n\n\n\n
\n\n\n\n \n \n \"Computational preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R68,\n  Author =\t {David Fuenmayor and Benzm{\\"u}ller (PhD Advisor),\n                  Christoph},\n  Keywords =\t {own, Computational Hermeneutics, Higher Order Logic,\n                  Universal Reasoning, Rational Argumentation,\n                  Human-Machine Interaction},\n  Title =\t {Computational Hermeneutics: Using Automated\n                  Reasoning for the Logical Analysis of\n                  Natural-Language Arguments (Abstract)},\n  Note =\t {Doctoral Consortium, RuleML+RR 2018},\n  url_preprint = {http://christoph-benzmueller.de/papers/R68.pdf},\n  year =\t 2018,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computational Hermeneutics: Using Computers for the Logical Analysis of Natural-Language Arguments (Abstract).\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n 2018.\n MBR18 SPAIN — Model-Based Reasoning in Science and Technology: Inferential Models for Logic, Language, Cognition and Computation\n\n\n\n
\n\n\n\n \n \n \"Computational preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R67,\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, Computational Hermeneutics, Higher Order Logic,\n                  Universal Reasoning, Rational Argumentation,\n                  Human-Machine Interaction},\n  Title =\t {Computational Hermeneutics: Using Computers for the\n                  Logical Analysis of Natural-Language Arguments\n                  (Abstract)},\n  Note =\t {MBR18 SPAIN --- Model-Based Reasoning in Science and\n                  Technology: Inferential Models for Logic, Language,\n                  Cognition and Computation},\n  url_preprint = {http://christoph-benzmueller.de/papers/R67.pdf},\n  year =\t 2018,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Rules and Reasoning, Second International Joint Conference, RuleML+RR 2018, Luxembourg, Luxembourg, September 18-21, 2018, Proceedings.\n \n \n\n\n \n Benzmüller, C., Ricca, F., Parent, X., & Roman, D.,\n editors.\n \n\n\n \n\n\n\n Volume 11092, of Lecture Notes in Computer Science.Springer. 2018.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Proceedings{E19,\n  title =\t {Rules and Reasoning, Second International Joint\n                  Conference, RuleML+RR 2018, Luxembourg, Luxembourg,\n                  September 18-21, 2018, Proceedings},\n  Editor =\t {Christoph Benzm{\\"u}ller and Francesco Ricca and\n                  Xavier Parent and Dumitru Roman},\n  Publisher =\t {Springer},\n  Series =\t {Lecture Notes in Computer Science},\n  Volume =\t 11092,\n  Year =\t 2018,\n  doi =\t\t {10.1007/978-3-319-99906-7},\n  isbn =\t {978-3-319-99905-0},\n  issn =\t {0302-9743},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Axiom Systems for Category Theory in Free Logic.\n \n \n\n\n \n Benzmüller, C., & Scott, D. S.\n\n\n \n\n\n\n Archive of Formal Proofs,1–12. 2018.\n Note: data publication\n\n\n\n
\n\n\n\n \n \n \"AxiomPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J39,\n  Author =\t {Christoph Benzm{\\"u}ller and Scott, Dana S.},\n  Keywords =\t {own, Automated Reasoning, Free Logic, Higher Order\n                  Logic, Category Theory},\n  Journal =\t {Archive of Formal Proofs},\n  Keywords =\t {own, Category Theory, Free Logic, Higher Order\n                  Logic, Semantical Embedding},\n  Note =\t {Note: data publication},\n  Title =\t {Axiom Systems for Category Theory in Free Logic},\n  Url =\n                  {https://www.isa-afp.org/entries/AxiomaticCategoryTheory.html},\n  Year =\t 2018,\n  Pages =\t {1--12},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Case Study On Computational Hermeneutics: E. J. Lowe's Modal Ontological Argument.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n Journal of Applied Logic - IfCoLoG Journal of Logics and their Applications (special issue on Formal Approaches to the Ontological Argument), 5(7): 1567-1603. 2018.\n To be published also as chapter in the book 'Beyond Faith and Rationality: Essays on Logic, Religion and Philosophy' printed in the Springer book series 'Sophia Studies in Cross-cultural Philosophy of Traditions and Cultures'\n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J38,\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Journal =\t {Journal of Applied Logic - IfCoLoG Journal of Logics\n                  and their Applications (special issue on Formal\n                  Approaches to the Ontological Argument)},\n  Volume =\t 5,\n  Number =\t 7,\n  Pages =\t {1567-1603},\n  Editors =\t {Silvestre, Ricardo and B\\'{e}ziau, Jean-Yves},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, Higher Order Logic,\n                  Computational Metaphysics},\n  Title =\t {A Case Study On Computational Hermeneutics:\n                  {E.~J.~Lowe's} Modal Ontological Argument},\n  Year =\t 2018,\n  Note =\t {To be published also as chapter in the book 'Beyond\n                  Faith and Rationality: Essays on Logic, Religion and\n                  Philosophy' printed in the Springer book series\n                  'Sophia Studies in Cross-cultural Philosophy of\n                  Traditions and Cultures'},\n  url_preprint = {https://www.researchgate.net/publication/333804824},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n System Demonstration: The Higher-Order Prover Leo-III.\n \n \n\n\n \n Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n In Benzmüller, C., & Otten, J., editor(s), ARQNL 2018. Automated Reasoning in Quantified Non-Classical Logics, volume 2095, pages 79-85, 2018. CEUR Workshop Proceedings, http://ceur-ws.org\n \n\n\n\n
\n\n\n\n \n \n \"SystemPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W61,\n  Author =\t {Alexander Steen and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {ARQNL 2018. Automated Reasoning in Quantified\n                  Non-Classical Logics},\n  Editor =\t {Christoph Benzm{\\"u}ller and Jens Otten},\n  Keywords =\t {own, Higher Order Logic, Leo Prover},\n  Publisher =\t {CEUR Workshop Proceedings, http://ceur-ws.org},\n  Url =\t\t {http://ceur-ws.org/Vol-2095/paper5.pdf},\n  Volume =\t 2095,\n  Title =\t {System Demonstration: The Higher-Order Prover\n                  {Leo-III}},\n  Pages =\t {79-85},\n  Year =\t 2018,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n ARQNL 2018. Automated Reasoning in Quantified Non-Classical Logics.\n \n \n\n\n \n Benzmüller, C., & Otten, J.,\n editors.\n \n\n\n \n\n\n\n Volume 2095.CEUR Workshop Proceedings. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"ARQNL website\n  \n \n \n \"ARQNLPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{E18,\n  url_website =\t {http://www.iltp.de/ARQNL-2016/},\n  Editor =\t {Christoph Benzm{\\"u}ller and Jens Otten},\n  Issn =\t {1613-0073},\n  Publisher =\t {CEUR Workshop Proceedings},\n  Title =\t {ARQNL 2018. Automated Reasoning in Quantified\n                  Non-Classical Logics},\n  Url =\t\t {http://ceur-ws.org/Vol-2095/},\n  Volume =\t 2095,\n  Year =\t 2018,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computational Hermeneutics: Using Computers for the Logical Analysis of Natural-Language Arguments.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n 2018.\n 2nd Chinese Conference on Logic and Argumentation, 16-17 June, Hangzhou, China, 2018, Informal Proceedings\n\n\n\n
\n\n\n\n \n \n \"Computational preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{C73,\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, Computational Hermeneutics, Higher Order Logic,\n                  Universal Reasoning, Rational Argumentation,\n                  Human-Machine Interaction},\n  Title =\t {Computational Hermeneutics: Using Computers for the\n                  Logical Analysis of Natural-Language Arguments},\n  Note =\t {2nd Chinese Conference on Logic and Argumentation,\n                  16-17 June, Hangzhou, China, 2018, Informal\n                  Proceedings},\n  url_preprint = {http://christoph-benzmueller.de/papers/C73.pdf},\n  year =\t 2018,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Flexible Infrastructure for Normative Reasoning (invited keynote abstract).\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Broersen, J., Condoravdi, C., Nair, S., & Pigozzi, G., editor(s), Deontic Logic and Normative Systems — 14th International Conference, DEON 2018, Utrecht, The Netherlands, 3-6 July, 2018, volume 9706, pages 7, 2018. College Publications\n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C72,\n  Author =\t {Benzm{\\"u}ller, Christoph},\n  Booktitle =\t {Deontic Logic and Normative Systems --- 14th\n                  International Conference, DEON 2018, Utrecht, The\n                  Netherlands, 3-6 July, 2018},\n  Editor =\t {Jan Broersen and Cleo Condoravdi and Shyam Nair and\n                  Gabriella Pigozzi},\n  Keywords =\t {own, Higher Order Logic, Deontic Logic, Automated\n                  Reasoning, Universal Reasoning},\n  Publisher =\t {College Publications},\n  pages =\t 7,\n  Title =\t {A Flexible Infrastructure for Normative Reasoning\n                  (invited keynote abstract)},\n  url_preprint = {http://doi.org/10.13140/RG.2.2.27972.48007},\n  Volume =\t 9706,\n  Year =\t 2018,\n  isbn =\t {978-1-84890-278-7},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Dyadic Deontic Logic in HOL.\n \n \n\n\n \n Benzmüller, C., Farjami, A., & Parent, X.\n\n\n \n\n\n\n In Broersen, J., Condoravdi, C., Nair, S., & Pigozzi, G., editor(s), Deontic Logic and Normative Systems — 14th International Conference, DEON 2018, Utrecht, The Netherlands, 3-6 July, 2018, volume 9706, pages 33-50, 2018. College Publications\n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C71,\n  Author =\t {Benzm{\\"u}ller, Christoph and Farjami, Ali and\n                  Parent, Xavier},\n  Booktitle =\t {Deontic Logic and Normative Systems --- 14th\n                  International Conference, DEON 2018, Utrecht, The\n                  Netherlands, 3-6 July, 2018},\n  Editor =\t {Jan Broersen and Cleo Condoravdi and Shyam Nair and\n                  Gabriella Pigozzi},\n  Keywords =\t {own, Higher Order Logic, Deontic Logic, Automated\n                  Reasoning, Universal Reasoning},\n  Publisher =\t {College Publications},\n  pages =\t {33-50},\n  Title =\t {A Dyadic Deontic Logic in {HOL}},\n  url_preprint = {https://tinyurl.com/y9wp4p6s},\n  Volume =\t 9706,\n  Year =\t 2018,\n  isbn =\t {978-1-84890-278-7},\n addendum  =\t {John-Jules Meyer Best Paper Award},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n First Experiments with a Flexible Infrastructure for Normative Reasoning.\n \n \n\n\n \n Benzmüller, C., & Parent, X.\n\n\n \n\n\n\n 2018.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"FirstPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R66,\n  doi =\t\t {10.48550/ARXIV.1804.02929},\n  url =\t\t {https://arxiv.org/abs/1804.02929},\n  author =\t {Benzm{\\"u}ller, Christoph and Parent, Xavier},\n  title =\t {First Experiments with a Flexible Infrastructure for\n                  Normative Reasoning},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2018,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The Higher-Order Prover Leo-III.\n \n \n\n\n \n Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n In Galmiche, D., Schulz, S., & Sebastiani, R., editor(s), Automated Reasoning. IJCAR 2018, volume 10900, of LNCS, pages 108-116, 2018. Springer\n \n\n\n\n
\n\n\n\n \n \n \"The preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C70,\n  Author =\t {Alexander Steen and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Automated Reasoning. IJCAR 2018},\n  Editor =\t {Didier Galmiche and Stephan Schulz and Roberto\n                  Sebastiani},\n  Keywords =\t {own, Higher Order Logic, Automated Reasoning, LEO\n                  Prover},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {The Higher-Order Prover {Leo-III}},\n  url_preprint = {https://tinyurl.com/y7wg5w5w},\n  volume =\t 10900,\n  pages =\t {108-116},\n  doi =\t\t {10.1007/978-3-319-94205-6_8},\n  isbn =\t {978-3-319-94204-9},\n  Year =\t 2018,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Deontic Logic Reasoning Infrastructure.\n \n \n\n\n \n Benzmüller, C., Parent, X., & van der Torre, L.\n\n\n \n\n\n\n In Manea, F., Miller, R. G., & Nowotka, D., editor(s), 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30-August, 2018, Proceedings, volume 10936, of LNCS, pages 60-69, 2018. Springer\n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C69,\n  Author =\t {Benzm{\\"u}ller, Christoph and Parent, Xavier and van\n                  der Torre, Leendert},\n  Keywords =\t {own, Automated Reasoning, Intensional Higher-Order\n                  Modal Logic, Higher Order Logic},\n  Title =\t {A Deontic Logic Reasoning Infrastructure},\n  Booktitle =\t {14th Conference on Computability in Europe, CiE\n                  2018, Kiel, Germany, July 30-August, 2018,\n                  Proceedings},\n  Publisher =\t {Springer},\n  editor =\t {Manea, Florin and Miller, Russell G. and Nowotka,\n                  Dirk},\n  series =\t {LNCS},\n  Year =\t 2018,\n  volume =\t 10936,\n  Pages =\t {60-69},\n  isbn =\t {978-3-319-67189-5},\n  Doi =\t\t {10.1007/978-3-319-94418-0_6},\n  url_preprint = {https://tinyurl.com/y7tgoft9},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n I/O Logic in HOL — First Steps.\n \n \n\n\n \n Benzmüller, C., & Parent, X.\n\n\n \n\n\n\n 2018.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"I/OPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R65,\n  doi =\t\t {10.48550/ARXIV.1803.09681},\n  url =\t\t {https://arxiv.org/abs/1803.09681},\n  author =\t {Benzm{\\"u}ller, Christoph and Parent, Xavier},\n  title =\t {{I/O} Logic in {HOL} --- First Steps},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2018,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Studies in Computational Metaphysics — Results of an Interdisciplinary Research Project.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n 2018.\n \n\n\n\n
\n\n\n\n \n \n \"Studies preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R64,\n  Author =\t {Benzm{\\"u}ller, Christoph},\n  Keywords =\t {own, Computational Metaphysics, Universal Reasoning,\n                  Higher Order Logic},\n  Title =\t {Studies in Computational Metaphysics --- Results of\n                  an Interdisciplinary Research Project},\n  url_preprint = {http://christoph-benzmueller.de/papers/R64.pdf},\n  Year =\t 2018\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Faithful Semantical Embedding of a Dyadic Deontic Logic in HOL.\n \n \n\n\n \n Benzmüller, C., Farjami, A., & Parent, X.\n\n\n \n\n\n\n Technical Report arXiv:1802.08454, CoRR, 2018.\n \n\n\n\n
\n\n\n\n \n \n \"FaithfulPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@techreport{R63,\n  Author =\t {Benzm{\\"u}ller, Christoph and Farjami, Ali and\n                  Parent, Xavier},\n  Keywords =\t {own, Higher Order Logic, Deontic Logic, Automated\n                  Reasoning, Universal Reasoning},\n  Title =\t {Faithful Semantical Embedding of a Dyadic Deontic\n                  Logic in {HOL}},\n  Institution =\t {CoRR},\n  Number =\t {arXiv:1802.08454},\n  Url =\t\t {https://arxiv.org/abs/1802.08454},\n  Year =\t 2018\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computational Hermeneutics: Using Computers to Interpret Philosophical Arguments (Abstract).\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n In Logical Correctness, Workshop at UNILOG'2018, UNILOG'2018 Book of Abstracts, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"Computational preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W60,\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, Computational Hermeneutics, Higher Order Logic,\n                  Universal Reasoning, Rational Argumentation,\n                  Human-Machine Interaction},\n  Title =\t {Computational Hermeneutics: Using Computers to\n                  Interpret Philosophical Arguments (Abstract)},\n  Booktitle =\t {Logical Correctness, Workshop at UNILOG'2018,\n                  UNILOG'2018 Book of Abstracts},\n  year =\t 2018,\n  url_preprint = {http://christoph-benzmueller.de/papers/W60.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The Higher-Order Prover Leo-III (Extended Version).\n \n \n\n\n \n Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n 2018.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R62,\n  doi =\t\t {10.48550/ARXIV.1802.02732},\n  url =\t\t {https://arxiv.org/abs/1802.02732},\n  author =\t {Steen, Alexander and Benzm{\\"u}ller, Christoph},\n  title =\t {The Higher-Order Prover {Leo-III} (Extended Version)},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2018,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Mechanizing Principia Logico-Metaphysica in Functional Type Theory (Extended Abstract).\n \n \n\n\n \n Kirchner, D., Benzmüller, C., & Zalta, E. N.\n\n\n \n\n\n\n In Hales, T. C., Kaliszyk, C., Schulz, S., & Urban, J., editor(s), 3rd Conference on Artificial Intelligence and Theorem Proving (AITP 2018), Book of Abstracts, pages 42–44, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"MechanizingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C68,\n  Author =\t {Daniel Kirchner and Christoph Benzm{\\"u}ller and\n                  Zalta, Edward N.},\n  Keywords =\t {own, Higher Order Logic, Higher Order Modal Logic,\n                  Universal Reasoning, Computational Metaphysics},\n  Title =\t {Mechanizing Principia Logico-Metaphysica in\n                  Functional Type Theory (Extended Abstract)},\n  editor =\t {Hales, Thomas C. and Kaliszyk, Cezary and Schulz,\n                  Stephan and Urban, Josef},\n  Booktitle =\t {3rd Conference on Artificial Intelligence and\n                  Theorem Proving (AITP 2018), Book of Abstracts},\n  year =\t 2018,\n  pages =\t {42--44},\n  Url =\n                  {http://aitp-conference.org/2018/aitp18-proceedings.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Some Reflections on a Computer-aided Theory Exploration Study in Category Theory (Extended Abstract).\n \n \n\n\n \n Benzmüller, C., & Scott, D. S.\n\n\n \n\n\n\n In Hales, T. C., Kaliszyk, C., Schulz, S., & Urban, J., editor(s), 3rd Conference on Artificial Intelligence and Theorem Proving (AITP 2018), Book of Abstracts, pages 7–8, 2018. \n \n\n\n\n
\n\n\n\n \n \n \"SomePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C67,\n  Author =\t {Christoph Benzm{\\"u}ller and Scott, Dana S.},\n  Keywords =\t {own, Automated Reasoning, Free Logic, Higher Order\n                  Logic, Category Theory},\n  Title =\t {Some Reflections on a Computer-aided Theory\n                  Exploration Study in Category Theory (Extended\n                  Abstract)},\n  editor =\t {Hales, Thomas C. and Kaliszyk, Cezary and Schulz,\n                  Stephan and Urban, Josef},\n  Booktitle =\t {3rd Conference on Artificial Intelligence and\n                  Theorem Proving (AITP 2018), Book of Abstracts},\n  year =\t 2018,\n  pages =\t {7--8},\n  Url =\n                  {http://aitp-conference.org/2018/aitp18-proceedings.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (16)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Computer-assisted Reconstruction and Assessment of E. J. Lowe's Modal Ontological Argument.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n Archive of Formal Proofs,1–19. 2017.\n Note: data publication\n\n\n\n
\n\n\n\n \n \n \"Computer-assistedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J37,\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Journal =\t {Archive of Formal Proofs},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, Higher Order Logic,\n                  Computational Metaphysics},\n  Note =\t {Note: data publication},\n  Title =\t {{Computer-assisted Reconstruction and Assessment of\n                  E. J. Lowe's Modal Ontological Argument}},\n  Url =\n                  {https://www.isa-afp.org/entries/Lowe_Ontological_Argument.html},\n  Year =\t 2017,\n  Pages =\t {1--19},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Case Study on Computational Hermeneutics: E. J. Lowe's Modal Ontological Argument.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n Technical Report PhilPapers, 2017.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@techreport{R61,\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, Computational Hermeneutics, Higher Order Logic,\n                  Universal Reasoning, Rational Argumentation,\n                  Human-Machine Interaction},\n  Title =\t {A Case Study on Computational Hermeneutics:\n                  E.~J.~Lowe's Modal Ontological Argument},\n  Institution =\t {PhilPapers},\n  Url =\t\t {https://philpapers.org/rec/FUEACS},\n  Year =\t 2017\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Recent Successes with a Meta-Logical Approach to Universal Logical Reasoning (Invited Extended Abstract).\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In da Costa Cavalheiro, S. A., & Fiadeiro, J. L., editor(s), Formal Methods: Foundations and Applications - 20th Brazilian Symposium, SBMF 2017, Recife, Brazil, November 29 - December 1, 2017, Proceedings, volume 10623, of Lecture Notes in Computer Science, pages 7–11, 2017. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Recent preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C66,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, Automated Reasoning, Universal Reasoning,\n                  Semantic Embedding, Higher Order Logic},\n  Title =\t {Recent Successes with a Meta-Logical Approach to\n                  Universal Logical Reasoning (Invited Extended\n                  Abstract)},\n  editor =\t {Simone Andr{\\'{e}} da Costa Cavalheiro and\n                  Jos{\\'{e}} Luiz Fiadeiro},\n  Booktitle =\t {Formal Methods: Foundations and Applications - 20th\n                  Brazilian Symposium, {SBMF} 2017, Recife, Brazil,\n                  November 29 - December 1, 2017, Proceedings},\n  pages =\t {7--11},\n  year =\t 2017,\n  series =\t {Lecture Notes in Computer Science},\n  volume =\t 10623,\n  publisher =\t {Springer},\n  url_preprint = {http://christoph-benzmueller.de/papers/C66.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Implementation of Carmo and Jones Dyadic Deontic Logic in Isabelle/HOL.\n \n \n\n\n \n Benzmüller, C., Farjami, A., Parent, X., & van der Torre, L.\n\n\n \n\n\n\n In Workshop on Computational Aspects of Arguments and LogiC (CAALC 2017), Belgrade, Serbia, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"ImplementationPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W59,\n  Address =\t {Belgrade, Serbia},\n  author =\t {Benzm{\\"u}ller, Christoph and Farjami, Ali and\n                  Parent, Xavier and van der Torre, Leendert},\n  title =\t {Implementation of Carmo and Jones Dyadic Deontic\n                  Logic in {Isabelle/HOL}},\n  booktitle =\t {Workshop on Computational Aspects of Arguments and\n                  LogiC (CAALC 2017)},\n  year =\t 2017,\n  url =\t\t {http://christoph-benzmueller.de/papers/W59.pdf},\n  Keywords =\t {own, Dyadic Logic, Higher-Order Logic},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Experiments in Computational Metaphysics: Gödel's Proof of God's Existence.\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n Savijnanam: scientific exploration for a spiritual paradigm. Journal of the Bhaktivedanta Institute, 9: 43-57. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"ExperimentsPaper\n  \n \n \n \"Experiments preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@Article{J36,\n  Keywords =\t {own, Automated Reasoning, Intensional Higher-Order\n                  Modal Logic, Higher Order Logic},\n  author =\t {Christoph Benzm{\\"u}ller and Woltzenlogel Paleo,\n                  Bruno},\n  title =\t {Experiments in {Computational Metaphysics}:\n                  {G\\"odel's} Proof of {God's} Existence},\n  journal =\t {Savijnanam: scientific exploration for a spiritual\n                  paradigm. Journal of the Bhaktivedanta Institute},\n  year =\t 2017,\n  volume =\t 9,\n  pages =\t {43-57},\n  url =\n                  {https://sites.google.com/binstitute.org/journal/article-3-page-43},\n  issn =\t {0972-6586},\n  url_preprint = {https://www.researchgate.net/publication/334519782},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automating Emendations of the Ontological Argument in Intensional Higher-Order Modal Logic.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n In KI 2017: Advances in Artificial Intelligence, 40th Annual German Conference on AI, Dortmund, Germany, September 25-29, 2017, Proceedings, volume 10505, of LNAI, pages 114-127, 2017. Springer\n \n\n\n\n
\n\n\n\n \n \n \"AutomatingPaper\n  \n \n \n \"Automating preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C65,\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, Automated Reasoning, Intensional Higher-Order\n                  Modal Logic, Higher Order Logic},\n  Title =\t {Automating Emendations of the Ontological Argument\n                  in Intensional Higher-Order Modal Logic},\n  Booktitle =\t {KI 2017: Advances in Artificial Intelligence, 40th\n                  Annual German Conference on AI, Dortmund, Germany,\n                  September 25-29, 2017, Proceedings},\n  Publisher =\t {Springer},\n  Series =\t {LNAI},\n  Year =\t 2017,\n  Volume =\t 10505,\n  Pages =\t {114-127},\n  isbn =\t {978-3-319-67189-5},\n  url =\t\t {https://doi.org/10.1007/978-3-319-67190-1_9},\n  Doi =\t\t {10.1007/978-3-319-67190-1_9},\n  url_preprint = {http://christoph-benzmueller.de/papers/C65.pdf},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Types, Tableaus and Gödel's God in Isabelle/HOL.\n \n \n\n\n \n Fuenmayor, D., & Benzmüller, C.\n\n\n \n\n\n\n Archive of Formal Proofs,1–34. 2017.\n Note: data publication\n\n\n\n
\n\n\n\n \n \n \"Types,Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J35,\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller},\n  Journal =\t {Archive of Formal Proofs},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, Higher Order Logic,\n                  Computational Metaphysics},\n  Note =\t {Note: data publication},\n  Title =\t {Types, Tableaus and {G{\\"o}del's} God in\n                  {Isabelle/HOL}},\n  Url =\n                  {http://afp.sourceforge.net/entries/Types_Tableaus_and_Goedels_God.shtml},\n  Year =\t 2017,\n  Pages =\t {1--34},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Universal Reasoning, Rational Argumentation and Human-Machine Interaction.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n 2017.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"UniversalPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R59,\n  doi =\t\t {10.48550/ARXIV.1703.09620},\n  url =\t\t {https://arxiv.org/abs/1703.09620},\n  author =\t {Benzm{\\"u}ller, Christoph},\n  title =\t {Universal Reasoning, Rational Argumentation and\n                  Human-Machine Interaction},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2017,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Capability Discovery for Automated Reasoning Systems.\n \n \n\n\n \n Steen, A., Wisniewski, M., Schurr, H., & Benzmüller, C.\n\n\n \n\n\n\n In Eiter, T., Sands, D., Sutcliffe, G., & Voronkov, A., editor(s), IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, Maun, Botswana, May 7-12, 2017, volume 1, of Kalpa Publications in Computing, Maun, Botswana, 2017. EasyChair\n \n\n\n\n
\n\n\n\n \n \n \"CapabilityPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W58,\n  Address =\t {Maun, Botswana},\n  Author =\t {Alexander Steen and Max Wisniewski and Hans-J{\\"o}rg\n                  Schurr and Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Polymorphism,\n                  Automated Reasoning},\n  title =\t {Capability Discovery for Automated Reasoning\n                  Systems},\n  Booktitle =\t {IWIL@LPAR 2017 Workshop and {LPAR-21} Short\n                  Presentations, Maun, Botswana, May 7-12, 2017},\n  Editor =\t {Thomas Eiter and David Sands and Geoff Sutcliffe and\n                  Andrei Voronkov},\n  series =\t {Kalpa Publications in Computing},\n  volume =\t 1,\n  publisher =\t {EasyChair},\n  year =\t 2017,\n  url =\t\t {https://easychair.org/publications/paper/SfX},\n  doi = {10.29007/fsv3},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Going Polymorphic - TH1 Reasoning for Leo-III.\n \n \n\n\n \n Steen, A., Wisniewski, M., & Benzmüller, C.\n\n\n \n\n\n\n In Eiter, T., Sands, D., Sutcliffe, G., & Voronkov, A., editor(s), IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, Maun, Botswana, May 7-12, 2017, volume 1, of Kalpa Publications in Computing, pages 100-112, Maun, Botswana, 2017. EasyChair\n \n\n\n\n
\n\n\n\n \n \n \"GoingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W57,\n  Address =\t {Maun, Botswana},\n  Author =\t {Alexander Steen and Max Wisniewski and Christoph\n                  Benzm{\\"u}ller},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Polymorphism,\n                  Automated Reasoning},\n  title =\t {Going Polymorphic - {TH1} Reasoning for {Leo-III}},\n  Booktitle =\t {IWIL@LPAR 2017 Workshop and {LPAR-21} Short\n                  Presentations, Maun, Botswana, May 7-12, 2017},\n  Editor =\t {Thomas Eiter and David Sands and Geoff Sutcliffe and\n                  Andrei Voronkov},\n  series =\t {Kalpa Publications in Computing},\n  pages =\t {100-112},\n  volume =\t 1,\n  publisher =\t {EasyChair},\n  year =\t 2017,\n  Url =\t\t {https://easychair.org/publications/paper/CNN},\n  Doi =\t\t {10.29007/jgkw},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Leo-III Version 1.1 (System description).\n \n \n\n\n \n Benzmüller, C., Steen, A., & Wisniewski, M.\n\n\n \n\n\n\n In Eiter, T., Sands, D., Sutcliffe, G., & Voronkov, A., editor(s), IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, Maun, Botswana, May 7-12, 2017, volume 1, of Kalpa Publications in Computing, pages 11-61, Maun, Botswana, 2017. EasyChair\n \n\n\n\n
\n\n\n\n \n \n \"Leo-IIIPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C64,\n  Address =\t {Maun, Botswana},\n  Author =\t {Christoph Benzm{\\"u}ller and Alexander Steen and Max\n                  Wisniewski},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Polymorphism,\n                  Automated Reasoning},\n  title =\t {{Leo-III} Version 1.1 (System description)},\n  Booktitle =\t {IWIL@LPAR 2017 Workshop and {LPAR-21} Short\n                  Presentations, Maun, Botswana, May 7-12, 2017},\n  Editor =\t {Thomas Eiter and David Sands and Geoff Sutcliffe and\n                  Andrei Voronkov},\n  series =\t {Kalpa Publications in Computing},\n  pages =\t {11-61},\n  volume =\t 1,\n  publisher =\t {EasyChair},\n  year =\t 2017,\n  doi =          {10.29007/grmx},\n  url =       {https://easychair.org/publications/paper/sl},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The Virtues of Automated Theorem Proving in Metaphysics — A Case Study: E. J. Lowe's Modal Ontological Argument.\n \n \n\n\n \n Fuenmayor, D., Benzmüller, C., Steen, A., & Wisniewski, M.\n\n\n \n\n\n\n In Krajewski, S., & Balcerowicz, P., editor(s), Handbook of the 2nd World Congress on Logic and Religion, Warsaw, Poland, pages 3, 2017. \n \n\n\n\n
\n\n\n\n \n \n \"The preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C63,\n  Author =\t {David Fuenmayor and Christoph Benzm{\\"u}ller and\n                  Alexander Steen and Max Wisniewski},\n  Booktitle =\t {Handbook of the 2nd World Congress on Logic and\n                  Religion, Warsaw, Poland},\n  Editor =\t {Stanislaw Krajewski and Piotr Balcerowicz},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic,\n                  Computational Metaphysics},\n  Pages =\t 3,\n  Title =\t {The Virtues of Automated Theorem Proving in\n                  Metaphysics --- A Case Study: {E. J. Lowe's} Modal\n                  Ontological Argument},\n  url_preprint = {http://christoph-benzmueller.de/papers/C63.pdf},\n  Year =\t 2017,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Theorem Provers for Every Normal Modal Logic.\n \n \n\n\n \n Gleißner, T., Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n In Eiter, T., & Sands, D., editor(s), LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, volume 46, of EPiC Series in Computing, pages 14-30, Maun, Botswana, 2017. EasyChair\n \n\n\n\n
\n\n\n\n \n \n \"TheoremPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C62,\n  Address =\t {Maun, Botswana},\n  Author =\t {Tobias Glei{\\ss}ner and Alexander Steen and\n                  Christoph Benzm{\\"u}ller},\n  Booktitle =\t {LPAR-21. 21st International Conference on Logic for\n                  Programming, Artificial Intelligence and Reasoning},\n  Editor =\t {Thomas Eiter and David Sands},\n  Keywords =\t {own, Modal Logic, Higher Order Modal Logic, Higher\n                  Order Logic, Automated Reasoning},\n  Publisher =\t {EasyChair},\n  issn =\t {2398-7340},\n  Series =\t {EPiC Series in Computing},\n  Volume =\t 46,\n  Pages =\t {14-30},\n  Doi =\t\t {10.29007/jsb9},\n  Title =\t {Theorem Provers for Every Normal Modal Logic},\n  Url =\t\t {https://easychair.org/publications/paper/6bjv},\n  doi =          {10.29007/jsb9},\n  Year =\t 2017,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n GCAI 2017. 3rd Global Conference on Artificial Intelligence.\n \n \n\n\n \n Benzmüller, C., Lisetti, C., & Theobald, M.,\n editors.\n \n\n\n \n\n\n\n Volume 50, of EPiC Series in Computing.EasyChair. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"GCAIPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{E17,\n  Title =\t {GCAI 2017. 3rd Global Conference on Artificial\n                  Intelligence},\n  Editor =\t {Christoph Benzm{\\"u}ller and Christine Lisetti and\n                  Martin Theobald},\n  Publisher =\t {EasyChair},\n  Series =\t {EPiC Series in Computing},\n  Url =\n                  {http://www.easychair.org/publications/volume/GCAI_2017},\n  Volume =\t 50,\n  Year =\t 2017,\n  issn =\t {2398-7340},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computer-Assisted Analysis of the Anderson-Hájek Controversy.\n \n \n\n\n \n Benzmüller, C., Weber, L., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n Logica Universalis, 11(1): 139-151. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"Computer-AssistedPaper\n  \n \n \n \"Computer-Assisted preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J32,\n  Author =\t {Benzm{\\"u}ller, Christoph and Weber, Leon and\n                  Woltzenlogel Paleo, Bruno},\n  Journal =\t {Logica Universalis},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Semantic Embedding, Higher Order Logic, Higher Order\n                  Modal Logic, Computational Metaphysics,\n                  DFG-2501-Selected},\n  Volume =\t 11,\n  Number =\t 1,\n  Pages =\t {139-151},\n  Doi =\t\t {10.1007/s11787-017-0160-9},\n  url =\t\t {http://christoph-benzmueller.de/papers/J32.pdf},\n  title =\t {Computer-Assisted Analysis of the\n                  {Anderson-H\\'{a}jek} Controversy},\n  Year =\t 2017,\n  url_preprint = {https://www.researchgate.net/publication/313943927},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Cut-Elimination for Quantified Conditional Logic.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Journal of Philosophical Logic, 46(3): 333-353. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"Cut-Elimination preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J31,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Doi =\t\t {10.1007/s10992-016-9403-0},\n  Journal =\t {Journal of Philosophical Logic},\n  Volume =\t 46,\n  Number =\t 3,\n  Pages =\t {333-353},\n  Keywords =\t {own, Conditional Logic, Cut-Elimination, Semantic\n                  Embedding, DFG-2501-Selected, ERIH PLUS},\n  Title =\t {Cut-Elimination for Quantified Conditional Logic},\n  url_preprint = {https://www.researchgate.net/publication/293488069},\n  Comment =\t {<a href="http://rdcu.be/npVQ">Springer Nature\n                  Link</a>},\n  Year =\t 2017,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (16)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Analysis of an Ontological Proof Proposed by Leibniz.\n \n \n\n\n \n Bentert, M., Benzmüller, C., Streit, D., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n In Tandy, C., editor(s), Death and Anti-Death, Volume 14: Four Decades after Michael Polanyi, Three Centuries after G.W. Leibniz. Ria University Press, 2016.\n \n\n\n\n
\n\n\n\n \n \n \"AnalysisPaper\n  \n \n \n \"Analysis preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B16,\n  Author =\t {Bentert, Matthias and Benzm{\\"u}ller, Christoph and\n                  Streit, David and Woltzenlogel Paleo, Bruno},\n  Booktitle =\t {Death and Anti-Death, Volume 14: Four Decades after\n                  Michael Polanyi, Three Centuries after G.W. Leibniz},\n  Editor =\t {Tandy, Charles},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Semantic Embedding, Higher Order Logic, Higher Order\n                  Modal Logic, Computational Metaphysics},\n  Publisher =\t {Ria University Press},\n  Title =\t {Analysis of an Ontological Proof Proposed by\n                  {Leibniz}},\n  Isbn =\t {978-1934297254},\n  Url =\t\t {https://philpapers.org/rec/TANDAA-10},\n  Year =\t 2016,\n  url_preprint = {https://www.researchgate.net/publication/311456135},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Tutorial on Reasoning in Expressive Non-Classical Logics with Isabelle/HOL.\n \n \n\n\n \n Steen, A., Wisniewski, M., & Benzmüller, C.\n\n\n \n\n\n\n In Benzmüller, C., Rojas, R., & Sutcliffe, G., editor(s), GCAI 2016, 2nd Global Conference on Artificial Intelligence, volume 41, of EPiC Series in Computing, pages 1-10, Berlin, Germany, 2016. EasyChair\n \n\n\n\n
\n\n\n\n \n \n \"TutorialPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C61,\n  Address =\t {Berlin, Germany},\n  Author =\t {Alexander Steen and Max Wisniewski and Christoph\n                  Benzm{\\"u}ller},\n  Title =\t {Tutorial on Reasoning in Expressive Non-Classical\n                  Logics with {Isabelle/HOL}},\n  Booktitle =\t {GCAI 2016, 2nd Global Conference on Artificial\n                  Intelligence},\n  Editor =\t {Christoph Benzm{\\"u}ller and Raul Rojas and Geoff\n                  Sutcliffe},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Semantic Embedding, Higher Order Logic, Mulimodal\n                  Logic},\n  Publisher =\t {EasyChair},\n  Series =\t {EPiC Series in Computing},\n  issn =\t {2398-7340},\n  Doi =\t\t {10.29007/4dsr},\n  Url =          {https://easychair.org/publications/paper/dw51},\n  Volume =\t 41,\n  Year =\t 2016,\n  Pages =\t {1-10}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Axiomatizing Category Theory in Free Logic.\n \n \n\n\n \n Benzmüller, C., & Scott, D. S.\n\n\n \n\n\n\n 2016.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"AxiomatizingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R58,\n  doi =\t\t {10.48550/ARXIV.1609.01493},\n  url =\t\t {https://arxiv.org/abs/1609.01493},\n  author =\t {Benzm{\\"u}ller, Christoph and Scott, Dana S.},\n  title =\t {Axiomatizing Category Theory in Free Logic},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2016,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n GCAI 2016. 2nd Global Conference on Artificial Intelligence.\n \n \n\n\n \n Benzmüller, C., Sutcliffe, G., & Rojas, R.,\n editors.\n \n\n\n \n\n\n\n Volume 41, of EPiC Series in Computing.EasyChair. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"GCAIPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{E16,\n  Title =\t {GCAI 2016. 2nd Global Conference on Artificial\n                  Intelligence},\n  Editor =\t {Christoph Benzm{\\"u}ller and Geoff Sutcliffe and\n                  Raul Rojas},\n  Publisher =\t {EasyChair},\n  Series =\t {EPiC Series in Computing},\n  Url =\n                  {http://www.easychair.org/publications/volume/GCAI_2016},\n  Volume =\t 41,\n  issn =\t {2398-7340},\n  Year =\t 2016\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n ARQNL 2016. Automated Reasoning in Quantified Non-Classical Logics.\n \n \n\n\n \n Benzmüller, C., & Otten, J.,\n editors.\n \n\n\n \n\n\n\n Volume 1770.CEUR Workshop Proceedings, http://ceur-ws.org. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"ARQNLPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{E15,\n  OPTComment =\t {<a href="http://www.iltp.de/ARQNL-2016/">event-website</a>},\n  Editor =\t {Christoph Benzm{\\"u}ller and Jens Otten},\n  Issn =\t {1613-0073},\n  Pages =\t {1-86},\n  Publisher =\t {CEUR Workshop Proceedings, http://ceur-ws.org},\n  Title =\t {ARQNL 2016. Automated Reasoning in Quantified\n                  Non-Classical Logics},\n  Url =\t\t {http://ceur-ws.org/Vol-1770/},\n  Volume =\t 1770,\n  Year =\t 2016\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n An Object-Logic Explanation for the Inconsistency in Gödel's Ontological Theory (Extended Abstract, Sister Conferences).\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n In Helmert, M., & Wotawa, F., editor(s), KI 2016: Advances in Artificial Intelligence, Proceedings, of LNCS, pages 244-250, Berlin, Germany, 2016. Springer\n \n\n\n\n
\n\n\n\n \n \n \"An preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C60,\n  Address =\t {Berlin, Germany},\n  Author =\t {Christoph Benzm{\\"u}ller and Woltzenlogel Paleo,\n                  Bruno},\n  Booktitle =\t {KI 2016: Advances in Artificial Intelligence,\n                  Proceedings},\n  Editor =\t {Malte Helmert and Franz Wotawa},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Semantic Embedding, Higher Order Logic, Higher Order\n                  Modal Logic, Computational Metaphysics},\n  doi =\t\t {10.1007/978-3-319-46073-4},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {An Object-Logic Explanation for the Inconsistency in\n                  {G\\"odel's} Ontological Theory (Extended Abstract,\n                  Sister Conferences)},\n  url_preprint = {https://www.researchgate.net/publication/311455987},\n  Year =\t 2016,\n  Pages =\t {244-250}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Translating Higher-Order Modal Logic from RuleML to TPTP.\n \n \n\n\n \n Boley, H., Benzmüller, C., Luan, M., & Sha, Z.\n\n\n \n\n\n\n In Giurca, A., Van Woensel, W., Grütter, R., Teymourian, K., Athan, T., & Proctor, M., editor(s), Proceedings of the RuleML 2016 Challenge, the Special Industry Track and the RuleML 2016 Doctoral Consortium hosted by the 10th International Web Rule Symposium (RuleML 2016), volume Vol-1620, of CEUR Workshop Proceedings, 2016. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"TranslatingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C59,\n  Author =\t {Harold Boley and Christoph Benzm{\\"u}ller and Meng\n                  Luan and Zhendong Sha},\n  Booktitle =\t {Proceedings of the RuleML 2016 Challenge, the\n                  Special Industry Track and the RuleML 2016 Doctoral\n                  Consortium hosted by the 10th International Web Rule\n                  Symposium (RuleML 2016)},\n  Editor =\t {Giurca, A. and Van Woensel, W. and Gr{\\"u}tter,\n                  R. and Teymourian, K. and Athan, T. and Proctor, M.},\n  Keywords =\t {own, Higher Order Logic, Higher Order Modal Logic},\n  Issn =\t {1613-0073},\n  Publisher =\t {CEUR-WS.org},\n  Volume =\t {Vol-1620},\n  Series =\t {CEUR Workshop Proceedings},\n  Title =\t {Translating Higher-Order Modal Logic from {RuleML}\n                  to {TPTP}},\n  Url =\t\t {http://ceur-ws.org/Vol-1620/paper6.pdf},\n  Year =\t 2016\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n TPTP and Beyond: Representation of Quantified Non-Classical Logics.\n \n \n\n\n \n Wisniewski, M., Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n In Benzmüller, C., & Otten, J., editor(s), ARQNL 2016. Automated Reasoning in Quantified Non-Classical Logics, volume 1770, pages 51-65, 2016. CEUR Workshop Proceedings, http://ceur-ws.org\n \n\n\n\n
\n\n\n\n \n \n \"TPTPPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W56,\n  Author =\t {Max Wisniewski and Alexander Steen and Christoph\n                  Benzm{\\"u}ller},\n  Booktitle =\t {ARQNL 2016. Automated Reasoning in Quantified\n                  Non-Classical Logics},\n  Editor =\t {Christoph Benzm{\\"u}ller and Jens Otten},\n  Keywords =\t {own, Higher Order Logic, Higher Order Modal Logic},\n  Publisher =\t {CEUR Workshop Proceedings, http://ceur-ws.org},\n  Url =\t\t {http://ceur-ws.org/Vol-1770/},\n  Volume =\t 1770,\n  Title =\t {{TPTP} and Beyond: Representation of Quantified\n                  Non-Classical Logics},\n  Pages =\t {51-65},\n  Year =\t 2016\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Einsatz von Theorembeweisern in der Lehre.\n \n \n\n\n \n Wisniewski, M., Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n In Schwill, A., & Lucke, U., editor(s), Hochschuldidaktik der Informatik: 7. Fachtagung des GI-Fachbereichs Informatik und Ausbildung/Didaktik der Informatik; 13.-14. September 2016 an der Universität Potsdam, of Commentarii informaticae didacticae (CID), pages 81-92, Potsdam, Germany, 2016. Universitätsverlag Potsdam\n \n\n\n\n
\n\n\n\n \n \n \"EinsatzPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C58,\n  Address =\t {Potsdam, Germany},\n  Author =\t {Max Wisniewski and Alexander Steen and Christoph\n                  Benzm{\\"u}ller},\n  Editor =\t {Andreas Schwill and Ulrike Lucke},\n  Booktitle =\t {Hochschuldidaktik der Informatik: 7. Fachtagung des\n                  GI-Fachbereichs Informatik und Ausbildung/Didaktik\n                  der Informatik; 13.-14. September 2016 an der\n                  Universit{\\"a}t Potsdam},\n  Keywords =\t {own, Computational Metaphysics},\n  isbn =\t {978-3-86956-376-3},\n  issn =\t {1868-0844},\n  Publisher =\t {Universit{\\"a}tsverlag Potsdam},\n  Series =\t {Commentarii informaticae didacticae (CID)},\n  Title =\t {{Einsatz von Theorembeweisern in der Lehre}},\n  Pages =\t {81-92},\n  Url =\n                  {https://publishup.uni-potsdam.de/opus4-ubp/frontdoor/index/index/docId/9485},\n  Year =\t 2016\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Sweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic.\n \n \n\n\n \n Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n Logic and Logical Philosophy, 25: 535-554. 2016.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J33,\n  Author =\t {Steen, Alexander and Benzm{\\"u}ller, Christoph},\n  Journal =\t {Logic and Logical Philosophy},\n  Volume =\t 25,\n  Pages =\t {535-554},\n  Issn =\t {1425-3305},\n  Keywords =\t {own, Multi-Valued Logic, Semantic Embedding, Higher\n                  Order Logic, ERIH PLUS},\n  OPTurl =\t\t {http://christoph-benzmueller.de/papers/J33.pdf},\n  doi =\t\t {10.12775/LLP.2016.021},\n  Title =\t {Sweet {SIXTEEN}: Automation via Embedding into\n                  Classical Higher-Order Logic},\n  Year =\t 2016\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automating Free Logic in Isabelle/HOL.\n \n \n\n\n \n Benzmüller, C., & Scott, D. S.\n\n\n \n\n\n\n In Greuel, G., Koch, T., Paule, P., & Sommese, A., editor(s), Mathematical Software – ICMS 2016, 5th International Congress, Proceedings, volume 9725, of LNCS, pages 43-50, Berlin, Germany, 2016. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Automating preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C57,\n  Address =\t {Berlin, Germany},\n  Author =\t {Christoph Benzm{\\"u}ller and Scott, Dana S.},\n  Booktitle =\t {Mathematical Software -- ICMS 2016, 5th\n                  International Congress, Proceedings},\n  Editor =\t {G.-M. Greuel and T. Koch and P. Paule and\n                  A. Sommese},\n  Isbn =\t {978-3-319-42431-6},\n  Keywords =\t {own, Higher Order Logic, Automated Reasoning, LEO\n                  Prover},\n  doi =\t\t {10.1007/978-3-319-42432-3_6},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Automating Free Logic in {Isabelle/HOL}},\n  url_preprint = {http://christoph-benzmueller.de/papers/C57.pdf},\n  Volume =\t 9725,\n  Year =\t 2016,\n  Pages =\t {43-50},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Agent-Based HOL Reasoning.\n \n \n\n\n \n Steen, A., Wisniewski, M., & Benzmüller, C.\n\n\n \n\n\n\n In Greuel, G., Koch, T., Paule, P., & Sommese, A., editor(s), Mathematical Software – ICMS 2016, 5th International Congress, Proceedings, volume 9725, of LNCS, pages 75-81, Berlin, Germany, 2016. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Agent-Based preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C56,\n  Address =\t {Berlin, Germany},\n  Author =\t {Alexander Steen and Max Wisniewski and Christoph\n                  Benzm{\\"u}ller},\n  Booktitle =\t {Mathematical Software -- ICMS 2016, 5th\n                  International Congress, Proceedings},\n  Editor =\t {G.-M. Greuel and T. Koch and P. Paule and\n                  A. Sommese},\n  Isbn =\t {978-3-319-42431-6},\n  Keywords =\t {own, Higher Order Logic, Automated Reasoning, LEO\n                  Prover},\n  doi =\t\t {10.1007/978-3-319-42432-3_10},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Agent-Based {HOL} Reasoning},\n  url_preprint = {https://www.researchgate.net/publication/304919080},\n  Volume =\t 9725,\n  Year =\t 2016,\n  Pages =\t {75-81},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The Inconsistency in Gödel's Ontological Argument: A Success Story for AI in Metaphysics.\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n In Kambhampati, S., editor(s), IJCAI 2016, volume 1-3, pages 936-942, 2016. AAAI Press\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n \n \"The preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 13 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C55,\n  Author =\t {Christoph Benzm{\\"u}ller and Woltzenlogel Paleo,\n                  Bruno},\n  OPTNote =\t {(Acceptance rate $\\leq 25\\%$)},\n  Booktitle =\t {IJCAI 2016},\n  Comment =\t {<a href="http://christoph-benzmueller.de/papers/2016-IJCAI-Poster.pdf">poster</a>, <a href="http://www.ijcai.org/Proceedings/16/Papers/137.pdf">proceedings-version</a>},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic,\n                  Computational Metaphysics, DFG-2501-Selected},\n  publisher =\t {AAAI Press},\n  Volume =\t {1-3},\n  Editor =\t {Subbarao Kambhampati},\n  Title =\t {The Inconsistency in {G{\\"o}del's} Ontological\n                  Argument: A Success Story for {AI} in Metaphysics},\n  url =\t\t {http://www.ijcai.org/Proceedings/16/Papers/137.pdf},\n  url_preprint = {https://www.researchgate.net/publication/301295955},\n  Isbn =\t {978-1-57735-770-4},\n  Year =\t 2016,\n  Pages =\t {936-942},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Effective Normalization Techniques for HOL.\n \n \n\n\n \n Wisniewski, M., Steen, A., Kern, K., & Benzmüller, C.\n\n\n \n\n\n\n In Olivetti, N., & Tiwari, A., editor(s), Automated Reasoning — 8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 – July 2, 2016, Proceedings, volume 9706, of LNCS, pages 362-370, 2016. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Effective preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C54,\n  Author =\t {Max Wisniewski and Alexander Steen and Kim Kern and\n                  Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Automated Reasoning --- 8th International Joint\n                  Conference, IJCAR 2016, Coimbra, Portugal, June 27\n                  -- July 2, 2016, Proceedings},\n  Doi =\t\t {10.1007/978-3-319-40229-1_25},\n  Editor =\t {Nicola Olivetti and Ashish Tiwari},\n  Isbn =\t {978-3-319-40228-4},\n  Keywords =\t {own, Higher Order Logic, Automated Reasoning, LEO\n                  Prover},\n  Pages =\t {362-370},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Effective Normalization Techniques for {HOL}},\n  url_preprint = {http://christoph-benzmueller.de/papers/C54.pdf},\n  Volume =\t 9706,\n  Year =\t 2016,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The Modal Collapse as a Collapse of the Modal Square of Opposition.\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n In Béziau, J., & Basti, G., editor(s), The Square of Opposition: A Cornerstone of Thought (Collection of papers related to the World Congress on the Square of Opposition IV, Vatican, 2014), of Studies in Universal Logic, pages 307-313. Birkhäuser Basel, 2016.\n \n\n\n\n
\n\n\n\n \n \n \"ThePaper\n  \n \n \n \"The preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B15,\n  Author =\t {Benzm{\\"u}ller, Christoph and Woltzenlogel Paleo,\n                  Bruno},\n  Booktitle =\t {The Square of Opposition: A Cornerstone of Thought\n                  (Collection of papers related to the World Congress\n                  on the Square of Opposition IV, Vatican, 2014)},\n  url =\t\t {http://www.springer.com/us/book/9783319450612},\n  Doi =\t\t {10.1007/978-3-319-45062-9_18},\n  Pages =\t {307-313},\n  Editor =\t {B\\'{e}ziau, Jean-Yves and Basti, Gianfranco},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Semantic Embedding, Higher Order Logic, Higher Order\n                  Modal Logic, Computational Metaphysics},\n  Publisher =\t {Birkh\\"auser Basel},\n  Series =\t {Studies in Universal Logic},\n  Title =\t {The Modal Collapse as a Collapse of the Modal Square\n                  of Opposition},\n  url_preprint = {https://www.researchgate.net/publication/268211774},\n  Year =\t 2016,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Is it Reasonable to Employ Agents in Theorem Proving?.\n \n \n\n\n \n Wisniewski, M., & Benzmüller, C.\n\n\n \n\n\n\n In van den Heerik, J., & Filipe, J., editor(s), Proceedings of the 8th International Conference on Agents and Artificial Intelligence (ICAART 2016) – Volume 1, pages 281-286, volume 1, pages 281-286, Rome, Italy, 2016. SCITEPRESS – Science and Technology Publications, Lda\n \n\n\n\n
\n\n\n\n \n \n \"Is preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C53,\n  Address =\t {Rome, Italy},\n  Author =\t {Max Wisniewski and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Proceedings of the 8th International Conference on\n                  Agents and Artificial Intelligence (ICAART 2016) --\n                  Volume 1, pages 281-286},\n  Doi =\t\t {10.5220/0005824702810286},\n  Editor =\t {van den Heerik, Jan and Filipe, Joaquim},\n  Isbn =\t {978-989-758-172-4},\n  Keywords =\t {own, Automated Reasoning, LEO Prover, Higher Order\n                  Logic, Agents},\n  Pages =\t {281-286},\n  Publisher =\t {SCITEPRESS -- Science and Technology Publications,\n                  Lda},\n  Title =\t {Is it Reasonable to Employ Agents in Theorem\n                  Proving?},\n  url_preprint = {http://christoph-benzmueller.de/papers/C53.pdf},\n  Volume =\t 1,\n  Year =\t 2016,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (19)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n News — 25th International Conference on Automated Deduction (CADE-25).\n \n \n\n\n \n Benzmüller, C., Steen, A., & Wisniewski, M.\n\n\n \n\n\n\n Technical Report 2015.\n Künstliche Intelligenz 29(4):451-452; non-reviewed conference report\n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{J34,\n  Author =\t {Christoph Benzm{\\"u}ller and Alexander Steen and Max\n                  Wisniewski},\n  Title =\t {News --- 25th International Conference on Automated\n                  Deduction (CADE-25)},\n  doi =\t\t {10.1007/s13218-015-0402-z},\n  Year =\t 2015,\n  note =\t {K\\"unstliche Intelligenz 29(4):451-452; non-reviewed\n                  conference report},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computational Metaphysics.\n \n \n\n\n \n Benzmüller, C., Wisniewski, M., & Steen, A.\n\n\n \n\n\n\n 2015.\n This lecture course proposal received the 2015 central teaching award of FU Berlin\n\n\n\n
\n\n\n\n \n \n \"Computational preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R57,\n  Author =\t {Christoph Benzm{\\"u}ller and Max Wisniewski and\n                  Alexander Steen},\n  Keywords =\t {own, Computational Metaphysics},\n  Title =\t {{Computational Metaphysics}},\n  Note =\t {This lecture course proposal received the 2015\n                  central teaching award of FU Berlin},\n  url_preprint = {https://dx.doi.org/10.13140/RG.2.1.3535.2568},\n  Year =\t 2015,\n  doi =\t\t {10.13140/RG.2.1.3535.2568}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Experiments in Computational Metaphysics: Gödel's Proof of God's Existence.\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n In Mishram, S. C., Uppaluri, R., & Agarwal, V., editor(s), Science & Spiritual Quest, Proceedings of the 9th All India Students' Conference, 30th October – 1 November, 2015, IIT Kharagpur, India, pages 23-40, 2015. Bhaktivedanta Institute, Kolkata, ˘rlwww.binstitute.org\n (Invited paper)\n\n\n\n
\n\n\n\n \n \n \"Experiments preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C52,\n  Author =\t {Christoph Benzm{\\"u}ller and Woltzenlogel Paleo,\n                  Bruno},\n  Booktitle =\t {Science \\& Spiritual Quest, Proceedings of the 9th\n                  All India Students' Conference, 30th October -- 1\n                  November, 2015, IIT Kharagpur, India},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2015-AISSQ.pdf">slides</a>},\n  Editor =\t {Mishram, Subhash C. and Uppaluri, Ramgopal and\n                  Agarwal, Varun},\n  Keywords =\t {own, Higher Order Logic, Semantic Embedding, Modal\n                  Logics, Automated Reasoning, Ontology Reasoning,\n                  Computational Metaphysics},\n  Note =\t {(Invited paper)},\n  Pages =\t {23-40},\n  Publisher =\t {Bhaktivedanta Institute, Kolkata,\n                  \\url{www.binstitute.org}},\n  Title =\t {Experiments in Computational Metaphysics:\n                  {G\\"odel's} Proof of God's Existence},\n  url_preprint = {https://www.researchgate.net/publication/311587544},\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n There Is No Best Beta-Normalization Strategy for Higher-Order Reasoners.\n \n \n\n\n \n Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n In Davis, M., Fehnker, A., McIver, A., & Voronkov, A., editor(s), Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), volume 9450, of LNAI, pages 329-339, Suva, Fiji, 2015. Springer\n \n\n\n\n
\n\n\n\n \n \n \"There preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C51,\n  Address =\t {Suva, Fiji},\n  Author =\t {Alexander Steen and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Logic for Programming, Artificial Intelligence, and\n                  Reasoning (LPAR)},\n  Doi =\t\t {10.1007/978-3-662-48899-7_23},\n  Editor =\t {M. Davis and A. Fehnker and A. McIver and\n                  A. Voronkov},\n  Isbn =\t {978-3-662-48898-0},\n  Keywords =\t {own, Higher Order Logic, Automated Reasoning, LEO\n                  Prover},\n  Pages =\t {329-339},\n  Publisher =\t {Springer},\n  Series =\t {LNAI},\n  Title =\t {There Is No Best Beta-Normalization Strategy for\n                  Higher-Order Reasoners},\n  url_preprint = {http://christoph-benzmueller.de/papers/C51.pdf},\n  Volume =\t 9450,\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Invited Talk: On a (Quite) Universal Theorem Proving Approach and Its Application in Metaphysics.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Nivelle, H. D., editor(s), TABLEAUX 2015, volume 9323, of LNAI, pages 213-220, Wroclaw, Poland, 2015. Springer\n (Invited paper)\n\n\n\n
\n\n\n\n \n \n \"Invited preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C50,\n  Address =\t {Wroclaw, Poland},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {TABLEAUX 2015},\n  Doi =\t\t {10.1007/978-3-319-24312-2_15},\n  Editor =\t {Hans De Nivelle},\n  Keywords =\t {own, Higher Order Logic, Semantic Embedding,\n                  Automated Reasoning, Ontology Reasoning,\n                  Computational Metaphysics},\n  Note =\t {(Invited paper)},\n  Pages =\t {213-220},\n  Publisher =\t {Springer},\n  Series =\t {LNAI},\n  Title =\t {Invited Talk: On a (Quite) Universal Theorem Proving\n                  Approach and Its Application in Metaphysics},\n  url_preprint = {http://christoph-benzmueller.de/papers/C50.pdf},\n  Volume =\t 9323,\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Sweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic.\n \n \n\n\n \n Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n In 7th International Conference Non-Classical Logic – Theory and Applications, Torun, Poland, 2015. \n \n\n\n\n
\n\n\n\n \n \n \"Sweet preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C49,\n  Author =\t {Alexander Steen and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {7th International Conference Non-Classical Logic --\n                  Theory and Applications, Torun, Poland},\n  Keywords =\t {own, Higher Order Logic, Semantic Embedding, Multi\n                  Valued Logics, Automated Reasoning},\n  Title =\t {Sweet SIXTEEN: Automation via Embedding into\n                  Classical Higher-Order Logic},\n  url_preprint = {http://christoph-benzmueller.de/papers/C49.pdf},\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The Higher-Order Prover LEO-II.\n \n \n\n\n \n Benzmüller, C., Sultana, N., Paulson, L. C., & Theiss, F.\n\n\n \n\n\n\n Journal of Automated Reasoning, 55(4): 389-404. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"The preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J30,\n  Author =\t {Christoph Benzm{\\"u}ller and Nik Sultana and\n                  Paulson, Lawrence C. and Frank Theiss},\n  Doi =\t\t {10.1007/s10817-015-9348-y},\n  Journal =\t {Journal of Automated Reasoning},\n  publisher =\t {Springer Netherlands},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic,\n                  DFG-2501-Selected},\n  Number =\t 4,\n  Pages =\t {389-404},\n  Title =\t {The Higher-Order Prover {LEO-II}},\n  url_preprint = {https://www.researchgate.net/publication/280986731},\n  Volume =\t 55,\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Proofs and reconstructions.\n \n \n\n\n \n Sultana, N., Benzmüller, C., & Paulson, L. C.\n\n\n \n\n\n\n In Lutz, C., & Ranise, S., editor(s), FroCoS 2015, volume 9322, of LNAI, pages 256-271, Wroclaw, Poland, 2015. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Proofs preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C48,\n  Address =\t {Wroclaw, Poland},\n  Author =\t {Nik Sultana and Christoph Benzm{\\"u}ller and\n                  Paulson, Lawrence C.},\n  Booktitle =\t {FroCoS 2015},\n  Doi =\t\t {10.1007/978-3-319-24246-0_16},\n  Editor =\t {Carsten Lutz and Silvio Ranise},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic},\n  Pages =\t {256-271},\n  Publisher =\t {Springer},\n  Series =\t {LNAI},\n  Title =\t {Proofs and reconstructions},\n  url_preprint = {http://christoph-benzmueller.de/papers/C48.pdf},\n  Volume =\t 9322,\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Systematic Verification of the Modal Logic Cube in Isabelle/HOL.\n \n \n\n\n \n Benzmüller, C., Claus, M., & Sultana, N.\n\n\n \n\n\n\n In Kaliszyk, C., & Paskevich, A., editor(s), PxTP 2015, volume 186, pages 27-41, Berlin, Germany, 2015. EPTCS\n \n\n\n\n
\n\n\n\n \n \n \"Systematic preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C47,\n  Address =\t {Berlin, Germany},\n  Author =\t {Christoph Benzm{\\"u}ller and Maximilian Claus and\n                  Nik Sultana},\n  Booktitle =\t {PxTP 2015},\n  Comment =\t {<a href="http://christoph-benzmueller.de/papers/2015-PxTP.pdf">slides</a>},\n  Doi =\t\t {10.4204/EPTCS.186.5},\n  Editor =\t {Cezary Kaliszyk and Andrei Paskevich},\n  Issn =\t {2075-2180},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic},\n  Pages =\t {27-41},\n  Publisher =\t {EPTCS},\n  Title =\t {Systematic Verification of the Modal Logic Cube in\n                  {Isabelle/HOL}},\n  url_preprint = {http://christoph-benzmueller.de/papers/C47.pdf},\n  Volume =\t 186,\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Higher-Order Modal Logics: Automation and Applications.\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n In Paschke, A., & Faber, W., editor(s), Reasoning Web 2015, of LNCS, pages 32-74, Berlin, Germany, 2015. Springer\n (Invited paper)\n\n\n\n
\n\n\n\n \n \n \"Higher-Order preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C46,\n  Address =\t {Berlin, Germany},\n  Author =\t {Christoph Benzm{\\"u}ller and Woltzenlogel Paleo,\n                  Bruno},\n  Booktitle =\t {Reasoning Web 2015},\n  Doi =\t\t {10.1007/978-3-319-21768-0_2},\n  Editor =\t {Adrian Paschke and Wolfgang Faber},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic,\n                  Computational Metaphysics},\n  Note =\t {(Invited paper)},\n  Number =\t 9203,\n  Pages =\t {32-74},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Higher-Order Modal Logics: Automation and\n                  Applications},\n  url_preprint = {https://www.researchgate.net/publication/281677232},\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n LeoPARD - A Generic Platform for the Implementation of Higher-Order Reasoners.\n \n \n\n\n \n Wisniewski, M., Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n In Kerber, M., Carette, J., Kaliszyk, C., Rabe, F., & Sorge, V., editor(s), Intelligent Computer Mathematics - International Conference, CICM 2015, Washington, DC, USA, July 13-17, 2015, Proceedings, volume 9150, of LNCS, pages 325–330, 2015. Springer\n \n\n\n\n
\n\n\n\n \n \n \"LeoPARD preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C45,\n  Author =\t {Max Wisniewski and Alexander Steen and Christoph\n                  Benzm{\\"{u}}ller},\n  Booktitle =\t {Intelligent Computer Mathematics - International\n                  Conference, {CICM} 2015, Washington, DC, USA, July\n                  13-17, 2015, Proceedings},\n  Doi =\t\t {10.1007/978-3-319-20615-8_22},\n  Editor =\t {Manfred Kerber and Jacques Carette and Cezary\n                  Kaliszyk and Florian Rabe and Volker Sorge},\n  Keywords =\t {own, Automated Reasoning, LEO Prover, Higher Order\n                  Logic, Agents},\n  Pages =\t {325--330},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {LeoPARD - {A} Generic Platform for the\n                  Implementation of Higher-Order Reasoners},\n  url_preprint = {http://christoph-benzmueller.de/papers/C45.pdf},\n  Volume =\t 9150,\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n LeoPARD — A Generic Platform for the Implementation of Higher-Order Reasoners.\n \n \n\n\n \n Wisniewski, M., Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n 2015.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"LeoPARDPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{C45arxiv,\n  doi =\t\t {10.48550/ARXIV.1505.01629},\n  url =\t\t {https://arxiv.org/abs/1505.01629},\n  author =\t {Wisniewski, Max and Steen, Alexander and\n                  Benzm{\\"u}ller, Christoph},\n  title =\t {LeoPARD --- A Generic Platform for the\n                  Implementation of Higher-Order Reasoners},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2015,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Interacting with Modal Logics in the Coq Proof Assistant.\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n In Beklemishev, L. D., & Musatov, D. V., editor(s), Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings, volume 9139, of LNCS, pages 398–411, 2015. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Interacting preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C44,\n  Author =\t {Christoph Benzm{\\"{u}}ller and Woltzenlogel Paleo,\n                  Bruno},\n  Booktitle =\t {Computer Science - Theory and Applications - 10th\n                  International Computer Science Symposium in Russia,\n                  {CSR} 2015, Listvyanka, Russia, July 13-17, 2015,\n                  Proceedings},\n  Doi =\t\t {10.1007/978-3-319-20297-6_25},\n  Editor =\t {Lev D. Beklemishev and Daniil V. Musatov},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic,\n                  Computational Metaphysics},\n  Pages =\t {398--411},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Interacting with Modal Logics in the {Coq} Proof\n                  Assistant},\n  url_preprint = {https://www.researchgate.net/publication/273201458},\n  Volume =\t 9139,\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Gödel's Ontological Argument Revisited – Findings from a Computer-supported Analysis (invited).\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Silvestre, R. S., & Béziau, J., editor(s), Handbook of the 1st World Congress on Logic and Religion, João Pessoa, Brazil, pages 13, 2015. \n (Invited abstract)\n\n\n\n
\n\n\n\n \n \n \"Gödel'sPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C42,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Handbook of the 1st World Congress on Logic and\n                  Religion, Jo\\~ao Pessoa, Brazil},\n  Editor =\t {Ricardo Souza Silvestre and Jean-Yves B\\'eziau},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic,\n                  Computational Metaphysics},\n  Note =\t {(Invited abstract)},\n  Pages =\t 13,\n  Title =\t {{G\\"{o}del's} Ontological Argument Revisited --\n                  Findings from a Computer-supported Analysis\n                  (invited)},\n  Url =\n                  {http://christoph-benzmueller.de/papers/2015-handbook-logic-and-religion.pdf},\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computer-Assisted Analysis of the Anderson-Hájek Ontological Controversy.\n \n \n\n\n \n Benzmüller, C., Weber, L., & Paleo, B. W.\n\n\n \n\n\n\n In Silvestre, R. S., & Béziau, J., editor(s), Handbook of the 1st World Congress on Logic and Religion, Joao Pessoa, Brazil, pages 53-54, 2015. \n (superseded by 2016 paper in Logica Universalis)\n\n\n\n
\n\n\n\n \n \n \"Computer-AssistedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C41,\n  Author =\t {Christoph Benzm{\\"u}ller and Leon Weber and Bruno\n                  Woltzenlogel Paleo},\n  Booktitle =\t {Handbook of the 1st World Congress on Logic and\n                  Religion, Joao Pessoa, Brazil},\n  Editor =\t {Ricardo Souza Silvestre and Jean-Yves B\\'eziau},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic,\n                  Computational Metaphysics},\n  Note =\t {(superseded by 2016 paper in Logica Universalis)},\n  Pages =\t {53-54},\n  Title =\t {Computer-Assisted Analysis of the\n                  {Anderson-H\\'{a}jek} Ontological Controversy},\n  Url =\n                  {http://christoph-benzmueller.de/papers/2015-handbook-logic-and-religion.pdf},\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n On Logic Embeddings and Gödel's God.\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n In Codescu, M., Diaconescu, R., & Tutu, I., editor(s), Recent Trends in Algebraic Development Techniques: 22nd International Workshop, WADT 2014, Sinaia, Romania, September 4-7, 2014, Revised Selected Papers, of LNCS, pages 3-6, Sinaia, Romania, 2015. Springer\n (Invited paper)\n\n\n\n
\n\n\n\n \n \n \"On preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W55,\n  Address =\t {Sinaia, Romania},\n  Author =\t {Christoph Benzm{\\"u}ller and Woltzenlogel Paleo,\n                  Bruno},\n  Booktitle =\t {Recent Trends in Algebraic Development Techniques:\n                  22nd International Workshop, WADT 2014, Sinaia,\n                  Romania, September 4-7, 2014, Revised Selected\n                  Papers},\n  Doi =\t\t {10.1007/978-3-319-28114-8_1},\n  Editor =\t {Codescu, Mihai and Diaconescu, Razvan and Tutu,\n                  Ionut},\n  Isbn =\t {978-3-319-28114-8},\n  Keywords =\t {own, Higher Order Logic, Semantic Embedding, Modal\n                  Logics, Automated Reasoning, Computational\n                  Metaphysics},\n  Note =\t {(Invited paper)},\n  Number =\t 9563,\n  Pages =\t {3-6},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {On Logic Embeddings and {G\\"odel's} {God}},\n  url_preprint = {https://www.researchgate.net/publication/300112614},\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n ARQNL 2014. Automated Reasoning in Quantified Non-Classical Logics.\n \n \n\n\n \n Benzmüller, C., & Otten, J.,\n editors.\n \n\n\n \n\n\n\n Volume 33, of EPiC Series in Computing.EasyChair. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"ARQNLPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{E14,\n  Comment =\t {<a href="http://www.iltp.de/ARQNL-2014/">event-website</a>},\n  Editor =\t {Christoph Benzm{\\"u}ller and Jens Otten},\n  issn =\t {2398-7340},\n  Pages =\t {1-86},\n  Publisher =\t {EasyChair},\n  Series =\t {EPiC Series in Computing},\n  Title =\t {ARQNL 2014. Automated Reasoning in Quantified\n                  Non-Classical Logics},\n  Url =\n                  {https://easychair.org/publications/volume/ARQNL_2014/},\n  Volume =\t 33,\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n HOL Provers for First-order Modal Logics — Experiments.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Benzmüller, C., & Otten, J., editor(s), ARQNL 2014. Automated Reasoning in Quantified Non-Classical Logics, volume 33, of EPiC Series in Computing, pages 37-41, 2015. EasyChair\n \n\n\n\n
\n\n\n\n \n \n \"HOLPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W54,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {ARQNL 2014. Automated Reasoning in Quantified\n                  Non-Classical Logics},\n  Editor =\t {Christoph Benzm{\\"u}ller and Jens Otten},\n  issn =\t {2398-7340},\n  Keywords =\t {own, LEO Prover, Automated Reasoning, Proof\n                  Transformation, Higher Order Logic},\n  Pages =\t {37-41},\n  Publisher =\t {EasyChair},\n  Series =\t {EPiC Series in Computing},\n  Title =\t {{HOL} Provers for First-order Modal Logics ---\n                  Experiments},\n  Url =\t\t {https://easychair.org/publications/paper/sdnL},\n  Volume =\t 33,\n  Year =\t 2015,\n  Doi =\t\t {10.29007/przw},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Higher-Order Automated Theorem Provers.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Delahaye, D., & Woltzenlogel Paleo, B., editor(s), All about Proofs, Proof for All, of Mathematical Logic and Foundations, pages 171-214. College Publications, London, UK, 2015.\n \n\n\n\n
\n\n\n\n \n \n \"Higher-Order preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B14,\n  Address =\t {London, UK},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {All about Proofs, Proof for All},\n  Comment =\t {<a href="http://www.collegepublications.co.uk/logic/mlf/?00023">publisher</a>},\n  Editor =\t {David Delahaye and Woltzenlogel Paleo, Bruno},\n  Isbn =\t {978-1-84890-166-7},\n  Keywords =\t {own, Automated Reasoning, Higher Order Logic},\n  Pages =\t {171-214},\n  Publisher =\t {College Publications},\n  Series =\t {Mathematical Logic and Foundations},\n  Title =\t {Higher-Order Automated Theorem Provers},\n  url_preprint = {http://christoph-benzmueller.de/papers/B14.pdf},\n  Year =\t 2015,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Modal Logic in Coq and Scott's Version of Gödel's Proof of God's Existence (Rough Diamond Proof Pearl).\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n 2014.\n (Non-reviewed, superseded by CSR-2015 paper)\n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@misc{C43,\n  Author =\t {Christoph Benzm{\\"u}ller and Woltzenlogel Paleo,\n                  Bruno},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic,\n                  Computational Metaphysics},\n  Note =\t {(Non-reviewed, superseded by CSR-2015 paper)},\n  Title =\t {Modal Logic in Coq and Scott's Version of\n                  {G\\"odel's} Proof of {God}'s Existence (Rough\n                  Diamond Proof Pearl)},\n  Year =\t 2014\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Proceedings of the 11th International Workshop on User Interfaces for Theorem Provers (UITP 2014), Vienna, Austria.\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.,\n editors.\n \n\n\n \n\n\n\n Volume 167, of Electronic Proceedings in Theoretical Computer Science (EPTCS). 2014.\n \n\n\n\n
\n\n\n\n \n \n \"ProceedingsPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{E13,\n  Doi =\t\t {10.4204/EPTCS.167},\n  Editor =\t {Benzm{\\"u}ller, Christoph and Woltzenlogel Paleo,\n                  Bruno},\n  Issn =\t {2075-2180},\n  Pages =\t {1-94},\n  Series =\t {Electronic Proceedings in Theoretical Computer\n                  Science (EPTCS)},\n  Title =\t {Proceedings of the 11th International Workshop on\n                  User Interfaces for Theorem Provers (UITP 2014),\n                  Vienna, Austria},\n  Url =\n                  {http://eptcs.web.cse.unsw.edu.au/content.cgi?UITP2014},\n  Volume =\t 167,\n  Year =\t 2014,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The Leo-III Project.\n \n \n\n\n \n Wisniewski, M., Steen, A., & Benzmüller, C.\n\n\n \n\n\n\n In Bolotov, A., & Kerber, M., editor(s), Joint Automated Reasoning Workshop and Deduktionstreffen, pages 38, 2014. \n \n\n\n\n
\n\n\n\n \n \n \"The preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W53,\n  Author =\t {Max Wisniewski and Alexander Steen and Christoph\n                  Benzm{\\"u}ller},\n  Booktitle =\t {Joint Automated Reasoning Workshop and\n                  Deduktionstreffen},\n  Editor =\t {Alexander Bolotov and Manfred Kerber},\n  Keywords =\t {own, LEO Prover, Automated Reasoning, Proof\n                  Transformation, Higher OrderLogic},\n  Pages =\t 38,\n  Title =\t {The {Leo-III} Project},\n  url_preprint = {http://christoph-benzmueller.de/papers/W53.pdf},\n  Year =\t 2014,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automating Gödel's Ontological Proof of God's Existence with Higher-order Automated Theorem Provers.\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n In Schaub, T., Friedrich, G., & O'Sullivan, B., editor(s), ECAI 2014, volume 263, of Frontiers in Artificial Intelligence and Applications, pages 93 – 98, 2014. IOS Press\n (Acceptance rate $≤ 28%$)\n\n\n\n
\n\n\n\n \n \n \"Automating preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C40,\n  Author =\t {Christoph Benzm{\\"u}ller and Woltzenlogel Paleo,\n                  Bruno},\n  Note =\t {(Acceptance rate $\\leq 28\\%$)},\n  Booktitle =\t {ECAI 2014},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2014-ECAI.pdf">slides</a>},\n  Doi =\t\t {10.3233/978-1-61499-419-0-93},\n  Editor =\t {Torsten Schaub and Gerhard Friedrich and Barry\n                  O'Sullivan},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic,\n                  Computational Metaphysics, DFG-2501-Selected},\n  Pages =\t {93 -- 98},\n  Publisher =\t {IOS Press},\n  Series =\t {Frontiers in Artificial Intelligence and\n                  Applications},\n  Title =\t {Automating {G\\"{o}del's} Ontological Proof of\n                  {God}'s Existence with Higher-order Automated\n                  Theorem Provers},\n  url_preprint = {https://www.researchgate.net/publication/265050231},\n  Volume =\t 263,\n  Year =\t 2014,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automation of Higher-Order Logic.\n \n \n\n\n \n Benzmüller, C., & Miller, D.\n\n\n \n\n\n\n In Gabbay, D. M., Siekmann, J. H., & Woods, J., editor(s), Handbook of the History of Logic, Volume 9 — Computational Logic, pages 215-254. North Holland, Elsevier, 2014.\n \n\n\n\n
\n\n\n\n \n \n \"Automation preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B5,\n  Author =\t {Christoph Benzm{\\"u}ller and Dale Miller},\n  Booktitle =\t {Handbook of the History of Logic, Volume 9 ---\n                  Computational Logic},\n  Doi =\t\t {10.1016/B978-0-444-51624-4.50005-8},\n  Editor =\t {Gabbay, Dov M. and Siekmann, J\\"org H. and Woods,\n                  John},\n  Isbn =\t {978-0-444-51624-4},\n  Keywords =\t {own, Automated Reasoning, Higher Order Logic,\n                  History of Logic, DFG-2501-Selected},\n  Pages =\t {215-254},\n  Publisher =\t {North Holland, Elsevier},\n  Title =\t {Automation of Higher-Order Logic},\n  url_preprint = {http://christoph-benzmueller.de/papers/B5.pdf},\n  Year =\t 2014,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Gödel's Proof of God's Existence.\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n In Beziau, J., & Gan-Krzywoszynska, K., editor(s), Handbook of the World Congress on the Square of Opposition IV, pages 22-23, 2014. \n (superseded by ECAI-2014 paper)\n\n\n\n
\n\n\n\n \n \n \"Gödel'sPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C39,\n  Author =\t {Christoph Benzm{\\"u}ller and Woltzenlogel Paleo,\n                  Bruno},\n  Booktitle =\t {Handbook of the World Congress on the Square of\n                  Opposition IV},\n  Editor =\t {Jean-Yves Beziau and Katarzyna Gan-Krzywoszynska},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic,\n                  Computational Metaphysics},\n  Note =\t {(superseded by ECAI-2014 paper)},\n  Pages =\t {22-23},\n  Title =\t {{G\\"odel's} Proof of {God's} Existence},\n  Url =\n                  {http://www.stoqatpul.org/lat/materials/hand_square2014.pdf},\n  Year =\t 2014,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (16)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Formalization, Mechanization and Automation of Gödel's Proof of God's Existence.\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n Technical Report 2013.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"Formalization,Paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R56,\n  Author =\t {Christoph Benzm{\\"u}ller and Woltzenlogel Paleo,\n                  Bruno},\n  Comment =\t {<a href="https://github.com/FormalTheology/GoedelGod">complete-formalisation</a>},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  Title =\t {Formalization, Mechanization and Automation of\n                  {G{\\"o}del's} Proof of {God's} Existence},\n  Url =\t\t {http://arxiv.org/abs/1308.4526},\n  Doi =\t\t {10.48550/arXiv.1308.4526},\n  Year =\t 2013,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Update report: LEO-II version 1.5.\n \n \n\n\n \n Benzmüller, C., & Sultana, N.\n\n\n \n\n\n\n 2013.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"UpdatePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R55,\n  doi =\t\t {10.48550/ARXIV.1303.3761},\n  url =\t\t {https://arxiv.org/abs/1303.3761},\n  author =\t {Benzm{\\"u}ller, Christoph and Sultana, Nik},\n  title =\t {Update report: LEO-II version 1.5},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2013,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Gödel's God in Isabelle/HOL.\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n Archive of Formal Proofs,1–5. 2013.\n Note: data publication\n\n\n\n
\n\n\n\n \n \n \"Gödel'sPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J28,\n  Author =\t {Christoph Benzm{\\"u}ller and Woltzenlogel Paleo,\n                  Bruno},\n  Journal =\t {Archive of Formal Proofs},\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic,\n                  Computational Metaphysics},\n  Note =\t {Note: data publication},\n  Title =\t {{G{\\"o}del's God in Isabelle/HOL}},\n  Url =\t\t {http://afp.sourceforge.net/entries/GoedelGod.shtml},\n  Year =\t 2013,\n  Pages =\t {1--5},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Cut-free Calculi for Challenge Logics in a Lazy Way.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Clint van Alten, P. C., editor(s), Proceedings of the International Workshop on Algebraic Logic in Computer Science, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"Cut-free preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W51,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Proceedings of the International Workshop on\n                  Algebraic Logic in Computer Science},\n  Comment =\t {<a href="http://www2.cs.cas.cz/~cintula/lpar-workshop-ALCS.html">event-website</a>},\n  Editor =\t {Clint van Alten, Petr Cintula, Carles Noguera},\n  Title =\t {Cut-free Calculi for Challenge Logics in a Lazy Way},\n  url_preprint = {http://christoph-benzmueller.de/papers/W51.pdf},\n  Year =\t 2013,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Gödel's God on the Computer.\n \n \n\n\n \n Benzmüller, C., & Woltzenlogel Paleo, B.\n\n\n \n\n\n\n In Schulz, S., Sutcliffe, G., & Konev, B., editor(s), Proceedings of the 10th International Workshop on the Implementation of Logics, 2013. \n (Invited paper)\n\n\n\n
\n\n\n\n \n \n \"Gödel's preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W50,\n  Author =\t {Christoph Benzm{\\"u}ller and Woltzenlogel Paleo,\n                  Bruno},\n  Booktitle =\t {Proceedings of the 10th International Workshop on\n                  the Implementation of Logics},\n  Comment =\t {<a href="http://www.eprover.org/EVENTS/IWIL-2013.html">event-website</a>},\n  Editor =\t {Schulz, S. and Sutcliffe, G. and Konev, B.},\n  Note =\t {(Invited paper)},\n  Title =\t {{G\\"odel's} {God} on the Computer},\n  url_preprint = {http://christoph-benzmueller.de/papers/W50.pdf},\n  Year =\t 2013,\n  Keywords =\t {own, Automated Reasoning, Interactive Proof,\n                  Ontology Reasoning, LEO Prover, Higher Order Logic,\n                  Computational Metaphysics},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n HOL based First-order Modal Logic Provers.\n \n \n\n\n \n Benzmüller, C., & Raths, T.\n\n\n \n\n\n\n In McMillan, K. L., Middeldorp, A., & Voronkov, A., editor(s), Proceedings of the 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR), volume 8312, of LNCS, pages 127-136, Stellenbosch, South Africa, 2013. Springer\n \n\n\n\n
\n\n\n\n \n \n \"HOL preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C38,\n  Address =\t {Stellenbosch, South Africa},\n  Author =\t {Christoph Benzm{\\"u}ller and Thomas Raths},\n  Booktitle =\t {Proceedings of the 19th International Conference on\n                  Logic for Programming, Artificial Intelligence and\n                  Reasoning (LPAR)},\n  Doi =\t\t {10.1007/978-3-642-45221-5_9},\n  Editor =\t {Kenneth L. McMillan and Aart Middeldorp and Andrei\n                  Voronkov},\n  Isbn =\t {978-3-642-45220-8},\n  Keywords =\t {own, Higher Order Logic, Semantic Embedding, Modal\n                  Logics, Automated Reasoning},\n  Pages =\t {127-136},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {{HOL} based First-order Modal Logic Provers},\n  url_preprint = {http://christoph-benzmueller.de/papers/C38.pdf},\n  Volume =\t 8312,\n  Year =\t 2013,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n CADE 2015 in Berlin: A Proposal.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n 2013.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R54,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, Automated Reasoning},\n  Title =\t {{CADE 2015 in Berlin: A Proposal}},\n  Year =\t 2013\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automated Consistency Checking of Expressive Ontologies — Beware of the Wrong Interpretation of Success!.\n \n \n\n\n \n Benzmüller, C., & Ziener, M.\n\n\n \n\n\n\n In Fink, M., Homola, M., Mileo, A., & Varzinczak, I. J., editor(s), The 5th International Workshop on Acquisition, Representation and Reasoning with Contextualized Knowledge (ARCOE-LogIC 2013), Corunna, Spain, 2013. \n \n\n\n\n
\n\n\n\n \n \n \"Automated preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W49,\n  Address =\t {Corunna, Spain},\n  Author =\t {Christoph Benzm{\\"u}ller and Marco Ziener},\n  Booktitle =\t {The 5th International Workshop on Acquisition,\n                  Representation and Reasoning with Contextualized\n                  Knowledge (ARCOE-LogIC 2013)},\n  Editor =\t {Michael Fink and Martin Homola and Alessandra Mileo\n                  and Ivan Jose Varzinczak},\n  Keywords =\t {own, Automated Reasoning, Ontology Reasoning, LEO\n                  Prover, Higher Order Logic},\n  Title =\t {Automated Consistency Checking of Expressive\n                  Ontologies --- Beware of the Wrong Interpretation of\n                  Success!},\n  url_preprint = {http://christoph-benzmueller.de/papers/W49.pdf},\n  Year =\t 2013,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automating Quantified Conditional Logics in HOL.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Rossi, F., editor(s), 23rd International Joint Conference on Artificial Intelligence (IJCAI-13), pages 746-753, Beijing, China, 2013. AAAI Press\n \n\n\n\n
\n\n\n\n \n \n \"Automating preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C37,\n  Address =\t {Beijing, China},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {23rd International Joint Conference on Artificial\n                  Intelligence (IJCAI-13)},\n  Comment =\t {<a href="http://christoph-benzmueller.de/papers/2013-IJCAI-Poster.pdf">poster</a>},\n  Editor =\t {Francesca Rossi},\n  Publisher =\t {AAAI Press},\n  Isbn =\t {978-1-57735-633-2},\n  Keywords =\t {own, Higher Order Logic, LEO Prover, Semantic\n                  Embedding, Conditional Logics, Combinations of\n                  Logics},\n  Pages =\t {746-753},\n  Title =\t {Automating Quantified Conditional Logics in {HOL}},\n  url_preprint = {http://christoph-benzmueller.de/papers/C37.pdf},\n  Year =\t 2013,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n LEO-II Version 1.5.\n \n \n\n\n \n Benzmüller, C., & Sultana, N.\n\n\n \n\n\n\n In Blanchette, J. C., & Urban, J., editor(s), PxTP 2013, volume 14, of EPiC Series in Computing, pages 2-10, 2013. EasyChair\n \n\n\n\n
\n\n\n\n \n \n \"LEO-IIPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W52,\n  Author =\t {Christoph Benzm{\\"u}ller and Nik Sultana},\n  Booktitle =\t {PxTP 2013},\n  Editor =\t {Jasmin Christian Blanchette and Josef Urban},\n  issn =\t {2398-7340},\n  Keywords =\t {own, LEO Prover, Automated Reasoning, Proof\n                  Transformation, Higher Order Logic},\n  Pages =\t {2-10},\n  Publisher =\t {EasyChair},\n  Series =\t {EPiC Series in Computing},\n  Title =\t {{LEO-II} Version 1.5},\n  Url =\n                  {http://www.easychair.org/publications/?page=1802176591},\n  Volume =\t 14,\n  Year =\t 2013,\n  Doi =\t\t {10.29007/lbxw},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Top-down Approach to Combining Logics.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Filipe, J., & Fred, A., editor(s), Proc. of the 5th International Conference on Agents and Artificial Intelligence (ICAART), volume 1, pages 346-351, Barcelona, Spain, 2013. SCITEPRESS – Science and Technology Publications, Lda\n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C35,\n  Address =\t {Barcelona, Spain},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Proc. of the 5th International Conference on Agents\n                  and Artificial Intelligence (ICAART)},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2013-ICAART.pdf">slides</a>},\n  Doi =\t\t {10.5220/0004324803460351},\n  Editor =\t {Joaquim Filipe and Ana Fred},\n  Keywords =\t {own, Higher Order Logic, Semantic Embedding, Modal\n                  Logics, Combinations of Logics},\n  Pages =\t {346-351},\n  Publisher =\t {SCITEPRESS -- Science and Technology Publications,\n                  Lda},\n  Title =\t {A Top-down Approach to Combining Logics},\n  url_preprint = {http://christoph-benzmueller.de/papers/C35.pdf},\n  Volume =\t 1,\n  Year =\t 2013,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n HOL based Universal Reasoning.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Beziau, J., Buchsbaum, A., Costa-Leite, A., & Altair, A., editor(s), Handbook of the 4th World Congress and School on Universal Logic, pages 232-233, Rio de Janeiro, Brazil, 2013. \n (Superseded by ICAART-2013 paper)\n\n\n\n
\n\n\n\n \n \n \"HOL preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C36,\n  Address =\t {Rio de Janeiro, Brazil},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Handbook of the 4th World Congress and School on\n                  Universal Logic},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2013-RIO.pdf">slides</a>},\n  Editor =\t {J.Y. Beziau and A. Buchsbaum and A. Costa-Leite and\n                  A. Altair},\n  Isbn =\t {978-85-400-0682-9},\n  Keywords =\t {own, Higher Order Logic, LEO Prover, Semantic\n                  Embedding, Modal Logics, Combinations of Logics},\n  Note =\t {(Superseded by ICAART-2013 paper)},\n  Pages =\t {232-233},\n  Title =\t {{HOL} based Universal Reasoning},\n  url_preprint = {http://christoph-benzmueller.de/papers/C36.pdf},\n  Year =\t 2013,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Quantified Multimodal Logics in Simple Type Theory.\n \n \n\n\n \n Benzmüller, C., & Paulson, L. C.\n\n\n \n\n\n\n Logica Universalis (Special Issue on Multimodal Logics), 7(1): 7-20. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"Quantified preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J23,\n  Author =\t {Christoph Benzm{\\"u}ller and Paulson, Lawrence C.},\n  Doi =\t\t {10.1007/s11787-012-0052-y},\n  Journal =\t {Logica Universalis (Special Issue on Multimodal\n                  Logics)},\n  Keywords =\t {own, Higher Order Logic, Semantic Embedding, Modal\n                  Logics, Henkin Semantics},\n  Number =\t 1,\n  Pages =\t {7-20},\n  Title =\t {Quantified Multimodal Logics in Simple Type Theory},\n  url_preprint = {https://www.researchgate.net/publication/221677897},\n  Volume =\t 7,\n  Year =\t 2013,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Sigma: An Integrated Development Environment for Formal Ontology.\n \n \n\n\n \n Pease, A., & Benzmüller, C.\n\n\n \n\n\n\n AI Communications (Special Issue on Intelligent Engineering Techniques for Knowledge Bases), 26(1): 79-97. 2013.\n \n\n\n\n
\n\n\n\n \n \n \"Sigma: preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J24,\n  Author =\t {Adam Pease and Christoph Benzm{\\"u}ller},\n  Doi =\t\t {10.3233/AIC-120549},\n  Journal =\t {AI Communications (Special Issue on Intelligent\n                  Engineering Techniques for Knowledge Bases)},\n  Keywords =\t {own, Ontology Reasoning, System Integration,\n                  Automated Reasoning},\n  Number =\t 1,\n  Pages =\t {79-97},\n  Title =\t {Sigma: An Integrated Development Environment for\n                  Formal Ontology},\n  url_preprint = {http://christoph-benzmueller.de/papers/J24.pdf},\n  Volume =\t 26,\n  Year =\t 2013,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Understanding LEO-II's Proofs.\n \n \n\n\n \n Sultana, N., & Benzmüller, C.\n\n\n \n\n\n\n In Korovin, K., Schulz, S., & Ternovska, E., editor(s), IWIL 2012, volume 22, of EPiC Series in Computing, pages 33-52, Merida, Venezuela, 2013. EasyChair\n \n\n\n\n
\n\n\n\n \n \n \"UnderstandingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W47,\n  Address =\t {Merida, Venezuela},\n  Author =\t {Nik Sultana and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {IWIL 2012},\n  Editor =\t {Konstantin Korovin and Stephan Schulz and Eugenia\n                  Ternovska},\n  issn =\t {2398-7340},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Automated\n                  Reasoning, Henkin Semantics, System Integration},\n  Pages =\t {33-52},\n  Publisher =\t {EasyChair},\n  Series =\t {EPiC Series in Computing},\n  Title =\t {Understanding {LEO-II's} Proofs},\n  Url =\n                  {http://www.easychair.org/publications/?page=572811915},\n  Volume =\t 22,\n  Year =\t 2013,\n  Doi =\t\t {10.29007/x9c9},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Implementing Different Proof Calculi for First-order Modal Logics.\n \n \n\n\n \n Benzmüller, C., Otten, J., & Raths, T.\n\n\n \n\n\n\n In Fontaine, P., Schmidt, R. A., & Schulz, S., editor(s), PAAR-2012, volume 21, of EPiC Series in Computing, pages 12-18, 2013. EasyChair\n \n\n\n\n
\n\n\n\n \n \n \"ImplementingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W48,\n  Author =\t {Christoph Benzm{\\"u}ller and Jens Otten and Thomas\n                  Raths},\n  Booktitle =\t {PAAR-2012},\n  Editor =\t {Pascal Fontaine and Renate A. Schmidt and Stephan\n                  Schulz},\n  issn =\t {2398-7340},\n  Keywords =\t {own, Higher Order Logic, Automated Reasoning,\n                  Semantic Embedding, Modal Logics},\n  Pages =\t {12-18},\n  Publisher =\t {EasyChair},\n  Series =\t {EPiC Series in Computing},\n  Title =\t {Implementing Different Proof Calculi for First-order\n                  Modal Logics},\n  Url =\n                  {http://www.easychair.org/publications/?page=1303066787},\n  Volume =\t 21,\n  Year =\t 2013,\n  Doi =\t\t {10.29007/mclw},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Implementing and Evaluating Provers for First-order Modal Logics.\n \n \n\n\n \n Benzmüller, C., Otten, J., & Raths, T.\n\n\n \n\n\n\n In Raedt, L. D., Bessiere, C., Dubois, D., Doherty, P., Frasconi, P., Heintz, F., & Lucas, P., editor(s), ECAI 2012, volume 242, of Frontiers in Artificial Intelligence and Applications, pages 163-168, Montpellier, France, 2012. IOS Press\n \n\n\n\n
\n\n\n\n \n \n \"Implementing preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C34,\n  Address =\t {Montpellier, France},\n  Author =\t {Christoph Benzm{\\"u}ller and Jens Otten and Thomas\n                  Raths},\n  Booktitle =\t {ECAI 2012},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2012_ECAI.pdf">slides</a>},\n  Doi =\t\t {10.3233/978-1-61499-098-7-163},\n  Editor =\t {Luc De Raedt and Christian Bessiere and Didier\n                  Dubois and Patrick Doherty and Paolo Frasconi and\n                  Fredrik Heintz and Peter Lucas},\n  Isbn =\t {978-1-61499-097-0},\n  Keywords =\t {own, Higher Order Logic, Semantic Embedding, Modal\n                  Logics, Automated Reasoning},\n  Pages =\t {163-168},\n  Publisher =\t {IOS Press},\n  Series =\t {Frontiers in Artificial Intelligence and\n                  Applications},\n  Title =\t {Implementing and Evaluating Provers for First-order\n                  Modal Logics},\n  url_preprint = {http://christoph-benzmueller.de/papers/C34.pdf},\n  Volume =\t 242,\n  Year =\t 2012,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Embedding and Automating Conditional Logics in Classical Higher-Order Logic.\n \n \n\n\n \n Benzmüller, C., Gabbay, D., Genovese, V., & Rispoli, D.\n\n\n \n\n\n\n Annals of Mathematics and Artificial Intelligence, 66(1-4): 257-271. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"Embedding preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J26,\n  Author =\t {Christoph Benzm{\\"u}ller and Dov Gabbay and Valerio\n                  Genovese and Daniele Rispoli},\n  Doi =\t\t {10.1007/s10472-012-9320-z},\n  Journal =\t {Annals of Mathematics and Artificial Intelligence},\n  Keywords =\t {own, Higher Order Logic, Semantic Embedding,\n                  Conditional Logics, Automated Reasoning},\n  Number =\t {1-4},\n  Pages =\t {257-271},\n  Title =\t {Embedding and Automating Conditional Logics in\n                  Classical Higher-Order Logic},\n  url_preprint = {http://christoph-benzmueller.de/papers/J26.pdf},\n  Volume =\t 66,\n  Year =\t 2012,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Higher-order Aspects and Context in SUMO.\n \n \n\n\n \n Benzmüller, C., & Pease, A.\n\n\n \n\n\n\n Journal of Web Semantics (Special Issue on Reasoning with context in the Semantic Web), 12-13: 104-117. 2012.\n \n\n\n\n
\n\n\n\n \n \n \"Higher-order preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J27,\n  Author =\t {Christoph Benzm{\\"u}ller and Adam Pease},\n  Doi =\t\t {10.1016/j.websem.2011.11.008},\n  Journal =\t {Journal of Web Semantics (Special Issue on Reasoning\n                  with context in the Semantic Web)},\n  Keywords =\t {own, Ontology Reasoning, Automated Reasoning, Higher\n                  Order Logic, Modal Logics},\n  Pages =\t {104-117},\n  Title =\t {Higher-order Aspects and Context in {SUMO}},\n  url_preprint = {https://www.researchgate.net/publication/221677796},\n  Volume =\t {12-13},\n  Year =\t 2012,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n FMLtoHOL (version 1.0): Automating First-order Modal Logics with LEO-II and Friends.\n \n \n\n\n \n Benzmüller, C., & Raths, T.\n\n\n \n\n\n\n 2012.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"FMLtoHOLPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R53,\n  doi =\t\t {10.48550/ARXIV.1207.6685},\n  url =\t\t {https://arxiv.org/abs/1207.6685},\n  author =\t {Benzm{\\"u}ller, Christoph and Raths, Thomas},\n  title =\t {FMLtoHOL (version 1.0): Automating First-order Modal\n                  Logics with LEO-II and Friends},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2012,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Progress in Automating Higher-Order Ontology Reasoning.\n \n \n\n\n \n Benzmüller, C., & Pease, A.\n\n\n \n\n\n\n In Schmidt, R. A., Schulz, S., & Konev, B., editor(s), PAAR-2010 – Workshop on Practical Aspects of Automated Reasoning, volume 9, of EPiC Series in Computing, pages 22-32, 2012. EasyChair\n \n\n\n\n
\n\n\n\n \n \n \"ProgressPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W40,\n  Author =\t {Christoph Benzm{\\"u}ller and Adam Pease},\n  Booktitle =\t {PAAR-2010 -- Workshop on Practical Aspects of\n                  Automated Reasoning},\n  Comment =\t {<a href="http://christoph-benzmueller.de/papers/2010-PAAR.pdf">slides</a>},\n  Editor =\t {Renate A. Schmidt and Stephan Schulz and Boris\n                  Konev},\n  issn =\t {2398-7340},\n  Pages =\t {22-32},\n  Publisher =\t {EasyChair},\n  Series =\t {EPiC Series in Computing},\n  Title =\t {Progress in Automating Higher-Order Ontology\n                  Reasoning},\n  Url =\n                  {http://www.easychair.org/publications/?page=999569486},\n  Volume =\t 9,\n  Year =\t 2012,\n  Doi =\t\t {10.29007/dtnz},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Adaptive Assertion-Level Proofs.\n \n \n\n\n \n Benzmüller, C., & Schiller, M.\n\n\n \n\n\n\n In Stump, A., Sutcliffe, G., & Tinelli, C., editor(s), EMSQMS 2010 – Workshop on Evaluation Methods for Solvers and Quality Metrics for Solutions, volume 6, of EPiC Series in Computing, pages 39-40, 2012. EasyChair\n \n\n\n\n
\n\n\n\n \n \n \"AdaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W46,\n  Author =\t {Christoph Benzm{\\"u}ller and Marvin Schiller},\n  Booktitle =\t {EMSQMS 2010 -- Workshop on Evaluation Methods for\n                  Solvers and Quality Metrics for Solutions},\n  Editor =\t {Aaron Stump and Geoff Sutcliffe and Cesare Tinelli},\n  issn =\t {2398-7340},\n  Keywords =\t {own, Proof Presentation, DIALOG, Natural Language\n                  Dialog, Proof Assistants, Machine Learning, Tutoring\n                  Systems},\n  Pages =\t {39-40},\n  Publisher =\t {EasyChair},\n  Series =\t {EPiC Series in Computing},\n  Title =\t {Adaptive Assertion-Level Proofs},\n  Url =\n                  {http://www.easychair.org/publications/?page=1718758449},\n  Volume =\t 6,\n  Year =\t 2012,\n  Doi =\t\t {0.29007/gvgn},\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2011\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Knowledge Engineering Tools.\n \n \n\n\n \n Benzmüller, C., & Pease, A.\n\n\n \n\n\n\n In Pease, A., editor(s), Ontology: A Practical Guide, pages 171-214. Articulate Software Press, Angwin, CA, USA, 2011.\n (This chapter has some essential overlap with the 2012 journal paper with A. Pease titled Higher-Order Aspects and Context in SUMO)\n\n\n\n
\n\n\n\n \n \n \"KnowledgePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B13,\n  Author =\t {Christoph Benzm{\\"u}ller and Adam Pease},\n  Booktitle =\t {Ontology: A Practical Guide},\n  Editor =\t {Adam Pease},\n  Isbn =\t {978-1-889455-10-5},\n  Keywords =\t {own, Ontology Reasoning, Automated Reasoning, Higher\n                  Order Logic},\n  Note =\t {(This chapter has some essential overlap with the\n                  2012 journal paper with A. Pease titled Higher-Order\n                  Aspects and Context in SUMO)},\n  Pages =\t {171-214},\n  Address =\t {Angwin, CA, USA},\n  Publisher =\t {Articulate Software Press},\n  Title =\t {Knowledge Engineering Tools},\n  Url =\t\t {http://www.ontologyportal.org/Book.html},\n  Year =\t 2011,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Quantified Conditional Logics are Fragments of HOL.\n \n \n\n\n \n Benzmüller, C., & Genovese, V.\n\n\n \n\n\n\n In The International Conference on Non-classical Modal and Predicate Logics (NCMPL), Guangzhou (Canton), China, 2011. \n (The conference had no published proceedings; the paper is available as arXiv:1204.5920v1; superseded by IJCAI-2013 paper)\n\n\n\n
\n\n\n\n \n \n \"QuantifiedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C33,\n  Address =\t {Guangzhou (Canton), China},\n  Author =\t {Christoph Benzm{\\"u}ller and Valerio Genovese},\n  Booktitle =\t {The International Conference on Non-classical Modal\n                  and Predicate Logics (NCMPL)},\n  Comment =\t {<a href="./2011_NCMPL.pdf">[slides]</a>, <a href="./2011_NCMPL_presentation.mov">[movie]</a>},\n  Keywords =\t {own, Higher Order Logic, Semantic Embedding,\n                  Conditional Logics, Automated Reasoning},\n  Note =\t {(The conference had no published proceedings; the\n                  paper is available as arXiv:1204.5920v1; superseded\n                  by IJCAI-2013 paper)},\n  Title =\t {Quantified Conditional Logics are Fragments of\n                  {HOL}},\n  Url =\t\t {http://arxiv.org/abs/1204.5920},\n  doi =\t\t {10.48550/ARXIV.1204.5920},\n  Year =\t 2011,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Combining and Automating Classical and Non-Classical Logics in Classical Higher-Order Logic.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Annals of Mathematics and Artificial Intelligence (Special issue Computational Logics in Multi-agent Systems (CLIMA XI)), 62(1-2): 103-128. 2011.\n \n\n\n\n
\n\n\n\n \n \n \"Combining preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J25,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2010-ECAI-ARCOE-16-8.pdf">slides</a>},\n  Doi =\t\t {10.1007/s10472-011-9249-7},\n  Journal =\t {Annals of Mathematics and Artificial Intelligence\n                  (Special issue Computational Logics in Multi-agent\n                  Systems (CLIMA XI))},\n  Keywords =\t {own, Higher Order Logic, Semantic Embedding, Modal\n                  Logics, Henkin Semantics, Automated Reasoning},\n  Number =\t {1-2},\n  Pages =\t {103-128},\n  Title =\t {Combining and Automating Classical and Non-Classical\n                  Logics in Classical Higher-Order Logic},\n  url_preprint = {http://christoph-benzmueller.de/papers/J25.pdf},\n  Volume =\t 62,\n  Year =\t 2011,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Embedding and Automating Conditional Logics in Classical Higher-Order Logic.\n \n \n\n\n \n Benzmüller, C., Gabbay, D., Genovese, V., & Rispoli, D.\n\n\n \n\n\n\n 2011.\n Preprint\n\n\n\n
\n\n\n\n \n \n \"EmbeddingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@misc{R52,\n  doi =\t\t {10.48550/ARXIV.1106.3685},\n  url =\t\t {https://arxiv.org/abs/1106.3685},\n  author =\t {Benzm{\\"u}ller, Christoph and Gabbay, Dov and\n                  Genovese, Valerio and Rispoli, Daniele},\n  title =\t {Embedding and Automating Conditional Logics in\n                  Classical Higher-Order Logic},\n  publisher =\t {arXiv},\n  note =         {Preprint},\n  year =\t 2011,\n  copyright =\t {arXiv.org perpetual, non-exclusive license}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (11)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n OMEGA: Resource-Adaptive Processes in an Automated Reasoning Systems.\n \n \n\n\n \n Autexier, S., Benzmüller, C., Dietrich, D., & Siekmann, J.\n\n\n \n\n\n\n In Crocker, M. W., & Siekmann, J., editor(s), Resource-Adaptive Cognitive Processes, of Cognitive Technologies, pages 389-423. Springer, 2010.\n (Final project report, DFG SFB 378)\n\n\n\n
\n\n\n\n \n \n \"OMEGA: preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B10,\n  Author =\t {Serge Autexier and Christoph Benzm{\\"u}ller and\n                  Dominik Dietrich and J\\"org Siekmann},\n  Booktitle =\t {Resource-Adaptive Cognitive Processes},\n  Doi =\t\t {10.1007/978-3-540-89408-7_17},\n  Editor =\t {Matthew W. Crocker and J\\"org Siekmann},\n  Isbn =\t {978-3-540-89407-0},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Automated Reasoning, Proof Planning, System\n                  Integration, Agents},\n  Note =\t {(Final project report, DFG SFB 378)},\n  Pages =\t {389-423},\n  Publisher =\t {Springer},\n  Series =\t {Cognitive Technologies},\n  Title =\t {{OMEGA}: Resource-Adaptive Processes in an Automated\n                  Reasoning Systems},\n  url_preprint = {http://christoph-benzmueller.de/papers/B10.pdf},\n  Year =\t 2010,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Resource-Bounded Modelling and Analysis of Human-Level Interactive Proofs.\n \n \n\n\n \n Benzmüller, C., Schiller, M., & Siekmann, J.\n\n\n \n\n\n\n In Crocker, M. W., & Siekmann, J., editor(s), Resource-Adaptive Cognitive Processes, of Cognitive Technologies, pages 291-311. Springer, 2010.\n (Final project report, DFG SFB 378)\n\n\n\n
\n\n\n\n \n \n \"Resource-Bounded preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B11,\n  Author =\t {Christoph Benzm{\\"u}ller and Marvin Schiller and\n                  J\\"org Siekmann},\n  Booktitle =\t {Resource-Adaptive Cognitive Processes},\n  Doi =\t\t {10.1007/978-3-540-89408-7_13},\n  Editor =\t {Matthew W. Crocker and J\\"org Siekmann},\n  Isbn =\t {978-3-540-89407-0},\n  Keywords =\t {own, Proof Presentation, DIALOG, Natural Language\n                  Dialog, Proof Assistants, Machine Learning, Tutoring\n                  Systems},\n  Note =\t {(Final project report, DFG SFB 378)},\n  Pages =\t {291-311},\n  Publisher =\t {Springer},\n  Series =\t {Cognitive Technologies},\n  Title =\t {Resource-Bounded Modelling and Analysis of\n                  Human-Level Interactive Proofs},\n  url_preprint = {http://christoph-benzmueller.de/papers/B11.pdf},\n  Year =\t 2010,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Verifying the Modal Logic Cube is an Easy Task (for Higher-Order Automated Reasoners).\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Siegler, S., & Wasser, N., editor(s), Verification, Induction, Termination Analysis - Festschrift for Christoph Walther on the Occasion of His 60th Birthday, volume 6463, of LNCS, pages 117-128. Springer, 2010.\n (Superseded by PxTP-2015 paper)\n\n\n\n
\n\n\n\n \n \n \"Verifying preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B12,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Verification, Induction, Termination Analysis -\n                  Festschrift for Christoph Walther on the Occasion of\n                  His 60th Birthday},\n  Doi =\t\t {10.1007/978-3-642-17172-7_7},\n  Editor =\t {Simon Siegler and Nathan Wasser},\n  Keywords =\t {own, Modal Logics, Semantic Embedding, Higher Order\n                  Logic, Automated Reasoning, LEO Prover},\n  Note =\t {(Superseded by PxTP-2015 paper)},\n  Pages =\t {117-128},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Verifying the Modal Logic Cube is an Easy Task (for\n                  Higher-Order Automated Reasoners)},\n  url_preprint = {http://christoph-benzmueller.de/papers/B12.pdf},\n  Volume =\t 6463,\n  Year =\t 2010,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Simple Type Theory as Framework for Combining Logics.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Contest paper at the World Congress and School on Universal Logic III (UNILOG), Lisbon, Portugal, 2010. \n The conference had no published proceedings for the contest papers; the paper is available as arXiv:1004.5500v1\n\n\n\n
\n\n\n\n \n \n \"SimplePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C32,\n  Address =\t {Lisbon, Portugal},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Contest paper at the World Congress and School on\n                  Universal Logic III (UNILOG)},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2010-UNILOG.pdf">slides</a>},\n  Keywords =\t {own, Higher Order Logic, LEO Prover, Modal Logics,\n                  Combinations of Logics, Semantic Embedding},\n  Note =\t {The conference had no published proceedings for the\n                  contest papers; the paper is available as\n                  arXiv:1004.5500v1},\n  Title =\t {Simple Type Theory as Framework for Combining\n                  Logics},\n  Url =\t\t {http://arxiv.org/abs/1004.5500},\n  doi =\t\t {10.48550/ARXIV.1004.5500},\n  Year =\t 2010,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Multimodal and Intuitionistic Logics in Simple Type Theory.\n \n \n\n\n \n Benzmüller, C., & Paulson, L. C.\n\n\n \n\n\n\n The Logic Journal of the IGPL, 18(6): 881-892. 2010.\n \n\n\n\n
\n\n\n\n \n \n \"Multimodal preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J21,\n  Author =\t {Christoph Benzm{\\"u}ller and Paulson, Lawrence C.},\n  Doi =\t\t {10.1093/jigpal/jzp080},\n  Journal =\t {The Logic Journal of the IGPL},\n  Keywords =\t {own, Higher Order Logic, LEO Prover, Semantic\n                  Embedding, Modal Logics, Combinations of Logics,\n                  Henkin Semantics, ERIH PLUS},\n  Number =\t 6,\n  Pages =\t {881-892},\n  Title =\t {Multimodal and Intuitionistic Logics in Simple Type\n                  Theory},\n  url_preprint = {http://christoph-benzmueller.de/papers/J21.pdf},\n  Volume =\t 18,\n  Year =\t 2010,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automated Reasoning in Higher-Order Logic using the TPTP THF Infrastructure.\n \n \n\n\n \n Sutcliffe, G., & Benzmüller, C.\n\n\n \n\n\n\n Journal of Formalized Reasoning, 3(1): 1-27. 2010.\n \n\n\n\n
\n\n\n\n \n \n \"Automated preprint\n  \n \n \n \"AutomatedPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J22,\n  Author =\t {Geoff Sutcliffe and Christoph Benzm{\\"u}ller},\n  Issn =\t {1972-5787},\n  Journal =\t {Journal of Formalized Reasoning},\n  Keywords =\t {own, Higher Order Logic, Automated Reasoning, Henkin\n                  Semantics},\n  Number =\t 1,\n  Pages =\t {1-27},\n  Title =\t {Automated Reasoning in Higher-Order Logic using the\n                  {TPTP THF} Infrastructure},\n  url_preprint = {https://www.researchgate.net/publication/49595291},\n  url =\t\t {https://jfr.unibo.it/article/view/1710},\n  Volume =\t 3,\n  Year =\t 2010,\n  doi = {10.6092/issn.1972-5787/1710},\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Combining Logics in Simple Type Theory.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Dix, J., Leite, J., Governatori, G., & Jamroga, W., editor(s), Computational Logic in Multi-Agent Systems, 11th International Workshop, CLIMA XI, Lisbon, Portugal, August 16-17, 2010. Proceedings, volume 6245, of Lecture Notes in Artifical Intelligence, pages 33-48, Lisbon, Portugal, 2010. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Combining preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W41,\n  Address =\t {Lisbon, Portugal},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Computational Logic in Multi-Agent Systems, 11th\n                  International Workshop, CLIMA XI, Lisbon, Portugal,\n                  August 16-17, 2010. Proceedings},\n  Doi =\t\t {10.1007/978-3-642-14977-1_6},\n  Editor =\t {J{\\"u}rgen Dix and Joao Leite and Guido Governatori\n                  and Woitek Jamroga},\n  Pages =\t {33-48},\n  Publisher =\t {Springer},\n  Series =\t {Lecture Notes in Artifical Intelligence},\n  Title =\t {Combining Logics in Simple Type Theory},\n  url_preprint = {http://christoph-benzmueller.de/papers/W41.pdf},\n  Volume =\t 6245,\n  Year =\t 2010,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Sigma: An Integrated Development Environment for Logical Theory Development.\n \n \n\n\n \n Pease, A., & Benzmüller, C.\n\n\n \n\n\n\n In The ECAI 2010 Workshop on Intelligent Engineering Techniques for Knowledge Bases (IKBET'2010), Lisbon, Portugal, 2010. \n (Superseded by 2013 paper in AI Communications)\n\n\n\n
\n\n\n\n \n \n \"Sigma: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W42,\n  Address =\t {Lisbon, Portugal},\n  Author =\t {Adam Pease and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {The ECAI 2010 Workshop on Intelligent Engineering\n                  Techniques for Knowledge Bases (IKBET'2010)},\n  Comment =\t {<a href="http://christoph-benzmueller.de/papers/2010-ECAI-IKBET.pdf">slides</a>},\n  Note =\t {(Superseded by 2013 paper in AI Communications)},\n  Title =\t {{Sigma}: An Integrated Development Environment for\n                  Logical Theory Development},\n  url_preprint = {http://christoph-benzmueller.de/papers/W42.pdf},\n  Year =\t 2010,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Ontology Archaeology: Mining a Decade of Effort on the Suggested Upper Merged Ontology.\n \n \n\n\n \n Pease, A., & Benzmüller, C.\n\n\n \n\n\n\n In A. Bundy, J. Lehmann, G. Qi, & I. J. Varzinczak, editor(s), The ECAI-10 Workshop on Automated Reasoning about Context and Ontology Evolution (ARCOE-10), August 16-17, Lisbon, Portugal, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"Ontology preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W43,\n  Address =\t {August 16-17, Lisbon, Portugal},\n  Author =\t {Adam Pease and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {The ECAI-10 Workshop on Automated Reasoning about\n                  Context and Ontology Evolution (ARCOE-10)},\n  Comment =\t {<a href="http://christoph-benzmueller.de/papers/2010-ECAI-ARCOE-16-8.pdf">slides</a>},\n  Editor =\t {A.~Bundy and J.~Lehmann and G.~Qi and\n                  I.~J.~Varzinczak},\n  Title =\t {Ontology Archaeology: Mining a Decade of Effort on\n                  the Suggested Upper Merged Ontology},\n  url_preprint = {http://christoph-benzmueller.de/papers/W43.pdf},\n  Year =\t 2010,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Reasoning with Embedded Formulas and Modalities in SUMO.\n \n \n\n\n \n Benzmüller, C., & Pease, A.\n\n\n \n\n\n\n In A. Bundy, J. Lehmann, G. Qi, & I. J. Varzinczak, editor(s), The ECAI-10 Workshop on Automated Reasoning about Context and Ontology Evolution (ARCOE-10), August 16-17, Lisbon, Portugal, 2010. \n (Superseded by 2012 paper in Journal of Web Semantics)\n\n\n\n
\n\n\n\n \n \n \"Reasoning preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W44,\n  Address =\t {August 16-17, Lisbon, Portugal},\n  Author =\t {Christoph Benzm{\\"u}ller and Adam Pease},\n  Booktitle =\t {The ECAI-10 Workshop on Automated Reasoning about\n                  Context and Ontology Evolution (ARCOE-10)},\n  Comment = {<a href="http://christoph-benzmueller.de/papers/2010-ECAI-ARCOE-17-8.pdf">slides</a>},\n  Editor =\t {A.~Bundy and J.~Lehmann and G.~Qi and\n                  I.~J.~Varzinczak},\n  Keywords =\t {own, Ontology Reasoning, Automated Reasoning, Higher\n                  Order Logic},\n  Note =\t {(Superseded by 2012 paper in Journal of Web\n                  Semantics)},\n  Title =\t {Reasoning with Embedded Formulas and Modalities in\n                  {SUMO}},\n  url_preprint = {http://christoph-benzmueller.de/papers/W44.pdf},\n  Year =\t 2010,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Human-Oriented Proof Techniques are Relevant for Proof Tutoring.\n \n \n\n\n \n Schiller, M., & Benzmüller, C.\n\n\n \n\n\n\n In Workshop on Mathematically Intelligent Proof Search (MIPS 2010, affiliated with CICM 2010), Paris, France, 2010. \n \n\n\n\n
\n\n\n\n \n \n \"Human-Oriented preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W45,\n  Address =\t {Paris, France},\n  Author =\t {Marvin Schiller and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Workshop on Mathematically Intelligent Proof Search\n                  (MIPS 2010, affiliated with CICM 2010)},\n  Keywords =\t {own, Proof Presentation, DIALOG, Natural Language\n                  Dialog, Proof Assistants, Machine Learning, Tutoring\n                  Systems},\n  Title =\t {Human-Oriented Proof Techniques are Relevant for\n                  Proof Tutoring},\n  url_preprint = {http://christoph-benzmueller.de/papers/W45.pdf},\n  Year =\t 2010,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (18)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Jacques Herbrand: Life, Logic, and Automated Deduction.\n \n \n\n\n \n Wirth, C., Siekmann, J., Benzmüller, C., & Autexier, S.\n\n\n \n\n\n\n In Gabbay, D., & Woods, J., editor(s), Handbook of the History of Logic, Volume 5 – Logic from Russell to Church. Elsevier, 2009.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B4,\n  Author =\t {Claus-Peter Wirth and J{\\"o}rg Siekmann and\n                  Christoph Benzm{\\"u}ller and Serge Autexier},\n  Booktitle =\t {Handbook of the History of Logic, Volume 5 -- Logic\n                  from Russell to Church},\n  Doi =\t\t {10.1016/S1874-5857(09)70009-3},\n  Editor =\t {Dov Gabbay and John Woods},\n  Issn =\t {1874-5857},\n  Keywords =\t {own, Jacques Herbrand, History of Logic},\n  Publisher =\t {Elsevier},\n  Title =\t {Jacques {Herbrand}: Life, Logic, and Automated\n                  Deduction},\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automating Access Control Logic in Simple Type Theory with LEO-II.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Gritzalis, D., & López, J., editor(s), Emerging Challenges for Security, Privacy and Trust, 24th IFIP TC 11 International Information Security Conference, SEC 2009, Pafos, Cyprus, May 18-20, 2009. Proceedings, volume 297, of IFIP, pages 387-398, 2009. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Automating preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C27,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Emerging Challenges for Security, Privacy and Trust,\n                  24th IFIP TC 11 International Information Security\n                  Conference, SEC 2009, Pafos, Cyprus, May 18-20,\n                  2009. Proceedings},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2009-SEC.pdf">slides</a>},\n  Doi =\t\t {10.1007/978-3-642-01244-0_34},\n  Editor =\t {Dimitris Gritzalis and Javier L{\\'o}pez},\n  Isbn =\t {978-3-642-01243-3},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Automated\n                  Reasoning, Henkin Semantics, Security Logics},\n  Pages =\t {387-398},\n  Publisher =\t {Springer},\n  Series =\t {IFIP},\n  Title =\t {Automating Access Control Logic in Simple Type\n                  Theory with {LEO-II}},\n  url_preprint = {http://christoph-benzmueller.de/papers/C27.pdf},\n  Volume =\t 297,\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Proof Granularity as an Empirical Problem?.\n \n \n\n\n \n Schiller, M., & Benzmüller, C.\n\n\n \n\n\n\n In Cordeiro, J. A. M., Shishkov, B., Verbraeck, A., & Helfert, M., editor(s), CSEDU 2009 - Proceedings of the First International Conference on Computer Supported Education, Lisboa, Portugal, March 23-26, 2009 - Volume 1, pages 350-354, 2009. SciTePress Digital Library\n \n\n\n\n
\n\n\n\n \n \n \"Proof preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C28,\n  Author =\t {Marvin Schiller and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {CSEDU 2009 - Proceedings of the First International\n                  Conference on Computer Supported Education, Lisboa,\n                  Portugal, March 23-26, 2009 - Volume 1},\n  Doi =\t\t {10.5220/0002159603500354},\n  Editor =\t {Jos{\\'e} A. Moinhos Cordeiro and Boris Shishkov and\n                  Alexander Verbraeck and Markus Helfert},\n  Isbn =\t {978-989-8111-82-1},\n  Keywords =\t {own, Proof Presentation, DIALOG, Natural Language\n                  Dialog, Proof Assistants, Machine Learning, Tutoring\n                  Systems},\n  Pages =\t {350-354},\n  Publisher =\t {SciTePress Digital Library},\n  Title =\t {Proof Granularity as an Empirical Problem?},\n  url_preprint = {http://christoph-benzmueller.de/papers/C28.pdf},\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Progress in the Development of Automated Theorem Proving for Higher-order Logic.\n \n \n\n\n \n Sutcliffe, G., Benzmüller, C., Brown, C., & Theiss, F.\n\n\n \n\n\n\n In Schmidt, R., editor(s), Automated Deduction - CADE-22, 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. Proceedings, volume 5663, of LNCS, pages 116-130, 2009. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Progress preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C29,\n  Author =\t {Geoff Sutcliffe and Christoph Benzm{\\"u}ller and\n                  Chad Brown and Frank Theiss},\n  Booktitle =\t {Automated Deduction - CADE-22, 22nd International\n                  Conference on Automated Deduction, Montreal, Canada,\n                  August 2-7, 2009. Proceedings},\n  Doi =\t\t {10.1007/978-3-642-02959-2_8},\n  Editor =\t {Renate Schmidt},\n  Isbn =\t {978-3-642-02958-5},\n  Keywords =\t {own, Higher Order Logic, Automated Reasoning},\n  Pages =\t {116-130},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Progress in the Development of Automated Theorem\n                  Proving for Higher-order Logic},\n  url_preprint = {http://christoph-benzmueller.de/papers/C29.pdf},\n  Volume =\t 5663,\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Granularity-Adaptive Proof Presentation.\n \n \n\n\n \n Schiller, M., & Benzmüller, C.\n\n\n \n\n\n\n In Artificial Intelligence in Education: Building Learning Systems that Care: From Knowledge Representation to Affective Modelling, Proceedings of the 14th International Conference on Artificial Intelligence in Education, AIED 2009, July 6-10, 2009, Brighton, UK, volume 200, of Frontiers in Artificial Intelligence and Applications, pages 599-601, 2009. IOS Press\n \n\n\n\n
\n\n\n\n \n \n \"Granularity-Adaptive preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C30,\n  Author =\t {Marvin Schiller and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Artificial Intelligence in Education: Building\n                  Learning Systems that Care: From Knowledge\n                  Representation to Affective Modelling, Proceedings\n                  of the 14th International Conference on Artificial\n                  Intelligence in Education, AIED 2009, July 6-10,\n                  2009, Brighton, UK},\n  Isbn =\t {978-1-60750-028-5},\n  Keywords =\t {own, Proof Presentation, DIALOG, Natural Language\n                  Dialog, Proof Assistants, Machine Learning, Tutoring\n                  Systems},\n  Pages =\t {599-601},\n  Publisher =\t {IOS Press},\n  Series =\t {Frontiers in Artificial Intelligence and\n                  Applications},\n  Title =\t {Granularity-Adaptive Proof Presentation},\n  url_preprint = {http://christoph-benzmueller.de/papers/C30.pdf},\n  Volume =\t 200,\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Presenting Proofs with Adapted Granularity.\n \n \n\n\n \n Schiller, M., & Benzmüller, C.\n\n\n \n\n\n\n In Mertsching, B., Hund, M., & Aziz, M. Z., editor(s), KI 2009: Advances in Artificial Intelligence, 32nd Annual German Conference on AI, Paderborn, Germany, September 15-18, 2009. Proceedings, volume 5803, of LNAI, pages 289-297, Paderborn, Germany, 2009. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Presenting preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C31,\n  Address =\t {Paderborn, Germany},\n  Author =\t {Marvin Schiller and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {KI 2009: Advances in Artificial Intelligence, 32nd\n                  Annual German Conference on AI, Paderborn, Germany,\n                  September 15-18, 2009. Proceedings},\n  Doi =\t\t {10.1007/978-3-642-04617-9_37},\n  Editor =\t {B{\\"a}rbel Mertsching and Marcus Hund and Muhammad\n                  Zaheer Aziz},\n  Isbn =\t {978-3-642-04616-2},\n  Keywords =\t {own, Proof Presentation, DIALOG, Natural Language\n                  Dialog, Proof Assistants, Machine Learning, Tutoring\n                  Systems},\n  Pages =\t {289-297},\n  Publisher =\t {Springer},\n  Series =\t {LNAI},\n  Title =\t {Presenting Proofs with Adapted Granularity},\n  url_preprint = {http://christoph-benzmueller.de/papers/C31.pdf},\n  Volume =\t 5803,\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Proceedings of the 8th International Workshop on User Interfaces for Theorem Provers (UITP 2008), Montréal, Canada.\n \n \n\n\n \n Autexier, S., & Benzmüller, C.,\n editors.\n \n\n\n \n\n\n\n Volume 226, of Electronic Notes in Theoretical Computer Science.Elsevier. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"ProceedingsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{E12,\n  Editor =\t {Serge Autexier and Christoph Benzm{\\"u}ller},\n  Pages =\t {1-106},\n  Publisher =\t {Elsevier},\n  Series =\t {Electronic Notes in Theoretical Computer Science},\n  Title =\t {Proceedings of the 8th International Workshop on\n                  User Interfaces for Theorem Provers (UITP 2008),\n                  Montr\\'{e}al, Canada},\n  Url =\n                  {http://www.sciencedirect.com/science/journal/15710661/226/},\n  Volume =\t 226,\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Cut-Simulation and Impredicativity.\n \n \n\n\n \n Benzmüller, C., Brown, C., & Kohlhase, M.\n\n\n \n\n\n\n Logical Methods in Computer Science, 5(1:6): 1-21. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"Cut-Simulation preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J18,\n  Author =\t {Christoph Benzm{\\"u}ller and Chad Brown and Michael\n                  Kohlhase},\n  Doi =\t\t {10.2168/LMCS-5(1:6)2009},\n  Journal =\t {Logical Methods in Computer Science},\n  Keywords =\t {own, Higher Order Logic, Henkin Semantics,\n                  Cut-Elimination},\n  Number =\t {1:6},\n  Pages =\t {1-21},\n  Title =\t {Cut-Simulation and Impredicativity},\n  url_preprint = {http://christoph-benzmueller.de/papers/J18.pdf},\n  Volume =\t 5,\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Preface: Proceedings of the 8th Workshop on User Interfaces for Theorem Provers (UITP 2008).\n \n \n\n\n \n Autexier, S., & Benzmüller, C.\n\n\n \n\n\n\n Electronic Notes in Theoretical Computer Science, 226(1): 1-2. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"Preface: preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J20,\n  Author =\t {Serge Autexier and Christoph Benzm{\\"u}ller},\n  Doi =\t\t {10.1016/j.entcs.2008.12.093},\n  Issn =\t {1571-0661},\n  Journal =\t {Electronic Notes in Theoretical Computer Science},\n  Keywords =\t {own, User Interface, Proof Presentation},\n  Number =\t 1,\n  Pages =\t {1-2},\n  Title =\t {Preface: Proceedings of the 8th Workshop on User\n                  Interfaces for Theorem Provers ({UITP} 2008)},\n  url_preprint = {http://christoph-benzmueller.de/papers/J20.pdf},\n  Volume =\t 226,\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Lectures on Jacques Herbrand as a Logician.\n \n \n\n\n \n Wirth, C., Siekmann, J., Benzmüller, C., & Autexier, S.\n\n\n \n\n\n\n SEKI Publications (ISSN 1437-4447), 2009.\n arXiv:0902.4682\n\n\n\n
\n\n\n\n \n \n \"LecturesPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@book{R43,\n  Abstract =\t {We give some lectures on the work on formal logic of\n                  Jacques Herbrand, and sketch his life and his\n                  influence on automated theorem proving. The intended\n                  audience ranges from students interested in logic\n                  over historians to logicians. Besides the well-known\n                  correction of Herbrand's False Lemma by Goedel and\n                  Dreben, we also present the hardly known unpublished\n                  correction of Heijenoort and its consequences on\n                  Herbrand's Modus Ponens Elimination. Besides\n                  Herbrand's Fundamental Theorem and its relation to\n                  the Loewenheim-Skolem-Theorem, we carefully\n                  investigate Herbrand's notion of intuitionism in\n                  connection with his notion of falsehood in an\n                  infinite domain. We sketch Herbrand's two proofs of\n                  the consistency of arithmetic and his notion of a\n                  recursive function, and last but not least, present\n                  the correct original text of his unification\n                  algorithm with a new translation.},\n  Author =\t {Wirth, Claus-Peter and Siekmann, J{\\"o}rg and\n                  Benzm{\\"u}ller, Christoph and Autexier, Serge},\n  Keywords =\t {own, Jacques Herbrand, History of Logic},\n  Note =\t {arXiv:0902.4682},\n  Publisher =\t {SEKI Publications (ISSN 1437-4447)},\n  Title =\t {Lectures on {Jacques Herbrand} as a Logician},\n  Url =\t\t {http://arxiv.org/abs/0902.4682},\n  doi =\t\t {10.48550/ARXIV.0902.4682},\n  Year =\t 2009,\n}\n\n
\n
\n\n\n
\n We give some lectures on the work on formal logic of Jacques Herbrand, and sketch his life and his influence on automated theorem proving. The intended audience ranges from students interested in logic over historians to logicians. Besides the well-known correction of Herbrand's False Lemma by Goedel and Dreben, we also present the hardly known unpublished correction of Heijenoort and its consequences on Herbrand's Modus Ponens Elimination. Besides Herbrand's Fundamental Theorem and its relation to the Loewenheim-Skolem-Theorem, we carefully investigate Herbrand's notion of intuitionism in connection with his notion of falsehood in an infinite domain. We sketch Herbrand's two proofs of the consistency of arithmetic and his notion of a recursive function, and last but not least, present the correct original text of his unification algorithm with a new translation.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Granularity-Adaptive Proof Presentation.\n \n \n\n\n \n Schiller, M., & Benzmüller, C.\n\n\n \n\n\n\n Technical Report Saarland University, DFKI Bremen GmbH, Safe and Secure Cognitive Systems, Cartesium, Enrique Schmidt Str.\\,5, D–28359 Bremen, Germany, 2009.\n arXiv:0903.0314\n\n\n\n
\n\n\n\n \n \n \"Granularity-AdaptivePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@techreport{R44,\n  Abstract =\t {When mathematicians present proofs they usually\n                  adapt their explanations to their didactic goals and\n                  to the (assumed) knowledge of their\n                  addressees. Modern automated theorem provers, in\n                  contrast, present proofs usually at a fixed level of\n                  detail (also called granularity). Often these\n                  presentations are neither intended nor suitable for\n                  human use. A challenge therefore is to develop user-\n                  and goal-adaptive proof presentation techniques that\n                  obey common mathematical practice. We present a\n                  flexible and adaptive approach to proof presentation\n                  that exploits machine learning techniques to extract\n                  a model of the specific granularity of proof\n                  examples and employs this model for the automated\n                  generation of further proofs at an adapted level of\n                  granularity.},\n  Institution =\t {Saarland University},\n  Address =\t {{DFKI Bremen GmbH, Safe and Secure Cognitive\n                  Systems, Cartesium, Enrique Schmidt Str.\\,5,\n                  D--28359 Bremen, Germany}},\n  Author =\t {Schiller, Marvin and Benzm{\\"u}ller, Christoph},\n  Keywords =\t {own, Proof Presentation, DIALOG, Natural Language\n                  Dialog, Proof Assistants, Machine Learning, Tutoring\n                  Systems},\n  Note =\t {arXiv:0903.0314},\n  Publisher =\t {{SEKI Publications (ISSN 1437-4447)}},\n  Series =\t {{SEKI Working-Paper SWP--2009--01}},\n  Title =\t {Granularity-Adaptive Proof Presentation},\n  Url =\t\t {http://arxiv.org/abs/0903.0314},\n  doi =\t\t {10.48550/ARXIV.0903.0314},\n  Year =\t 2009,\n}\n\n
\n
\n\n\n
\n When mathematicians present proofs they usually adapt their explanations to their didactic goals and to the (assumed) knowledge of their addressees. Modern automated theorem provers, in contrast, present proofs usually at a fixed level of detail (also called granularity). Often these presentations are neither intended nor suitable for human use. A challenge therefore is to develop user- and goal-adaptive proof presentation techniques that obey common mathematical practice. We present a flexible and adaptive approach to proof presentation that exploits machine learning techniques to extract a model of the specific granularity of proof examples and employs this model for the automated generation of further proofs at an adapted level of granularity.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Quantified Multimodal Logics in Simple Type Theory.\n \n \n\n\n \n Benzmüller, C., & Paulson, L. C.\n\n\n \n\n\n\n Technical Report Saarland University, DFKI Bremen GmbH, Safe and Secure Cognitive Systems, Cartesium, Enrique Schmidt Str.\\,5, D–28359 Bremen, Germany, 2009.\n arXiv:0905.2435\n\n\n\n
\n\n\n\n \n \n \"QuantifiedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R45,\n  Abstract =\t {We present a straightforward embedding of quantified\n                  multimodal logic in simple type theory and prove its\n                  soundness and completeness. Modal operators are\n                  replaced by quantification over a type of possible\n                  worlds.  We present simple experiments, using\n                  existing higher-order theorem provers, to\n                  demonstrate that the embedding allows automated\n                  proofs of statements in these logics, as well as\n                  meta properties of them.},\n  Address =\t {{DFKI Bremen GmbH, Safe and Secure Cognitive\n                  Systems, Cartesium, Enrique Schmidt Str.\\,5,\n                  D--28359 Bremen, Germany}},\n  Author =\t {Benzm{\\"u}ller, Christoph and Paulson, Lawrence C.},\n  Note =\t {arXiv:0905.2435},\n  Institution =\t {Saarland University},\n  Publisher =\t {{SEKI Publications (ISSN 1437-4447)}},\n  Series =\t {{SEKI Report SR-2009-02 (ISSN 1437-4447)}},\n  Title =\t {Quantified Multimodal Logics in Simple Type Theory},\n  Url =\t\t {http://arxiv.org/abs/0905.2435},\n  Year =\t 2009,\n}\n\n
\n
\n\n\n
\n We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple experiments, using existing higher-order theorem provers, to demonstrate that the embedding allows automated proofs of statements in these logics, as well as meta properties of them.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automating Quantified Multimodal Logics in Simple Type Theory – A Case Study.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Technical Report Saarland University, DFKI Bremen GmbH, Safe and Secure Cognitive Systems, Cartesium, Enrique Schmidt Str.\\,5, D–28359 Bremen, Germany, 2009.\n arXiv:0905.4369\n\n\n\n
\n\n\n\n \n \n \"AutomatingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R46,\n  Address =\t {{DFKI Bremen GmbH, Safe and Secure Cognitive\n                  Systems, Cartesium, Enrique Schmidt Str.\\,5,\n                  D--28359 Bremen, Germany}},\n  Author =\t {Benzm{\\"u}ller, Christoph},\n  Note =\t {arXiv:0905.4369},\n  Institution =\t {Saarland University},\n  Publisher =\t {{SEKI Publications (ISSN 1437-4447)}},\n  Series =\t {{SEKI Working-Paper SWP-2009-02}},\n  Title =\t {Automating Quantified Multimodal Logics in Simple\n                  Type Theory -- A Case Study},\n  Url =\t\t {http://arxiv.org/abs/0905.4369},\n  doi =\t\t {10.48550/ARXIV.0905.4369},\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n LEO-II im Ontologieschliessen – Antrag auf ein Forschungsvorhaben an die DFG.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n 2009.\n \n\n\n\n
\n\n\n\n \n \n \"LEO-II preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R47,\n  Author =\t {Benzm{\\"u}ller, Christoph},\n  Howpublished = {International University in Germany, Bruchsal},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Automated\n                  Reasoning, Henkin Semantics, Ontology Reasoning},\n  Title =\t {{LEO-II im Ontologieschliessen -- Antrag auf ein\n                  Forschungsvorhaben an die DFG}},\n  url_preprint = {http://christoph-benzmueller.de/papers/R47.pdf},\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Note on LEO-II and the Basic Fragment of Simple Type Theory.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Technical Report AAR Newsletter No. 84, 2009.\n \n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@techreport{R48,\n  Author =\t {Benzm{\\"u}ller, Christoph},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Automated\n                  Reasoning},\n  Institution =\t {AAR Newsletter No. 84},\n  Title =\t {A Note on {LEO-II} and the Basic Fragment of Simple\n                  Type Theory},\n  Url =\t\t {http://www.AARInc.org/Newsletters/084-2009-07.html},\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The THFTPTP Project — An Infrastructure for Typed Higher-order Form Automated Theorem Proving Marie Curie International Incoming Fellowship Grant Agreement PIIF-GA-2008-219982 Project Report — Implications.\n \n \n\n\n \n Benzmüller, C., & Sutcliffe, G.\n\n\n \n\n\n\n Technical Report Saarland University, 2009.\n \n\n\n\n
\n\n\n\n \n \n \"The preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R49,\n  Author =\t {Benzm{\\"u}ller, Christoph and Sutcliffe, Geoff},\n  Institution =\t {Saarland University},\n  Title =\t {The {THFTPTP} Project --- An Infrastructure for\n                  Typed Higher-order Form Automated Theorem Proving\n                  Marie Curie International Incoming Fellowship Grant\n                  Agreement PIIF-GA-2008-219982 Project Report ---\n                  Implications},\n  url_preprint = {http://christoph-benzmueller.de/papers/R49.pdf},\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The THFTPTP Project — An Infrastructure for Typed Higher-order Form Automated Theorem Proving Marie Curie International Incoming Fellowship Grant Agreement PIIF-GA-2008-219982 Project Report — Scientific.\n \n \n\n\n \n Benzmüller, C., & Sutcliffe, G.\n\n\n \n\n\n\n Technical Report Saarland University, 2009.\n \n\n\n\n
\n\n\n\n \n \n \"The preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R50,\n  Author =\t {Benzm{\\"u}ller, Christoph and Sutcliffe, Geoff},\n  Institution =\t {Saarland University},\n  Publisher =\t {Saarland University},\n  Title =\t {The {THFTPTP} Project --- An Infrastructure for\n                  Typed Higher-order Form Automated Theorem Proving\n                  Marie Curie International Incoming Fellowship Grant\n                  Agreement PIIF-GA-2008-219982 Project Report ---\n                  Scientific},\n  url_preprint = {http://christoph-benzmueller.de/papers/R50.pdf},\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Effective Higher-Order Automated Theorem Proving with integrated Descente Infinie and Presburger Arithmetic LEO-III.\n \n \n\n\n \n Benzmüller, C., & Wirth, C.\n\n\n \n\n\n\n 2009.\n \n\n\n\n
\n\n\n\n \n \n \"Effective preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R51,\n  Author =\t {Benzm{\\"u}ller, Christoph and Wirth, Claus-Peter},\n  Howpublished = {DFG research project proposal},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Automated\n                  Reasoning},\n  Title =\t {{Effective Higher-Order Automated Theorem Proving\n                  with integrated Descente Infinie and Presburger\n                  Arithmetic LEO-III}},\n  url_preprint = {http://christoph-benzmueller.de/papers/R51.pdf},\n  Year =\t 2009,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (12)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Cut Elimination with Xi-Functionality.\n \n \n\n\n \n Benzmüller, C., Brown, C., & Kohlhase, M.\n\n\n \n\n\n\n In Benzmüller, C., Brown, C., Siekmann, J., & Statman, R., editor(s), Reasoning in Simple Type Theory — Festschrift in Honor of Peter B. Andrews on His 70th Birthday, of Studies in Logic, Mathematical Logic and Foundations, pages 84-100. College Publications, 2008.\n \n\n\n\n
\n\n\n\n \n \n \"Cut preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B8,\n  Author =\t {Christoph Benzm{\\"u}ller and Chad Brown and Michael\n                  Kohlhase},\n  Booktitle =\t {Reasoning in Simple Type Theory --- Festschrift in\n                  Honor of Peter B.~Andrews on His 70th Birthday},\n  Editor =\t {Christoph Benzm{\\"u}ller and Chad Brown and J{\\"o}rg\n                  Siekmann and Richard Statman},\n  Isbn =\t {978-1-904987-70-3},\n  Keywords =\t {own, Higher Order Logic},\n  Pages =\t {84-100},\n  Publisher =\t {College Publications},\n  Series =\t {Studies in Logic, Mathematical Logic and\n                  Foundations},\n  Title =\t {Cut Elimination with Xi-Functionality},\n  url_preprint = {http://christoph-benzmueller.de/papers/B8.pdf},\n  Year =\t 2008,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Exploring Properties of Normal Multimodal Logics in Simple Type Theory with LEO-II.\n \n \n\n\n \n Benzmüller, C., & Paulson, L. C.\n\n\n \n\n\n\n In Benzmüller, C., Brown, C., Siekmann, J., & Statman, R., editor(s), Reasoning in Simple Type Theory — Festschrift in Honor of Peter B. Andrews on His 70th Birthday, of Studies in Logic, Mathematical Logic and Foundations, pages 386-406. College Publications, 2008.\n (Superseded by 2013 paper in Logica Universalis)\n\n\n\n
\n\n\n\n \n \n \"Exploring preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B9,\n  Author =\t {Christoph Benzm{\\"u}ller and Paulson, Lawrence C.},\n  Booktitle =\t {Reasoning in Simple Type Theory --- Festschrift in\n                  Honor of {Peter B. Andrews} on His 70th Birthday},\n  Editor =\t {Christoph Benzm{\\"u}ller and Chad Brown and J{\\"o}rg\n                  Siekmann and Richard Statman},\n  Isbn =\t {978-1-904987-70-3},\n  Keywords =\t {own, Higher Order Logic, LEO Prover, Semantic\n                  Embedding, Modal Logics},\n  Note =\t {(Superseded by 2013 paper in Logica Universalis)},\n  Pages =\t {386-406},\n  Publisher =\t {College Publications},\n  Series =\t {Studies in Logic, Mathematical Logic and\n                  Foundations},\n  Title =\t {Exploring Properties of Normal Multimodal Logics in\n                  Simple Type Theory with {LEO-II}},\n  url_preprint = {http://christoph-benzmueller.de/papers/B9.pdf},\n  Year =\t 2008,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n THF0 – The Core of the TPTP Language for Classical Higher-Order Logic.\n \n \n\n\n \n Benzmüller, C., Rabe, F., & Sutcliffe, G.\n\n\n \n\n\n\n In Armando, A., Baumgartner, P., & Dowek, G., editor(s), Automated Reasoning, 4th International Joint Conference, IJCAR 2008, Sydney, Australia, August 12-15, 2008, Proceedings, volume 5195, of LNCS, pages 491-506, 2008. Springer\n \n\n\n\n
\n\n\n\n \n \n \"THF0 preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C25,\n  Author =\t {Christoph Benzm{\\"u}ller and Florian Rabe and Geoff\n                  Sutcliffe},\n  Booktitle =\t {Automated Reasoning, 4th International Joint\n                  Conference, IJCAR 2008, Sydney, Australia, August\n                  12-15, 2008, Proceedings},\n  Doi =\t\t {10.1007/978-3-540-71070-7_41},\n  Editor =\t {Alessandro Armando and Peter Baumgartner and Gilles\n                  Dowek},\n  Keywords =\t {own, Higher Order Logic, Henkin Semantics, Automated\n                  Reasoning},\n  Pages =\t {491-506},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {{THF0} -- The Core of the {TPTP} Language for\n                  Classical Higher-Order Logic},\n  url_preprint = {http://christoph-benzmueller.de/papers/C25.pdf},\n  Volume =\t 5195,\n  Year =\t 2008,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n LEO-II - A Cooperative Automatic Theorem Prover for Higher-Order Logic (System Description).\n \n \n\n\n \n Benzmüller, C., Theiss, F., Paulson, L. C., & Fietzke, A.\n\n\n \n\n\n\n In Armando, A., Baumgartner, P., & Dowek, G., editor(s), Automated Reasoning, 4th International Joint Conference, IJCAR 2008, Sydney, Australia, August 12-15, 2008, Proceedings, volume 5195, of LNCS, pages 162-170, 2008. Springer\n \n\n\n\n
\n\n\n\n \n \n \"LEO-II preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C26,\n  Author =\t {Christoph Benzm{\\"u}ller and Frank Theiss and\n                  Paulson, Lawrence C. and Arnaud Fietzke},\n  Booktitle =\t {Automated Reasoning, 4th International Joint\n                  Conference, IJCAR 2008, Sydney, Australia, August\n                  12-15, 2008, Proceedings},\n  Comment =\t {<a href="http://christoph-benzmueller.de/papers/2008_IJCAR_LEO-II.pdf">slides</a>},\n  Doi =\t\t {10.1007/978-3-540-71070-7_14},\n  Editor =\t {Alessandro Armando and Peter Baumgartner and Gilles\n                  Dowek},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Automated\n                  Reasoning, Henkin Semantics},\n  Pages =\t {162-170},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {{LEO-II} - A Cooperative Automatic Theorem Prover\n                  for Higher-Order Logic (System Description)},\n  url_preprint = {http://christoph-benzmueller.de/papers/C26.pdf},\n  Volume =\t 5195,\n  Year =\t 2008,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Reasoning in Simple Type Theory – Festschrift in Honor of Peter B. Andrews on His 70th Birthday.\n \n \n\n\n \n Benzmüller, C., Brown, C., Siekmann, J., & Statman, R.,\n editors.\n \n\n\n \n\n\n\n of Studies in Logic, Mathematical Logic and FoundationsCollege Publications, 2008.\n \n\n\n\n
\n\n\n\n \n \n \"ReasoningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@book{E11,\n  Isbn =\t {978-1-904987-70-3},\n  Editor =\t {Christoph Benzm{\\"u}ller and Chad Brown and J{\\"o}rg\n                  Siekmann and Richard Statman},\n  Pages =\t {1--460},\n  Publisher =\t {College Publications},\n  Series =\t {Studies in Logic, Mathematical Logic and\n                  Foundations},\n  Title =\t {Reasoning in Simple Type Theory -- Festschrift in\n                  Honor of {Peter B.~Andrews} on His 70th Birthday},\n  Url =\n                  {http://www.collegepublications.co.uk/logic/mlf/?00010},\n  Year =\t 2008,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Combined Reasoning by Automated Cooperation.\n \n \n\n\n \n Benzmüller, C., Sorge, V., Jamnik, M., & Kerber, M.\n\n\n \n\n\n\n Journal of Applied Logic, 6(3): 318-342. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"Combined preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J16,\n  Author =\t {Christoph Benzm{\\"u}ller and Volker Sorge and Mateja\n                  Jamnik and Manfred Kerber},\n  Doi =\t\t {10.1016/j.jal.2007.06.003},\n  Journal =\t {Journal of Applied Logic},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Automated Reasoning, Agents, Higher Order Logic, LEO\n                  Prover, System Integration, ERIH PLUS},\n  Number =\t 3,\n  Pages =\t {318-342},\n  Title =\t {Combined Reasoning by Automated Cooperation},\n  url_preprint = {http://christoph-benzmueller.de/papers/J16.pdf},\n  Volume =\t 6,\n  Year =\t 2008,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Organisation, Transformation, and Propagation of Mathematical Knowledge in Omega.\n \n \n\n\n \n Autexier, S., Benzmüller, C., Dietrich, D., & Wagner, M.\n\n\n \n\n\n\n Mathematics in Computer Science, 2(2): 253-277. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"Organisation, preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J17,\n  Author =\t {Serge Autexier and Christoph Benzm{\\"u}ller and\n                  Dominik Dietrich and Marc Wagner},\n  Doi =\t\t {10.1007/s11786-008-0054-6},\n  Journal =\t {Mathematics in Computer Science},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Mathematical Knowledge Management, Proof Planning,\n                  System Integration},\n  Number =\t 2,\n  Pages =\t {253-277},\n  Title =\t {Organisation, Transformation, and Propagation of\n                  Mathematical Knowledge in {Omega}},\n  url_preprint = {http://christoph-benzmueller.de/papers/J17.pdf},\n  Volume =\t 2,\n  Year =\t 2008,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Proof Step Analysis for Proof Tutoring – A Learning Approach to Granularity.\n \n \n\n\n \n Schiller, M., Dietrich, D., & Benzmüller, C.\n\n\n \n\n\n\n Teaching Mathematics and Computer Science, 6(2): 325-343. 2008.\n \n\n\n\n
\n\n\n\n \n \n \"Proof preprint\n  \n \n \n \"ProofPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J19,\n  Author =\t {Marvin Schiller and Dominik Dietrich and Christoph\n                  Benzm{\\"u}ller},\n  Issn =\t {1589-7389},\n  Journal =\t {Teaching Mathematics and Computer Science},\n  Keywords =\t {own, Proof Presentation, DIALOG, Natural Language\n                  Dialog, Proof Assistants, Machine Learning, Tutoring\n                  Systems},\n  Number =\t 2,\n  Pages =\t {325-343},\n  Title =\t {Proof Step Analysis for Proof Tutoring -- A Learning\n                  Approach to Granularity},\n  url_preprint = {http://christoph-benzmueller.de/papers/J19.pdf},\n  url =\t\t {http://tmcs.math.unideb.hu/load_doc.php?p=142&t=doc},\n  Volume =\t 6,\n  Year =\t 2008,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n OMEGA: Agent-oriented Proof Planning.\n \n \n\n\n \n Siekmann, J., Autexier, S., & Benzmüller, C.\n\n\n \n\n\n\n 2008.\n Project report in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes\n\n\n\n
\n\n\n\n \n \n \"OMEGA: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R40,\n  Author =\t {J{\\"o}rg Siekmann and Serge Autexier and Christoph\n                  Benzm{\\"u}ller},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Mathematical Knowledge Management, Proof Planning,\n                  System Integration},\n  Note =\t {Project report in the Collaborative Research Centre\n                  SFB 378 on Resource-adaptive Cognitive Processes},\n  Pages =\t {1-19},\n  Title =\t {{OMEGA}: Agent-oriented Proof Planning},\n  url_preprint = {http://christoph-benzmueller.de/papers/R40.pdf},\n  Year =\t 2008,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n DIALOG: Natural Language-based Interaction with a Mathematics Assistance System.\n \n \n\n\n \n Pinkal, M., Siekmann, J., Benzmüller, C., & Kruijff-Korbayova, I.\n\n\n \n\n\n\n 2008.\n Project report in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes\n\n\n\n
\n\n\n\n \n \n \"DIALOG: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R41,\n  Author =\t {Manfred Pinkal and J{\\"o}rg Siekmann and Christoph\n                  Benzm{\\"u}ller and Ivana Kruijff-Korbayova},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Proof Assistants, Machine Learning, Tutoring\n                  Systems},\n  Note =\t {Project report in the Collaborative Research Centre\n                  SFB 378 on Resource-adaptive Cognitive Processes},\n  Pages =\t {1-20},\n  Title =\t {DIALOG: Natural Language-based Interaction with a\n                  Mathematics Assistance System},\n  url_preprint = {http://christoph-benzmueller.de/papers/R41.pdf},\n  Year =\t 2008,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automating Access Control Logics in Simple Type Theory with LEO-II.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Technical Report SR-2008-01, Universität des Saarlandes, Saarbrücken, Germany, 2008.\n arXiv:0901.3574\n\n\n\n
\n\n\n\n \n \n \"AutomatingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@techreport{R42,\n  Abstract =\t {Garg and Abadi recently proved that prominent access\n                  control logics can be translated in a sound and\n                  complete way into modal logic S4. We have previously\n                  outlined how normal multimodal logics, including\n                  monomodal logics K and S4, can be embedded in simple\n                  type theory and we have demonstrated that the\n                  higher-order theorem prover LEO-II can automate\n                  reasoning in and about them. In this paper we\n                  combine these results and describe a sound embedding\n                  of different access control logics in simple type\n                  theory. Employing this framework we show that the\n                  off the shelf theorem prover LEO-II can be applied\n                  to automate reasoning in prominent access control\n                  logics.  },\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Institution =\t {Universit{\\"a}t des Saarlandes},\n  Address =\t {Saarbr{\\"u}cken, Germany},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Automated\n                  Reasoning, Henkin Semantics, Security Logics},\n  Note =\t {arXiv:0901.3574},\n  Number =\t {SR-2008-01},\n  Publisher =\t {SEKI Publications (ISSN 1437-4447)},\n  Title =\t {Automating Access Control Logics in Simple Type\n                  Theory with {LEO-II}},\n  Type =\t {SEKI Report},\n  Url =\t\t {http://arxiv.org/abs/0901.3574},\n  Doi =\t\t {10.48550/arXiv.0901.3574},\n  Year =\t 2008,\n}\n\n
\n
\n\n\n
\n Garg and Abadi recently proved that prominent access control logics can be translated in a sound and complete way into modal logic S4. We have previously outlined how normal multimodal logics, including monomodal logics K and S4, can be embedded in simple type theory and we have demonstrated that the higher-order theorem prover LEO-II can automate reasoning in and about them. In this paper we combine these results and describe a sound embedding of different access control logics in simple type theory. Employing this framework we show that the off the shelf theorem prover LEO-II can be applied to automate reasoning in prominent access control logics. \n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Evaluation of Systems for Higher-order Logic (ESHOL).\n \n \n\n\n \n Benzmüller, C., Rabe, F., Schürmann, C., & Sutcliffe, G.\n\n\n \n\n\n\n In Konev, B., Schmidt, R. A., & Schulz, S., editor(s), Proceedings of the First International Workshop on Practical Aspects of Automated Reasoning, Sydney, Australia, August 10-11, 2008, volume 373, of CEUR Workshop Proceedings, 2008. CEUR-WS.org\n (Invited non-reviewed paper)\n\n\n\n
\n\n\n\n \n \n \"Evaluation preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W39,\n  Author =\t {Christoph Benzm{\\"u}ller and Florian Rabe and\n                  Carsten Sch{\\"u}rmann and Geoff Sutcliffe},\n  Booktitle =\t {Proceedings of the First International Workshop on\n                  Practical Aspects of Automated Reasoning, Sydney,\n                  Australia, August 10-11, 2008},\n  Editor =\t {Boris Konev and Renate A. Schmidt and Stephan\n                  Schulz},\n  Note =\t {(Invited non-reviewed paper)},\n  Publisher =\t {CEUR-WS.org},\n  Series =\t {CEUR Workshop Proceedings},\n  Title =\t {Evaluation of Systems for Higher-order Logic\n                  {(ESHOL)}},\n  url_preprint = {http://christoph-benzmueller.de/papers/W39.pdf},\n  Volume =\t 373,\n  Year =\t 2008,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2007\n \n \n (11)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n The curious inference of Boolos in MIZAR and OMEGA.\n \n \n\n\n \n Benzmüller, C., & Brown, C.\n\n\n \n\n\n\n In Matuszewski, R., & Zalewska, A., editor(s), From Insight to Proof – Festschrift in Honour of Andrzej Trybulec, volume 10(23), of Studies in Logic, Grammar, and Rhetoric, pages 299-388. The University of Bialystok, Polen, 2007.\n \n\n\n\n
\n\n\n\n \n \n \"The preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B6,\n  Author =\t {Christoph Benzm{\\"u}ller and Chad Brown},\n  Booktitle =\t {From Insight to Proof -- Festschrift in Honour of\n                  Andrzej Trybulec},\n  Editor =\t {Roman Matuszewski and Anna Zalewska},\n  Isbn =\t {978-83-7431-128-1},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Higher Order Logic},\n  Pages =\t {299-388},\n  Publisher =\t {The University of Bialystok, Polen},\n  Series =\t {Studies in Logic, Grammar, and Rhetoric},\n  Title =\t {The curious inference of {B}oolos in {MIZAR} and\n                  {OMEGA}},\n  url_preprint = {http://christoph-benzmueller.de/papers/B6.pdf},\n  Volume =\t {10(23)},\n  Year =\t 2007,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Natural Language Dialog with a Tutor System for Mathematical Proofs.\n \n \n\n\n \n Benzmüller, C., Horacek, H., Kruijff-Korbayova, I., Pinkal, M., Siekmann, J., & Wolska, M.\n\n\n \n\n\n\n In Lu, R., Siekmann, J., & Ullrich, C., editor(s), Cognitive Systems, volume 4429, of LNCS, pages 1-14. Springer, 2007.\n \n\n\n\n
\n\n\n\n \n \n \"Natural preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B7,\n  Author =\t {Christoph Benzm{\\"u}ller and Helmut Horacek and\n                  Ivana Kruijff-Korbayova and Manfred Pinkal and\n                  J{\\"o}rg Siekmann and Magdalena Wolska},\n  Booktitle =\t {Cognitive Systems},\n  Doi =\t\t {10.1007/978-3-540-70934-3_1},\n  Editor =\t {Ruqian Lu and J{\\"o}rg Siekmann and Carsten Ullrich},\n  Isbn =\t {978-3-540-70933-6},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Proof Assistants, Tutoring Systems},\n  Pages =\t {1-14},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Natural Language Dialog with a Tutor System for\n                  Mathematical Proofs},\n  url_preprint = {http://christoph-benzmueller.de/papers/B7.pdf},\n  Volume =\t 4429,\n  Year =\t 2007,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n An Agent-based Architecture for Dialogue Systems.\n \n \n\n\n \n Buckley, M., & Benzmüller, C.\n\n\n \n\n\n\n In Virbitskaite, I., & Voronkov, A., editor(s), Perspectives of Systems Informatics, 6th International Andrei Ershov Memorial Conference, PSI 2006, Novosibirsk, Russia, June 27-30, 2006. Revised Papers, volume 4378, of LNCS, pages 135-147, 2007. Springer\n \n\n\n\n
\n\n\n\n \n \n \"An preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C21,\n  Author =\t {Mark Buckley and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Perspectives of Systems Informatics, 6th\n                  International Andrei Ershov Memorial Conference, PSI\n                  2006, Novosibirsk, Russia, June 27-30, 2006. Revised\n                  Papers},\n  Doi =\t\t {10.1007/978-3-540-70881-0_14},\n  Editor =\t {Irina Virbitskaite and Andrei Voronkov},\n  Isbn =\t {978-3-540-70880-3},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Proof Assistants, Agents, System\n                  Integration},\n  Pages =\t {135-147},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {An Agent-based Architecture for Dialogue Systems},\n  url_preprint = {http://christoph-benzmueller.de/papers/C21.pdf},\n  Volume =\t 4378,\n  Year =\t 2007,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n DiaWOz-II - A Tool for Wizard-of-Oz Experiments in Mathematics.\n \n \n\n\n \n Benzmüller, C., Horacek, H., Lesourd, H., Kruijff-Korbayova, I., Schiller, M., & Wolska, M.\n\n\n \n\n\n\n In Freksa, C., Kohlhase, M., & Schill, K., editor(s), KI 2006: Advances in Artificial Intelligence, 29th Annual German Conference on AI, KI 2006, Bremen, Germany, June 14-17, 2006, Proceedings, volume 4314, of LNCS, pages 159-173, 2007. Springer\n \n\n\n\n
\n\n\n\n \n \n \"DiaWOz-II preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C22,\n  Author =\t {Christoph Benzm{\\"u}ller and Helmut Horacek and\n                  Henri Lesourd and Ivana Kruijff-Korbayova and Marvin\n                  Schiller and Magdalena Wolska},\n  Booktitle =\t {KI 2006: Advances in Artificial Intelligence, 29th\n                  Annual German Conference on AI, KI 2006, Bremen,\n                  Germany, June 14-17, 2006, Proceedings},\n  Doi =\t\t {10.1007/978-3-540-69912-5_13},\n  Editor =\t {Freksa, Christian and Kohlhase, Michael and Schill,\n                  Kerstin},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Tutoring Systems},\n  Pages =\t {159-173},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {{DiaWOz-II} - A Tool for Wizard-of-Oz Experiments in\n                  Mathematics},\n  url_preprint = {http://christoph-benzmueller.de/papers/C22.pdf},\n  Volume =\t 4314,\n  Year =\t 2007,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Deep Inference for Automated Proof Tutoring?.\n \n \n\n\n \n Benzmüller, C., Dietrich, D., Schiller, M., & Autexier, S.\n\n\n \n\n\n\n In Hertzberg, J., Beetz, M., & Englert, R., editor(s), KI 2007: Advances in Artificial Intelligence, 30th Annual German Conference on AI, KI 2007, Osnabrück, Germany, September 10-13, 2007, Proceedings, volume 4667, pages 435-439, 2007. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Deep preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C24,\n  Author =\t {Christoph Benzm{\\"u}ller and Dominik Dietrich and\n                  Marvin Schiller and Serge Autexier},\n  Booktitle =\t {KI 2007: Advances in Artificial Intelligence, 30th\n                  Annual German Conference on AI, KI 2007,\n                  Osnabr{\\"u}ck, Germany, September 10-13, 2007,\n                  Proceedings},\n  Doi =\t\t {10.1007/978-3-540-74565-5_34},\n  Editor =\t {Joachim Hertzberg and Michael Beetz and Roman\n                  Englert},\n  Keywords =\t {own, Proof Assistants, OMEGA, Tutoring Systems, Deep\n                  Inference},\n  Pages =\t {435-439},\n  Publisher =\t {Springer},\n  Title =\t {Deep Inference for Automated Proof Tutoring?},\n  url_preprint = {http://christoph-benzmueller.de/papers/C24.pdf},\n  Volume =\t 4667,\n  Year =\t 2007,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n User Interfaces for Theorem Provers, Proceedings of UITP'06.\n \n \n\n\n \n Autexier, S., & Benzmüller, C.,\n editors.\n \n\n\n \n\n\n\n Volume 174, of Electronic Notes in Theoretical Computer Science.Elsevier. 2007.\n \n\n\n\n
\n\n\n\n \n \n \"UserPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n\n\n\n
\n
@proceedings{E9,\n  Booktitle =\t {User Interfaces for Theorem Provers, Proceedings of\n                  UITP'06},\n  Editor =\t {Serge Autexier and Christoph Benzm{\\"u}ller},\n  Issn =\t {1571-0661},\n  Keywords =\t {own, User Interface},\n  Number =\t 2,\n  Pages =\t {1-2},\n  Publisher =\t {Elsevier},\n  Series =\t {Electronic Notes in Theoretical Computer Science},\n  Title =\t {User Interfaces for Theorem Provers, Proceedings of\n                  UITP'06},\n  Url =\n                  {http://www.sciencedirect.com/science/journal/15710661/174/2},\n  Volume =\t 174,\n  Year =\t 2007,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n PLATO: A Mediator between Text-Editors and Proof Assistance Systems.\n \n \n\n\n \n Wagner, M., Autexier, S., & Benzmüller, C.\n\n\n \n\n\n\n Electronic Notes in Theoretical Computer Science, 174(2): 87-107. 2007.\n \n\n\n\n
\n\n\n\n \n \n \"PLATO: preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J14,\n  Author =\t {Marc Wagner and Serge Autexier and Christoph\n                  Benzm{\\"u}ller},\n  Doi =\t\t {10.1016/j.entcs.2006.09.024},\n  Issn =\t {1571-0661},\n  Journal =\t {Electronic Notes in Theoretical Computer Science},\n  Keywords =\t {own, Proof Assistants, Proof Presentation, OMEGA,\n                  Interactive Proof, System Integration, Mathematical\n                  Knowledge Management, User Interface},\n  Number =\t 2,\n  Pages =\t {87-107},\n  Title =\t {PLATO: A Mediator between Text-Editors and Proof\n                  Assistance Systems},\n  url_preprint = {http://christoph-benzmueller.de/papers/J14.pdf},\n  Volume =\t 174,\n  Year =\t 2007,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Preface: Proceedings of the 7th Workshop on User Interfaces for Theorem Provers (UITP 2006).\n \n \n\n\n \n Autexier, S., & Benzmüller, C.\n\n\n \n\n\n\n Electronic Notes in Theoretical Computer Science, 174(2): 1-2. 2007.\n \n\n\n\n
\n\n\n\n \n \n \"Preface: preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J15,\n  Author =\t {Serge Autexier and Christoph Benzm{\\"u}ller},\n  Doi =\t\t {10.1016/j.entcs.2006.09.017},\n  Issn =\t {1571-0661},\n  Journal =\t {Electronic Notes in Theoretical Computer Science},\n  Keywords =\t {own, User Interface, Proof Assistants},\n  Number =\t 2,\n  Pages =\t {1-2},\n  Title =\t {Preface: Proceedings of the 7th Workshop on User\n                  Interfaces for Theorem Provers ({UITP} 2006)},\n  url_preprint = {http://christoph-benzmueller.de/papers/J15.pdf},\n  Volume =\t 174,\n  Year =\t 2007,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The LEO-II Project.\n \n \n\n\n \n Benzmüller, C., Paulson, L. C., Theiss, F., & Fietzke, A.\n\n\n \n\n\n\n In Proceedings of the Fourteenth Workshop on Automated Reasoning, Bridging the Gap between Theory and Practice, 2007. Imperial College, London, England\n (Mildly reviewed)\n\n\n\n
\n\n\n\n \n \n \"The preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W36,\n  Author =\t {Christoph Benzm{\\"u}ller and Paulson, Lawrence\n                  C. and Frank Theiss and Arnaud Fietzke},\n  Booktitle =\t {Proceedings of the Fourteenth Workshop on Automated\n                  Reasoning, Bridging the Gap between Theory and\n                  Practice},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Automated\n                  Reasoning},\n  Note =\t {(Mildly reviewed)},\n  Publisher =\t {Imperial College, London, England},\n  Title =\t {The {LEO-II} Project},\n  url_preprint = {http://christoph-benzmueller.de/papers/W36.pdf},\n  Year =\t 2007,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Progress Report on LEO-II – An Automatic Theorem Prover for Higher-Order Logic.\n \n \n\n\n \n Benzmüller, C., Paulson, L. C., Theiss, F., & Fietzke, A.\n\n\n \n\n\n\n In TPHOLs 2007 Emerging Trends Proceedings, pages 33-48, University of Kaiserslautern, Germany, 2007. Internal Report 364/07 at Department of Computer Science\n \n\n\n\n
\n\n\n\n \n \n \"Progress preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W37,\n  Author =\t {Christoph Benzm{\\"u}ller and Paulson, Lawrence\n                  C. and Frank Theiss and Arnaud Fietzke},\n  Booktitle =\t {TPHOLs 2007 Emerging Trends Proceedings},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2007-LEO-II-TPHOLS.pdf">slides</a>},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Automated\n                  Reasoning},\n  Pages =\t {33-48},\n  Publisher =\t {Internal Report 364/07 at Department of Computer\n                  Science},\n  Address =\t {University of Kaiserslautern, Germany},\n  Title =\t {Progress Report on {LEO-II} -- An Automatic Theorem\n                  Prover for Higher-Order Logic},\n  url_preprint = {http://christoph-benzmueller.de/papers/W37.pdf},\n  Year =\t 2007,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Towards Computer-Assisted Proof Tutoring.\n \n \n\n\n \n Schiller, M., Dietrich, D., & Benzmüller, C.\n\n\n \n\n\n\n In JEM Workshop on identifying and supporting (scientific) communities in education and research, Jacobs University Bremen, Germany, 2007. \n (Mildly reviewed)\n\n\n\n
\n\n\n\n \n \n \"Towards preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W38,\n  Address =\t {Jacobs University Bremen, Germany},\n  Author =\t {Marvin Schiller and Dominik Dietrich and Christoph\n                  Benzm{\\"u}ller},\n  Booktitle =\t {JEM Workshop on identifying and supporting\n                  (scientific) communities in education and research},\n  Keywords =\t {own, Proof Presentation, DIALOG, Natural Language\n                  Dialog, Proof Assistants, Machine Learning, Tutoring\n                  Systems},\n  Note =\t {(Mildly reviewed)},\n  Title =\t {Towards Computer-Assisted Proof Tutoring},\n  url_preprint = {http://christoph-benzmueller.de/papers/W38.pdf},\n  Year =\t 2007,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2006\n \n \n (14)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n OMEGA.\n \n \n\n\n \n Benzmüller, C., Fiedler, A., Meier, A., Pollet, M., & Siekmann, J.\n\n\n \n\n\n\n In Wiedijk, F., editor(s), The Seventeen Provers of the World, of LNCS, pages 127-141. Springer, 2006.\n \n\n\n\n
\n\n\n\n \n \n \"OMEGA preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B3,\n  Author =\t {Christoph Benzm{\\"u}ller and Armin Fiedler and\n                  Andreas Meier and Martin Pollet and J{\\"o}rg\n                  Siekmann},\n  Booktitle =\t {The Seventeen Provers of the World},\n  Doi =\t\t {10.1007/11542384_17},\n  Editor =\t {Freek Wiedijk},\n  Isbn =\t {978-3-540-30704-4},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Automated Reasoning, Proof Planning, System\n                  Integration},\n  Number =\t 3600,\n  Pages =\t {127-141},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {OMEGA},\n  url_preprint = {http://christoph-benzmueller.de/papers/B3.pdf},\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Generic Modular Data Structure for Proof Attempts Alternating on Ideas and Granularity.\n \n \n\n\n \n Autexier, S., Benzmüller, C., Dietrich, D., Meier, A., & Wirth, C.\n\n\n \n\n\n\n In Kohlhase, M., editor(s), Mathematical Knowledge Management, 4th International Conference, MKM 2005, Bremen, Germany, July 15-17, 2005, Revised Selected Papers, volume 3863, of LNCS, pages 126-142, 2006. Springer\n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C19,\n  Author =\t {Serge Autexier and Christoph Benzm{\\"u}ller and\n                  Dominik Dietrich and Andreas Meier and Claus-Peter\n                  Wirth},\n  Booktitle =\t {Mathematical Knowledge Management, 4th International\n                  Conference, MKM 2005, Bremen, Germany, July 15-17,\n                  2005, Revised Selected Papers},\n  Doi =\t\t {10.1007/11618027_9},\n  Editor =\t {Michael Kohlhase},\n  Keywords =\t {own, DIALOG, Proof Presentation, Proof Assistants,\n                  OMEGA},\n  Pages =\t {126-142},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {A Generic Modular Data Structure for Proof Attempts\n                  Alternating on Ideas and Granularity},\n  url_preprint = {http://christoph-benzmueller.de/papers/C19.pdf},\n  Volume =\t 3863,\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A corpus of tutorial dialogs on theorem proving; the influence of the presentation of the study-material.\n \n \n\n\n \n Benzmüller, C., Horacek, H., Lesourd, H., Kruijff-Korbayova, I., Schiller, M., & Wolska, M.\n\n\n \n\n\n\n In Proceedings of International Conference on Language Resources and Evaluation (LREC 2006), Genova, Italy, 2006. ELDA\n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C20,\n  Address =\t {Genova, Italy},\n  Author =\t {Christoph Benzm{\\"u}ller and Helmut Horacek and\n                  Henri Lesourd and Ivana Kruijff-Korbayova and Marvin\n                  Schiller and Magdalena Wolska},\n  Booktitle =\t {Proceedings of International Conference on Language\n                  Resources and Evaluation (LREC 2006)},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Tutoring Systems},\n  Publisher =\t {ELDA},\n  Title =\t {A corpus of tutorial dialogs on theorem proving; the\n                  influence of the presentation of the study-material},\n  url_preprint = {http://christoph-benzmueller.de/papers/C20.pdf},\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Cut-Simulation in Impredicate Logics.\n \n \n\n\n \n Benzmüller, C., Brown, C., & Kohlhase, M.\n\n\n \n\n\n\n In Furbach, U., & Shankar, N., editor(s), Automated Reasoning, Third International Joint Conference, IJCAR 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings, volume 4130, of LNCS, pages 220-234, 2006. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Cut-Simulation preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C23,\n  Author =\t {Christoph Benzm{\\"u}ller and Chad Brown and Michael\n                  Kohlhase},\n  Booktitle =\t {Automated Reasoning, Third International Joint\n                  Conference, IJCAR 2006, Seattle, WA, USA, August\n                  17-20, 2006, Proceedings},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2006-IJCAR.pdf">slides</a>},\n  Doi =\t\t {10.1007/11814771_20},\n  Editor =\t {Ulrich Furbach and Natarajan Shankar},\n  Keywords =\t {own, Higher Order Logic, Henkin Semantics,\n                  Cut-Elimination},\n  Pages =\t {220-234},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Cut-Simulation in Impredicate Logics},\n  url_preprint = {http://christoph-benzmueller.de/papers/C23.pdf},\n  Volume =\t 4130,\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Proceedings of the 6th International Workshop on the Implementation of Logics.\n \n \n\n\n \n Benzmüller, C., Fischer, B., & Sutcliffe, G.,\n editors.\n \n\n\n \n\n\n\n Volume 212, of CEUR Workshop Proceedings.CEUR-WS.org. 2006.\n \n\n\n\n
\n\n\n\n \n \n \"ProceedingsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{E10,\n  Editor =\t {Benzm{\\"u}ller, Christoph and Fischer, Bernd and\n                  Sutcliffe, Geoff},\n  Issn =\t {ISSN 1613-0073},\n  Publisher =\t {CEUR-WS.org},\n  Series =\t {CEUR Workshop Proceedings},\n  Title =\t {Proceedings of the 6th International Workshop on the\n                  Implementation of Logics},\n  Url =\t\t {http://ceur-ws.org/Vol-212/},\n  Volume =\t 212,\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Special Issue on Assistance Systems for Mathematics.\n \n \n\n\n \n Benzmüller, C.,\n editor.\n \n\n\n \n\n\n\n Journal of Applied Logic, Elsevier. 2006.\n \n\n\n\n
\n\n\n\n \n \n \"SpecialPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@proceedings{E7,\n  editor =\t {Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, CALCULEMUS, Symb. Computation and\n                  Symb. Reasoning, Proof Assistants, History of Logic},\n  Publisher =\t {Journal of Applied Logic, Elsevier},\n  Title =\t {Special Issue on Assistance Systems for Mathematics},\n  Url =\n                  {https://www.sciencedirect.com/journal/journal-of-applied-logic/vol/4/issue/4},\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computer Supported Mathematics with OMEGA.\n \n \n\n\n \n Siekmann, J., Benzmüller, C., & Autexier, S.\n\n\n \n\n\n\n Journal of Applied Logic, 4(4): 533-559. 2006.\n \n\n\n\n
\n\n\n\n \n \n \"Computer preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J12,\n  Author =\t {J{\\"o}rg Siekmann and Christoph Benzm{\\"u}ller and\n                  Serge Autexier},\n  Doi =\t\t {10.1016/j.jal.2005.10.008},\n  Journal =\t {Journal of Applied Logic},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Automated Reasoning, Proof Planning, System\n                  Integration, Agents, ERIH PLUS},\n  Number =\t 4,\n  Pages =\t {533-559},\n  Title =\t {Computer Supported Mathematics with {OMEGA}},\n  url_preprint = {http://christoph-benzmueller.de/papers/J12.pdf},\n  Volume =\t 4,\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Editorial: Towards Computer Aided Mathematics.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Journal of Applied Logic, 4(4): 359-365. 2006.\n (non-reviewed)\n\n\n\n
\n\n\n\n \n \n \"Editorial: preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J13,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Doi =\t\t {10.1016/j.jal.2005.10.001},\n  Journal =\t {Journal of Applied Logic},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Automated Reasoning, System Integration,\n                  Symb. Computation and Symb. Reasoning, ERIH PLUS},\n  Note =\t {(non-reviewed)},\n  Number =\t 4,\n  Pages =\t {359-365},\n  Title =\t {Editorial: Towards Computer Aided Mathematics},\n  url_preprint = {http://christoph-benzmueller.de/papers/J13.pdf},\n  Volume =\t 4,\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Semantics of Higher-Order Logic.\n \n \n\n\n \n Benzmüller, C., & Brown, C.\n\n\n \n\n\n\n 2006.\n Course Notes from the 18th European Summer School in Logic, Language and Information (ESSLLI'06)\n\n\n\n
\n\n\n\n \n \n \"Semantics preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@unpublished{R38,\n  Address =\t {Malaga, Spain},\n  Author =\t {Christoph Benzm{\\"u}ller and Chad Brown},\n  Note =\t {Course Notes from the 18th European Summer School in\n                  Logic, Language and Information (ESSLLI'06)},\n  Pages =\t {1-50},\n  Title =\t {Semantics of Higher-Order Logic},\n  url_preprint = {http://christoph-benzmueller.de/papers/R38.pdf},\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Cut-Simulation in Impredicative Logics (extended version).\n \n \n\n\n \n Benzmüller, C., Brown, C., & Kohlhase, M.\n\n\n \n\n\n\n Technical Report SR-2006-01, Saarland University, Saarbrücken, Germany, 2006.\n \n\n\n\n
\n\n\n\n \n \n \"Cut-Simulation preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R39,\n  Author =\t {Christoph Benzm{\\"u}ller and Chad Brown and Michael\n                  Kohlhase},\n  Institution =\t {Saarland University, Saarbr{\\"u}cken, Germany},\n  Number =\t {SR-2006-01},\n  Publisher =\t {SEKI Publications (ISSN 1437-4447)},\n  Title =\t {Cut-Simulation in Impredicative Logics (extended\n                  version)},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R39.pdf},\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Cumulative Habilitation Script.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Saarland University, Germany, 2006.\n \n\n\n\n
\n\n\n\n \n \n \"Cumulative preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@book{T3,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, thesis, Higher Order Logic, Henkin Semantics,\n                  LEO Prover, Automated Reasoning},\n  Pages =\t {1-357},\n  Publisher =\t {Saarland University, Germany},\n  Title =\t {Cumulative Habilitation Script},\n  url_preprint = {http://christoph-benzmueller.de/papers/T3.pdf},\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Granularity Judgments in Proof Tutoring.\n \n \n\n\n \n Schiller, M., & Benzmüller, C.\n\n\n \n\n\n\n In Poster papers at KI 2006: Advances in Artificial Intelligence: 29th Annual German Conference on AI, Bremen, Germany, 2006. \n \n\n\n\n
\n\n\n\n \n \n \"Granularity preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W33,\n  Address =\t {Bremen, Germany},\n  Author =\t {Marvin Schiller and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Poster papers at KI 2006: Advances in Artificial\n                  Intelligence: 29th Annual German Conference on AI},\n  Keywords =\t {own, Proof Presentation, DIALOG, Natural Language\n                  Dialog, Proof Assistants, Machine Learning, Tutoring\n                  Systems},\n  Title =\t {Granularity Judgments in Proof Tutoring},\n  url_preprint = {http://christoph-benzmueller.de/papers/W33.pdf},\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Judging Granularity for Automated Mathematics Teaching.\n \n \n\n\n \n Schiller, M., Benzmüller, C., & van de Veire, A.\n\n\n \n\n\n\n In Short papers at LPAR 2006: 13th International Conference on Logic for Programming Artificial Intelligence and Reasoning, Pnom Penh, Cambodia, 2006. \n \n\n\n\n
\n\n\n\n \n \n \"Judging preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W34,\n  Address =\t {Pnom Penh, Cambodia},\n  Author =\t {Marvin Schiller and Christoph Benzm{\\"u}ller and Ann\n                  van de Veire},\n  Booktitle =\t {Short papers at LPAR 2006: 13th International\n                  Conference on Logic for Programming Artificial\n                  Intelligence and Reasoning},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2006-Cambodia-Short.pdf">slides</a>},\n  Keywords =\t {own, Proof Presentation, DIALOG, Natural Language\n                  Dialog, Proof Assistants, Machine Learning, Tutoring\n                  Systems},\n  Title =\t {Judging Granularity for Automated Mathematics\n                  Teaching},\n  url_preprint = {http://christoph-benzmueller.de/papers/W34.pdf},\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Term Indexing for the LEO-II Prover.\n \n \n\n\n \n Theiss, F., & Benzmüller, C.\n\n\n \n\n\n\n In IWIL-6 workshop at LPAR 2006: The 6th International Workshop on the Implementation of Logics, Pnom Penh, Cambodia, 2006. \n \n\n\n\n
\n\n\n\n \n \n \"Term preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W35,\n  Address =\t {Pnom Penh, Cambodia},\n  Author =\t {Frank Theiss and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {IWIL-6 workshop at LPAR 2006: The 6th International\n                  Workshop on the Implementation of Logics},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2006-iwil.pdf">slides</a>},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Automated\n                  Reasoning},\n  Title =\t {Term Indexing for the {LEO-II} Prover},\n  url_preprint = {http://christoph-benzmueller.de/papers/W35.pdf},\n  Year =\t 2006,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2005\n \n \n (10)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Can a Higher-Order and a First-Order Theorem Prover Cooperate?.\n \n \n\n\n \n Benzmüller, C., Sorge, V., Jamnik, M., & Kerber, M.\n\n\n \n\n\n\n In Baader, F., & Voronkov, A., editor(s), Logic for Programming, Artificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings, of LNCS, pages 415-431, 2005. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Can preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C16,\n  Author =\t {Christoph Benzm{\\"u}ller and Volker Sorge and Mateja\n                  Jamnik and Manfred Kerber},\n  Booktitle =\t {Logic for Programming, Artificial Intelligence, and\n                  Reasoning, 11th International Conference, LPAR 2004,\n                  Montevideo, Uruguay, March 14-18, 2005, Proceedings},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2005-Montevideo-LPAR.pdf">slides</a>},\n  Doi =\t\t {10.1007/978-3-540-32275-7_27},\n  Editor =\t {Franz Baader and Andrei Voronkov},\n  Keywords =\t {own, Higher Order Logic, Automated Reasoning, LEO\n                  Prover, System Integration},\n  Number =\t 3452,\n  Pages =\t {415-431},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Can a Higher-Order and a First-Order Theorem Prover\n                  Cooperate?},\n  url_preprint = {http://christoph-benzmueller.de/papers/C16.pdf},\n  Year =\t 2005,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Structured Set of Higher-Order Problems.\n \n \n\n\n \n Benzmüller, C., & Brown, C.\n\n\n \n\n\n\n In Hurd, J., & Melham, T. F., editor(s), Theorem Proving in Higher Order Logics, 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings, of LNCS, pages 66-81, 2005. Springer\n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C17,\n  Author =\t {Christoph Benzm{\\"u}ller and Chad Brown},\n  Booktitle =\t {Theorem Proving in Higher Order Logics, 18th\n                  International Conference, TPHOLs 2005, Oxford, UK,\n                  August 22-25, 2005, Proceedings},\n  Doi =\t\t {10.1007/11541868_5},\n  Editor =\t {Joe Hurd and Thomas F. Melham},\n  Keywords =\t {own, Higher Order Logic, Automated Reasoning, Henkin\n                  Semantics},\n  Number =\t 3603,\n  Pages =\t {66-81},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {A Structured Set of Higher-Order Problems},\n  url_preprint = {http://christoph-benzmueller.de/papers/C17.pdf},\n  Year =\t 2005,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Mathematical Domain Reasoning Tasks in Natural Language Tutorial Dialog on Proofs.\n \n \n\n\n \n Benzmüller, C., & Vo, B. Q.\n\n\n \n\n\n\n In Veloso, M., & Kambhampati, S., editor(s), Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, July 9-13, 2005, Pittsburgh, Pennsylvania, USA, pages 516-522, 2005. AAAI Press / The MIT Press\n \n\n\n\n
\n\n\n\n \n \n \"Mathematical preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C18,\n  Author =\t {Christoph Benzm{\\"u}ller and Bao Quoc Vo},\n  Booktitle =\t {Proceedings, The Twentieth National Conference on\n                  Artificial Intelligence and the Seventeenth\n                  Innovative Applications of Artificial Intelligence\n                  Conference, July 9-13, 2005, Pittsburgh,\n                  Pennsylvania, USA},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2005-AAAI.pdf">slides</a>},\n  Editor =\t {Manuela Veloso and Subbarao Kambhampati},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Proof Assistants, Tutoring Systems},\n  Pages =\t {516-522},\n  Publisher =\t {AAAI Press / The MIT Press},\n  Title =\t {Mathematical Domain Reasoning Tasks in Natural\n                  Language Tutorial Dialog on Proofs},\n  url_preprint = {http://christoph-benzmueller.de/papers/C18.pdf},\n  Year =\t 2005,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Proceedings of the LPAR-05 Workshop: Empirically Successfull Automated Reasoning in Higher-Order Logic (ESHOL).\n \n \n\n\n \n Benzmüller, C., Harrison, J., & Schürmann, C.,\n editors.\n \n\n\n \n\n\n\n Wexford Hotel, Montego Bay, Jamaica, 2005.\n arXiv:cs/0601042\n\n\n\n
\n\n\n\n \n \n \"ProceedingsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@proceedings{E8,\n  Address =\t {Wexford Hotel, Montego Bay, Jamaica},\n  Booktitle =\t {Proceedings of the LPAR-05 Workshop: Empirically\n                  Successfull Automated Reasoning in Higher-Order\n                  Logic (ESHOL)},\n  Editor =\t {Christoph Benzm{\\"u}ller and John Harrison and\n                  Carsten Sch{\\"u}rmann},\n  Keywords =\t {own, Higher Order Logic, Automated Reasoning},\n  Note =\t {arXiv:cs/0601042},\n  Title =\t {Proceedings of the LPAR-05 Workshop: Empirically\n                  Successfull Automated Reasoning in Higher-Order\n                  Logic (ESHOL)},\n  Url =\t\t {http://arxiv.org/abs/cs/0601042},\n  Year =\t 2005,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Integrating Proof Assistants as Reasoning and Verification Tools into a Scientific WYSIWYG Editor.\n \n \n\n\n \n Autexier, S., Benzmüller, C., Fiedler, A., & Lesourd, H.\n\n\n \n\n\n\n 2005.\n This paper was formally accepted for the UITP'05 post-proceedings in ENTCS; this volume did not appear though.\n\n\n\n
\n\n\n\n \n \n \"Integrating preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{J10,\n  Author =\t {Serge Autexier and Christoph Benzm{\\"u}ller and\n                  Armin Fiedler and Henri Lesourd},\n  Journal =\t {Electronic Notes in Theoretical Computer Science},\n  Keywords =\t {own, DIALOG, Proof Presentation, User Interface,\n                  Proof Assistants},\n  Note =\t {This paper was formally accepted for the UITP'05\n                  post-proceedings in ENTCS; this volume did not\n                  appear though.},\n  Title =\t {Integrating Proof Assistants as Reasoning and\n                  Verification Tools into a Scientific WYSIWYG Editor},\n  url_preprint = {http://christoph-benzmueller.de/papers/J10.pdf},\n  Year =\t 2005,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n System Description: A Dialog Manager supporting Tutorial Natural Language Dialogue on Proofs.\n \n \n\n\n \n Buckley, M., & Benzmüller, C.\n\n\n \n\n\n\n 2005.\n This paper was formally accepted for the UITP'05 post-proceedings in ENTCS; this volume did not appear though.\n\n\n\n
\n\n\n\n \n \n \"System preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{J11,\n  Author =\t {Mark Buckley and Christoph Benzm{\\"u}ller},\n  Journal =\t {Electronic Notes in Theoretical Computer Science},\n  Keywords =\t {own, Natural Language Dialog, Agents, System\n                  Integration},\n  Note =\t {This paper was formally accepted for the UITP'05\n                  post-proceedings in ENTCS; this volume did not\n                  appear though.},\n  Title =\t {System Description: A Dialog Manager supporting\n                  Tutorial Natural Language Dialogue on Proofs},\n  url_preprint = {http://christoph-benzmueller.de/papers/J11.pdf},\n  Year =\t 2005,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n System Description: A Dialog Manager supporting Tutorial Natural Language Dialogue on Proofs.\n \n \n\n\n \n Buckley, M., & Benzmüller, C.\n\n\n \n\n\n\n In Proceedings of the ETAPS Satellite Workshop on User Interfaces for Theorem Provers (UITP), pages 40-67, Edinburgh, Scotland, 2005. \n \n\n\n\n
\n\n\n\n \n \n \"System preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W29,\n  Address =\t {Edinburgh, Scotland},\n  Author =\t {Mark Buckley and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Proceedings of the ETAPS Satellite Workshop on User\n                  Interfaces for Theorem Provers (UITP)},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Proof Assistants, Tutoring Systems, Agents,\n                  System Integration},\n  Pages =\t {40-67},\n  Title =\t {System Description: A Dialog Manager supporting\n                  Tutorial Natural Language Dialogue on Proofs},\n  url_preprint = {http://christoph-benzmueller.de/papers/W29.pdf},\n  Year =\t 2005,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Integrating Proof Assistants as Reasoning and Verification Tools into a Scientific WYSIWIG Editor.\n \n \n\n\n \n Buckley, M., & Benzmüller, C.\n\n\n \n\n\n\n In Proceedings of the ETAPS Satellite Workshop on User Interfaces for Theorem Provers (UITP), pages 16-39, Edinburgh, Scotland, 2005. \n \n\n\n\n
\n\n\n\n \n \n \"Integrating preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W30,\n  Address =\t {Edinburgh, Scotland},\n  Author =\t {Mark Buckley and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Proceedings of the ETAPS Satellite Workshop on User\n                  Interfaces for Theorem Provers (UITP)},\n  Pages =\t {16-39},\n  Title =\t {Integrating Proof Assistants as Reasoning and\n                  Verification Tools into a Scientific WYSIWIG Editor},\n  url_preprint = {http://christoph-benzmueller.de/papers/W30.pdf},\n  Year =\t 2005,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n System Description: LEO – A Resolution based Higher-Order Theorem Prover.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Proceedings of the LPAR-05 Workshop: Empirically Successfull Automated Reasoning in Higher-Order Logic (ESHOL), pages 25-44, Wexford Hotel, Montego Bay, Jamaica, 2005. \n arXiv:cs/0601042\n\n\n\n
\n\n\n\n \n \n \"SystemPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W31,\n  Address =\t {Wexford Hotel, Montego Bay, Jamaica},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Proceedings of the LPAR-05 Workshop: Empirically\n                  Successfull Automated Reasoning in Higher-Order\n                  Logic (ESHOL)},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Automated\n                  Reasoning, Henkin Semantics},\n  Note =\t {arXiv:cs/0601042},\n  Pages =\t {25-44},\n  Title =\t {System Description: {LEO} -- A Resolution based\n                  Higher-Order Theorem Prover},\n  Url =\t\t {http://arxiv.org/abs/cs/0601042},\n  doi =\t\t {10.48550/ARXIV.CS/0601042},\n  Year =\t 2005,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Combining Proofs of Higher-Order and First-Order Automated Theorem Provers.\n \n \n\n\n \n Benzmüller, C., Sorge, V., Jamnik, M., & Kerber, M.\n\n\n \n\n\n\n In Proceedings of the LPAR-05 Workshop: Empirically Successfull Automated Reasoning in Higher-Order Logic (ESHOL), pages 45-58, Wexford Hotel, Montego Bay, Jamaica, 2005. \n arXiv:cs/0601042\n\n\n\n
\n\n\n\n \n \n \"CombiningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W32,\n  Address =\t {Wexford Hotel, Montego Bay, Jamaica},\n  Author =\t {Christoph Benzm{\\"u}ller and Volker Sorge and Mateja\n                  Jamnik and Manfred Kerber},\n  Booktitle =\t {Proceedings of the LPAR-05 Workshop: Empirically\n                  Successfull Automated Reasoning in Higher-Order\n                  Logic {(ESHOL)}},\n  Note =\t {arXiv:cs/0601042},\n  Pages =\t {45-58},\n  Title =\t {Combining Proofs of Higher-Order and First-Order\n                  Automated Theorem Provers},\n  Url =\t\t {http://arxiv.org/abs/cs/0601042},\n  Year =\t 2005,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2004\n \n \n (18)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Bridging Theorem Proving and Mathematical Knowledge Retrieval.\n \n \n\n\n \n Benzmüller, C., Meier, A., & Sorge, V.\n\n\n \n\n\n\n In Hutter, D., & Stephan, W., editor(s), Mechanizing Mathematical Reasoning: Essays in Honor of Jörg Siekmann on the Occasion of His 60th Birthday, volume 2605, of LNCS, pages 277-296. Springer, 2004.\n \n\n\n\n
\n\n\n\n \n \n \"Bridging preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B2,\n  Abstract =\t {Accessing knowledge of a single knowledge source\n                  with different client applications often requires\n                  the help of mediator systems as middleware\n                  components. In the domain of theorem proving large\n                  efforts have been made to formalize knowledge for\n                  mathematics and verification issues, and to\n                  structure it in databases. But these databases are\n                  either specialized for a single client, or if the\n                  knowledge is stored in a general database, the\n                  services this database can provide are usually\n                  limited and hard to adjust for a particular theorem\n                  prover. Only recently there have been initiatives to\n                  flexibly connect existing theorem proving systems\n                  into networked environments that contain large\n                  knowledge bases. An intermediate layer containing\n                  both, search and proving functionality can be used\n                  to mediate between the two. In this paper we\n                  motivate the need and discuss the requirements for\n                  mediators between mathematical knowledge bases and\n                  theorem proving systems. We also present an attempt\n                  at a concurrent mediator between a knowledge base\n                  and a proof planning system.},\n  Author =\t {Christoph Benzm{\\"u}ller and Andreas Meier and\n                  Volker Sorge},\n  Booktitle =\t {Mechanizing Mathematical Reasoning: Essays in Honor\n                  of {J{\\"o}rg Siekmann} on the Occasion of His 60th\n                  Birthday},\n  Doi =\t\t {10.1007/978-3-540-32254-2_17},\n  Editor =\t {Dieter Hutter and Werner Stephan},\n  Isbn =\t {978-3-540-25051-7},\n  Keywords =\t {own, Proof Assistants, OMEGA, Mathematical Knowledge\n                  Management, System Integration, Interactive Proof},\n  Pages =\t {277-296},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Bridging Theorem Proving and Mathematical Knowledge\n                  Retrieval},\n  url_preprint = {http://christoph-benzmueller.de/papers/B2.pdf},\n  Volume =\t 2605,\n  Year =\t 2004,\n}\n\n
\n
\n\n\n
\n Accessing knowledge of a single knowledge source with different client applications often requires the help of mediator systems as middleware components. In the domain of theorem proving large efforts have been made to formalize knowledge for mathematics and verification issues, and to structure it in databases. But these databases are either specialized for a single client, or if the knowledge is stored in a general database, the services this database can provide are usually limited and hard to adjust for a particular theorem prover. Only recently there have been initiatives to flexibly connect existing theorem proving systems into networked environments that contain large knowledge bases. An intermediate layer containing both, search and proving functionality can be used to mediate between the two. In this paper we motivate the need and discuss the requirements for mediators between mathematical knowledge bases and theorem proving systems. We also present an attempt at a concurrent mediator between a knowledge base and a proof planning system.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n An annotated corpus of tutorial dialogs on mathematical theorem proving.\n \n \n\n\n \n Wolska, M., Vo, B. Q., Tsovaltzi, D., Kruijff-Korbayova, I., Karagjosova, E., Horacek, H., Gabsdil, M., Fiedler, A., & Benzmüller, C.\n\n\n \n\n\n\n In Proceedings of International Conference on Language Resources and Evaluation (LREC 2004), Lisbon, Portugal, 2004. ELDA\n \n\n\n\n
\n\n\n\n \n \n \"An preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C14,\n  Address =\t {Lisbon, Portugal},\n  Author =\t {Magdalena Wolska and Bao Quoc Vo and Dimitra\n                  Tsovaltzi and Ivana Kruijff-Korbayova and Elena\n                  Karagjosova and Helmut Horacek and Malte Gabsdil and\n                  Armin Fiedler and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Proceedings of International Conference on Language\n                  Resources and Evaluation (LREC 2004)},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Tutoring Systems},\n  Publisher =\t {ELDA},\n  Title =\t {An annotated corpus of tutorial dialogs on\n                  mathematical theorem proving},\n  url_preprint = {http://christoph-benzmueller.de/papers/C14.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n OMEGA: Computer Supported Mathematics.\n \n \n\n\n \n Siekmann, J., & Benzmüller, C.\n\n\n \n\n\n\n In Biundo, S., Frühwirth, T. W., & Palm, G., editor(s), KI 2004: Advances in Artificial Intelligence, 27th Annual German Conference on AI, KI 2004, Ulm, Germany, September 20-24, 2004, Proceedings, of LNCS, pages 3-28, Ulm, Germany, 2004. \n \n\n\n\n
\n\n\n\n \n \n \"OMEGA: preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C15,\n  Address =\t {Ulm, Germany},\n  Author =\t {J{\\"o}rg Siekmann and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {KI 2004: Advances in Artificial Intelligence, 27th\n                  Annual German Conference on AI, KI 2004, Ulm,\n                  Germany, September 20-24, 2004, Proceedings},\n  Doi =\t\t {10.1007/978-3-540-30221-6_2},\n  Editor =\t {Susanne Biundo and Thom W. Fr{\\"u}hwirth and\n                  G{\\"u}nther Palm},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Automated Reasoning, Proof Planning, System\n                  Integration},\n  Number =\t 3228,\n  Pages =\t {3-28},\n  Series =\t {LNCS},\n  Title =\t {{OMEGA}: Computer Supported Mathematics},\n  url_preprint = {http://christoph-benzmueller.de/papers/C15.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Computer-Supported Mathematical Theory Development.\n \n \n\n\n \n Benzmüller, C., & Windsteiger, W.,\n editors.\n \n\n\n \n\n\n\n of RISC Report Series.RISC Institute, University of Linz. 2004.\n Proceedings of the first ``Workshop on Computer-Supported Mathematical Theory Development'' held in the frame of IJCAR 2004 in Cork, Ireland, July 5, 2004. ISBN 3-902276-04-5.\n\n\n\n
\n\n\n\n \n \n \"Computer-Supported preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@proceedings{E6,\n  Editor =\t {Benzm{\\"u}ller, Christoph and Windsteiger, Wolfgang},\n  Keywords =\t {own, CALCULEMUS, Symb. Computation and\n                  Symb. Reasoning},\n  Note =\t {Proceedings of the first ``Workshop on\n                  Computer-Supported Mathematical Theory Development''\n                  held in the frame of IJCAR 2004 in Cork, Ireland,\n                  July 5, 2004. ISBN 3-902276-04-5.},\n  Number =\t {04-14},\n  Organization = {RISC Institute, University of Linz},\n  Series =\t {RISC Report Series},\n  Title =\t {{Computer-Supported Mathematical Theory\n                  Development}},\n  url_preprint = {http://christoph-benzmueller.de/papers/E6.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Higher-Order Semantics and Extensionality.\n \n \n\n\n \n Benzmüller, C., Brown, C., & Kohlhase, M.\n\n\n \n\n\n\n Journal of Symbolic Logic, 69(4): 1027-1088. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"Higher-Order preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J6,\n  Author =\t {Christoph Benzm{\\"u}ller and Chad Brown and Michael\n                  Kohlhase},\n  Doi =\t\t {10.2178/jsl/1102022211},\n  Journal =\t {Journal of Symbolic Logic},\n  Keywords =\t {own, Higher Order Logic, Henkin Semantics,\n                  Cut-Elimination, ERIH PLUS},\n  Number =\t 4,\n  Pages =\t {1027-1088},\n  Title =\t {Higher-Order Semantics and Extensionality},\n  url_preprint = {https://www.researchgate.net/publication/38338872},\n  Volume =\t 69,\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Assertion-level Proof Representation with Under-Specification.\n \n \n\n\n \n Autexier, S., Benzmüller, C., Fiedler, A., Horacek, H., & Vo, B. Q.\n\n\n \n\n\n\n Electronic Notes in Theoretical Computer Science, 93: 5-23. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"Assertion-level preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J8,\n  Author =\t {Serge Autexier and Christoph Benzm{\\"u}ller and\n                  Armin Fiedler and Helmut Horacek and Bao Quoc Vo},\n  Doi =\t\t {10.1016/j.entcs.2003.12.026},\n  Journal =\t {Electronic Notes in Theoretical Computer Science},\n  Keywords =\t {own, Proof Assistants, Proof Planning, System\n                  Integration, Proof Presentation, Proof\n                  Transformation},\n  Pages =\t {5-23},\n  Title =\t {Assertion-level Proof Representation with\n                  Under-Specification},\n  url_preprint = {http://christoph-benzmueller.de/papers/J8.pdf},\n  Volume =\t 93,\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Interactive Theorem Proving with Tasks.\n \n \n\n\n \n Hübner, M., Autexier, S., Benzmüller, C., & Meier, A.\n\n\n \n\n\n\n Electronic Notes in Theoretical Computer Science, 103(C): 161-181. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"Interactive preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J9,\n  Author =\t {Malte H\\"ubner and Serge Autexier and Christoph\n                  Benzm{\\"u}ller and Andreas Meier},\n  Doi =\t\t {10.1016/j.entcs.2004.02.021},\n  Journal =\t {Electronic Notes in Theoretical Computer Science},\n  Keywords =\t {own, Agents, Proof Assistants, Proof Planning,\n                  System Integration},\n  Number =\t {C},\n  Pages =\t {161-181},\n  Title =\t {Interactive Theorem Proving with Tasks},\n  url_preprint = {http://christoph-benzmueller.de/papers/J9.pdf},\n  Volume =\t 103,\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n ALONZO: Higher-Order Reasoning Agents for Mathematics.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n 2004.\n EURYI project proposal\n\n\n\n
\n\n\n\n \n \n \"ALONZO: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@unpublished{R27,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Note =\t {EURYI project proposal},\n  Pages =\t {1-37},\n  Title =\t {ALONZO: Higher-Order Reasoning Agents for\n                  Mathematics},\n  url_preprint = {http://christoph-benzmueller.de/papers/R23.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n DIALOG: Tutorial Dialog with an Assistance System for Mathematics.\n \n \n\n\n \n Pinkal, M., Siekmann, J., & Benzmüller, C.\n\n\n \n\n\n\n 2004.\n Project report in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes\n\n\n\n
\n\n\n\n \n \n \"DIALOG: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R28,\n  Author =\t {Manfred Pinkal and J{\\"o}rg Siekmann and Christoph\n                  Benzm{\\"u}ller},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Proof Assistants, Tutoring Systems},\n  Note =\t {Project report in the Collaborative Research Centre\n                  SFB 378 on Resource-adaptive Cognitive Processes},\n  Pages =\t {1-24},\n  Title =\t {DIALOG: Tutorial Dialog with an Assistance System\n                  for Mathematics},\n  url_preprint = {http://christoph-benzmueller.de/papers/R28.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n OMEGA: Resource-adaptive Proof Planning.\n \n \n\n\n \n Siekmann, J., Benzmüller, C., & Melis, E.\n\n\n \n\n\n\n 2004.\n Project report in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes\n\n\n\n
\n\n\n\n \n \n \"OMEGA: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R29,\n  Author =\t {J{\\"o}rg Siekmann and Christoph Benzm{\\"u}ller and\n                  Erica Melis},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Mathematical Knowledge Management, Proof Planning,\n                  System Integration},\n  Note =\t {Project report in the Collaborative Research Centre\n                  SFB 378 on Resource-adaptive Cognitive Processes},\n  Pages =\t {1-22},\n  Title =\t {{OMEGA: Resource-adaptive Proof Planning}},\n  url_preprint = {http://christoph-benzmueller.de/papers/R29.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n DIALOG: Natural Language-based Interaction with a Mathematics Assistance System.\n \n \n\n\n \n Pinkal, M., Siekmann, J., Benzmüller, C., & Kruijff-Korbayova, I.\n\n\n \n\n\n\n 2004.\n Project proposal in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes\n\n\n\n
\n\n\n\n \n \n \"DIALOG: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R30,\n  Author =\t {Manfred Pinkal and J{\\"o}rg Siekmann and Christoph\n                  Benzm{\\"u}ller and Ivana Kruijff-Korbayova},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Proof Assistants, Tutoring Systems},\n  Note =\t {Project proposal in the Collaborative Research\n                  Centre SFB 378 on Resource-adaptive Cognitive\n                  Processes},\n  Pages =\t {1-31},\n  Title =\t {DIALOG: Natural Language-based Interaction with a\n                  Mathematics Assistance System},\n  url_preprint = {http://christoph-benzmueller.de/papers/R30.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n OMEGA: Agent-oriented Proof Planning.\n \n \n\n\n \n Siekmann, J., Benzmüller, C., & Autexier, S.\n\n\n \n\n\n\n 2004.\n Project proposal in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes\n\n\n\n
\n\n\n\n \n \n \"OMEGA: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R31,\n  Author =\t {J{\\"o}rg Siekmann and Christoph Benzm{\\"u}ller and\n                  Serge Autexier},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Mathematical Knowledge Management, Proof Planning,\n                  System Integration},\n  Note =\t {Project proposal in the Collaborative Research\n                  Centre SFB 378 on Resource-adaptive Cognitive\n                  Processes},\n  Pages =\t {1-26},\n  Title =\t {{OMEGA}: Agent-oriented Proof Planning},\n  url_preprint = {http://christoph-benzmueller.de/papers/R31.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n ALONZO: Higher-Order Reasoning Agents and Semantical Mediation of Mathematical Knowledge.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n 2004.\n DFG research grant proposal\n\n\n\n
\n\n\n\n \n \n \"ALONZO: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@unpublished{R32,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Note =\t {DFG research grant proposal},\n  Pages =\t {1-29},\n  Title =\t {ALONZO: Higher-Order Reasoning Agents and Semantical\n                  Mediation of Mathematical Knowledge},\n  url_preprint = {http://christoph-benzmueller.de/papers/R32.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n VERMATH: Distributed Mathematical Problem Solving.\n \n \n\n\n \n Autexier, S., Benzmüller, C., Kohlhase, M., & Siekmann, J.\n\n\n \n\n\n\n 2004.\n DFG research grant proposal\n\n\n\n
\n\n\n\n \n \n \"VERMATH: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@unpublished{R33,\n  Author =\t {Serge Autexier and Christoph Benzm{\\"u}ller and\n                  Michael Kohlhase and J\\"org Siekmann},\n  Note =\t {DFG research grant proposal},\n  Pages =\t {1-22},\n  Title =\t {VERMATH: Distributed Mathematical Problem Solving},\n  url_preprint = {http://christoph-benzmueller.de/papers/R33.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Abschlussbericht Projekt HOTEL.\n \n \n\n\n \n Benzmüller, C., Kohlhase, M., & Siekmann, J.\n\n\n \n\n\n\n 2004.\n DFG research grant report\n\n\n\n
\n\n\n\n \n \n \"Abschlussbericht preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@unpublished{R34,\n  Author =\t {Christoph Benzm{\\"u}ller and Michael Kohlhase and\n                  J{\\"o}rg Siekmann},\n  Note =\t {DFG research grant report},\n  Pages =\t {1-14},\n  Title =\t {Abschlussbericht Projekt HOTEL},\n  url_preprint = {http://christoph-benzmueller.de/papers/R34.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Dialogue Manager for the DIALOG Demonstrator.\n \n \n\n\n \n Buckley, M., & Benzmüller, C.\n\n\n \n\n\n\n Technical Report SR-04-01, Saarland University, SEKI Publications (ISSN 1437-4447), 2004.\n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@techreport{R35,\n  Author =\t {Mark Buckley and Christoph Benzm{\\"u}ller},\n  Institution =\t {Saarland University, SEKI Publications (ISSN\n                  1437-4447)},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Proof Assistants, Agents, System\n                  Integration},\n  Number =\t {SR-04-01},\n  Publisher =\t {SEKI Publications (ISSN 1437-4447)},\n  Title =\t {A Dialogue Manager for the DIALOG Demonstrator},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R35.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The CALCULEMUS Final Report.\n \n \n\n\n \n Benzmüller, C., & Hahn, C.\n\n\n \n\n\n\n Saarland University, Germany, 2004.\n Final report of the Marie Curie Research Training Network CALCULEMUS within the EU 5th framework\n\n\n\n
\n\n\n\n \n \n \"The preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@book{R36,\n  Author =\t {Christoph Benzm{\\"u}ller and Corinna Hahn},\n  Keywords =\t {own, CALCULEMUS, Symb. Computation and\n                  Symb. Reasoning},\n  Note =\t {Final report of the Marie Curie Research Training\n                  Network CALCULEMUS within the EU 5th framework},\n  Pages =\t {1-57},\n  Publisher =\t {Saarland University, Germany},\n  Title =\t {The CALCULEMUS Final Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R36.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Semantic Techniques for Cut-Elimination in Higher-Order Logics.\n \n \n\n\n \n Benzmüller, C., Brown, C., & Kohlhase, M.\n\n\n \n\n\n\n Technical Report SR-2004-07, Saarland University, Saarbrücken, Germany, 2004.\n \n\n\n\n
\n\n\n\n \n \n \"Semantic preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R37,\n  Author =\t {Christoph Benzm{\\"u}ller and Chad Brown and Michael\n                  Kohlhase},\n  Institution =\t {Saarland University, Saarbr{\\"u}cken, Germany},\n  Number =\t {SR-2004-07},\n  Publisher =\t {SEKI Publications (ISSN 1437-4447)},\n  Title =\t {Semantic Techniques for Cut-Elimination in\n                  Higher-Order Logics},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R37.pdf},\n  Year =\t 2004,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2003\n \n \n (20)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Proof Development in OMEGA: The Irrationality of Square Root of 2.\n \n \n\n\n \n Siekmann, J., Benzmüller, C., Fiedler, A., Meier, A., Normann, I., & Pollet, M.\n\n\n \n\n\n\n In Kamareddine, F., editor(s), Thirty Five Years of Automating Mathematics, of Applied Logic series (28), pages 271-314. Kluwer Academic Publishers, 2003.\n \n\n\n\n
\n\n\n\n \n \n \"Proof preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@incollection{B1,\n  Author =\t {J{\\"o}rg Siekmann and Christoph Benzm{\\"u}ller and\n                  Armin Fiedler and Andreas Meier and Immanuel Normann\n                  and Martin Pollet},\n  Booktitle =\t {Thirty Five Years of Automating Mathematics},\n  Doi =\t\t {10.1007/978-94-017-0253-9_11},\n  Editor =\t {Fairouz Kamareddine},\n  Isbn =\t {978-1-402-01656-1},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Automated Reasoning, Proof Planning, System\n                  Integration},\n  Pages =\t {271-314},\n  Publisher =\t {Kluwer Academic Publishers},\n  Series =\t {Applied Logic series (28)},\n  Title =\t {Proof Development in {OMEGA}: The Irrationality of\n                  Square Root of 2},\n  url_preprint = {http://christoph-benzmueller.de/papers/B1.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Assertion Application in Theorem Proving and Proof Planning.\n \n \n\n\n \n Vo, Q. B., Benzmüller, C., & Autexier, S.\n\n\n \n\n\n\n In Gottlob, G., & Walsh, T., editor(s), Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), Acapulco, Mexico, 2003. \n ISBN 0-127-05661-0\n\n\n\n
\n\n\n\n \n \n \"Assertion preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C13,\n  Address =\t {Acapulco, Mexico},\n  Author =\t {Quoc Bao Vo and Christoph Benzm{\\"u}ller and Serge\n                  Autexier},\n  Booktitle =\t {Proceedings of the International Joint Conference on\n                  Artificial Intelligence (IJCAI)},\n  Comment =\t {<a href="http://christoph-benzmueller.de/papers/P12.pdf">poster</a>},\n  Editor =\t {G. Gottlob and T. Walsh},\n  Keywords =\t {own, Proof Assistants, OMEGA, Proof Planning, Deep\n                  Inference},\n  Note =\t {ISBN 0-127-05661-0},\n  Title =\t {Assertion Application in Theorem Proving and Proof\n                  Planning},\n  url_preprint = {http://christoph-benzmueller.de/papers/C13.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Systems for Integrated Computation and Deduction – Interim Report of the CALCULEMUS IHP Network.\n \n \n\n\n \n Benzmüller, C.,\n editor.\n \n\n\n \n\n\n\n SEKI Publications (ISSN 1437-4447). 2003.\n 135 pages\n\n\n\n
\n\n\n\n \n \n \"SystemsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@proceedings{E5,\n  Editor =\t {Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, CALCULEMUS, Symb. Computation and\n                  Symb. Reasoning},\n  Note =\t {135 pages},\n  Publisher =\t {SEKI Publications (ISSN 1437-4447)},\n  Title =\t {Systems for Integrated Computation and Deduction --\n                  Interim Report of the {CALCULEMUS} {IHP} Network},\n  Url =\n                  {http://christoph-benzmueller.de/papers/MTR-report-long.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automatic Learning of Proof Methods in Proof Planning.\n \n \n\n\n \n Jamnik, M., Kerber, M., Pollet, M., & Benzmüller, C.\n\n\n \n\n\n\n The Logic Journal of the IGPL, 11(6): 647-674. 2003.\n \n\n\n\n
\n\n\n\n \n \n \"Automatic preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J7,\n  Author =\t {Mateja Jamnik and Manfred Kerber and Martin Pollet\n                  and Christoph Benzm{\\"u}ller},\n  Doi =\t\t {10.1093/jigpal/11.6.647},\n  Journal =\t {The Logic Journal of the IGPL},\n  Keywords =\t {own, Agents, Proof Assistants, Proof Planning,\n                  System Integration, Machine Learning, ERIH PLUS},\n  Number =\t 6,\n  Pages =\t {647-674},\n  Title =\t {Automatic Learning of Proof Methods in Proof\n                  Planning},\n  url_preprint = {http://christoph-benzmueller.de/papers/J7.pdf},\n  Volume =\t 11,\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Higher Order Semantics and Extensionality.\n \n \n\n\n \n Benzmüller, C., Brown, C., & Kohlhase, M.\n\n\n \n\n\n\n Technical Report CMU-01-03, Carnegie Mellon University, Pittsburgh, PA, 2003.\n \n\n\n\n
\n\n\n\n \n \n \"Higher preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@techreport{R18,\n  Abstract =\t {In this paper we re-examine the semantics of\n                  classical higher order logic with the purpose of\n                  clarifying the role of extensionality. To reach this\n                  goal, we distinguish nine classes of higher order\n                  models with respect to various combinations of\n                  Boolean extensionality and three forms of functional\n                  extensionality. Furthermore, we develop a\n                  methodology of abstract consistency methods (by\n                  providing the necessary model existence theorems)\n                  needed to analyze completeness of (machine-oriented)\n                  higher order calculi with respect to these model\n                  classes.},\n  Author =\t {Christoph Benzm{\\"u}ller and Chad Brown and Michael\n                  Kohlhase},\n  Institution =\t {Carnegie Mellon University, Pittsburgh, PA},\n  Keywords =\t {own, Higher Order Logic, Henkin Semantics, LEO\n                  Prover, Automated Reasoning},\n  Number =\t {CMU-01-03},\n  Pages =\t {1-74},\n  Title =\t {Higher Order Semantics and Extensionality.},\n  Type =\t {Technical Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R18.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n
\n In this paper we re-examine the semantics of classical higher order logic with the purpose of clarifying the role of extensionality. To reach this goal, we distinguish nine classes of higher order models with respect to various combinations of Boolean extensionality and three forms of functional extensionality. Furthermore, we develop a methodology of abstract consistency methods (by providing the necessary model existence theorems) needed to analyze completeness of (machine-oriented) higher order calculi with respect to these model classes.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Semantic Techniques for Cut-Elimination in Higher Order Logic.\n \n \n\n\n \n Benzmüller, C., Brown, C., & Kohlhase, M.\n\n\n \n\n\n\n Technical Report Saarland University, Saarbrücken, Germany and Carnegie Mellon University, Pittsburgh, USA, 2003.\n \n\n\n\n
\n\n\n\n \n \n \"Semantic preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@techreport{R19,\n  Abstract =\t {In this report we present a variety of model\n                  existence theorems for classical higher-order\n                  logics. The extend the well-known abstract\n                  consistency methods to higher-order logics and\n                  pinpoint the contribution of extensionality. The\n                  results reported here weaken the saturation\n                  precondition needed in earlier model existence\n                  theorems, making them appliccable to cut-free\n                  higher-order logics.},\n  Author =\t {Christoph Benzm{\\"u}ller and Chad Brown and Michael\n                  Kohlhase},\n  Institution =\t {Saarland University, Saarbr{\\"u}cken, Germany and\n                  Carnegie Mellon University, Pittsburgh, USA},\n  Keywords =\t {own, Higher Order Logic, Henkin Semantics, LEO\n                  Prover, Automated Reasoning, Cut-Elimination,R37},\n  Title =\t {Semantic Techniques for Cut-Elimination in Higher\n                  Order Logic.},\n  url_preprint = {http://christoph-benzmueller.de/papers/R19.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n
\n In this report we present a variety of model existence theorems for classical higher-order logics. The extend the well-known abstract consistency methods to higher-order logics and pinpoint the contribution of extensionality. The results reported here weaken the saturation precondition needed in earlier model existence theorems, making them appliccable to cut-free higher-order logics.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n An Approach to Assertion Application via Generalized Resolution.\n \n \n\n\n \n Vo, B. Q., Benzmüller, C., & Autexier, S.\n\n\n \n\n\n\n Technical Report SR-03-01, Saarland University, SEKI Publications (ISSN 1437-4447), 2003.\n \n\n\n\n
\n\n\n\n \n \n \"An preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R20,\n  Abstract =\t {In this paper we address assertion retrieval and\n                  application in theorem proving systems or proof\n                  planning systems for classical first-order\n                  logic. Due to Huang the notion of assertion\n                  comprises mathematical knowledge from a mathematical\n                  knowledge base KB such as definitions, theorems, and\n                  axioms.  the prover during proof construction. We\n                  propose a distributed mediator module between KB and\n                  a theorem proving system S which is independent of\n                  the particular proof representation format of S and\n                  which applies generalized resolution in order to\n                  analyze the logical consequences of arbitrary\n                  assertions for a proof context at hand. Our approach\n                  is applicable without any extension also to the\n                  assumptions that are dynamically created during a\n                  proof search process. It therefore realizes a\n                  crucial first step towards full automation of\n                  assertion level reasoning. We discuss the benefits\n                  and connection of our approach to proof planning and\n                  motivate an application in a project aiming at a\n                  tutorial dialogue system for mathematics.},\n  Author =\t {Bao Quoc Vo and Christoph Benzm{\\"u}ller and Serge\n                  Autexier},\n  Institution =\t {Saarland University, SEKI Publications (ISSN\n                  1437-4447)},\n  Number =\t {SR-03-01},\n  Publisher =\t {SEKI Publications (ISSN 1437-4447)},\n  Title =\t {An Approach to Assertion Application via Generalized\n                  Resolution},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R20.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n
\n In this paper we address assertion retrieval and application in theorem proving systems or proof planning systems for classical first-order logic. Due to Huang the notion of assertion comprises mathematical knowledge from a mathematical knowledge base KB such as definitions, theorems, and axioms. the prover during proof construction. We propose a distributed mediator module between KB and a theorem proving system S which is independent of the particular proof representation format of S and which applies generalized resolution in order to analyze the logical consequences of arbitrary assertions for a proof context at hand. Our approach is applicable without any extension also to the assumptions that are dynamically created during a proof search process. It therefore realizes a crucial first step towards full automation of assertion level reasoning. We discuss the benefits and connection of our approach to proof planning and motivate an application in a project aiming at a tutorial dialogue system for mathematics.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Towards a Framework to Integrate Proof Search Paradigms.\n \n \n\n\n \n Autexier, S., Benzmüller, C., & Hutter, D.\n\n\n \n\n\n\n Technical Report SR-03-02, Saarland University, SEKI Publications (ISSN 1437-4447), 2003.\n \n\n\n\n
\n\n\n\n \n \n \"Towards preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R21,\n  Abstract =\t {Research on automated and interactive theorem\n                  proving aims at the mechanization of logical\n                  reasoning. Aside from the development of logic\n                  calculi it became rapidly apparent that the\n                  organization of proof search on top of the calculi\n                  is an essential task in the design of powerful\n                  theorem proving systems. Different paradigms of how\n                  to organize proof search have emerged in that area\n                  of research, the most prominent representatives are\n                  generally described by the buzzwords: automated\n                  theorem proving, tactical theorem proving and proof\n                  planning. Despite their paradigmatic differences,\n                  all approaches share a common goal: to find a proof\n                  for a given conjecture. In this paper we start with\n                  a rational reconstruction of proof search paradigms\n                  in the area of proof planning and tactical theorem\n                  proving. Guided by similarities between software\n                  engineering and proof construction we develop a\n                  uniform view that accommodates the various proof\n                  search methodologies and eases their\n                  comparison. Based on this view, we propose a unified\n                  framework that enables the combination of different\n                  methodologies for proof construction to take\n                  advantage of their individual virtues within\n                  specific phases of a proof construction.},\n  Author =\t {Serge Autexier and Christoph Benzm{\\"u}ller and\n                  Dieter Hutter},\n  Institution =\t {Saarland University, SEKI Publications (ISSN\n                  1437-4447)},\n  Number =\t {SR-03-02},\n  Publisher =\t {SEKI Publications (ISSN 1437-4447)},\n  Title =\t {Towards a Framework to Integrate Proof Search\n                  Paradigms},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R21.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n
\n Research on automated and interactive theorem proving aims at the mechanization of logical reasoning. Aside from the development of logic calculi it became rapidly apparent that the organization of proof search on top of the calculi is an essential task in the design of powerful theorem proving systems. Different paradigms of how to organize proof search have emerged in that area of research, the most prominent representatives are generally described by the buzzwords: automated theorem proving, tactical theorem proving and proof planning. Despite their paradigmatic differences, all approaches share a common goal: to find a proof for a given conjecture. In this paper we start with a rational reconstruction of proof search paradigms in the area of proof planning and tactical theorem proving. Guided by similarities between software engineering and proof construction we develop a uniform view that accommodates the various proof search methodologies and eases their comparison. Based on this view, we propose a unified framework that enables the combination of different methodologies for proof construction to take advantage of their individual virtues within specific phases of a proof construction.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n The CALCULEMUS Midterm Report.\n \n \n\n\n \n Benzmüller, C., & Hahn, C.,\n editors.\n \n\n\n \n\n\n\n Saarland University, Germany, 2003.\n EU Report, Saarland University, Saarbrücken, Germany\n\n\n\n
\n\n\n\n \n \n \"The preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@book{R22,\n  Editor =\t {Christoph Benzm{\\"u}ller and Corinna Hahn},\n  Keywords =\t {own, CALCULEMUS, Symb. Computation and\n                  Symb. Reasoning},\n  Note =\t {EU Report, Saarland University, Saarbr{\\"u}cken,\n                  Germany},\n  Publisher =\t {Saarland University, Germany},\n  Title =\t {The CALCULEMUS Midterm Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R22.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n ALONZO: Deduktionsagenten höherer Ordnung für Mathematische Assistenzsysteme.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n 2003.\n Project proposal in the DFG Aktionsplan Informatik\n\n\n\n
\n\n\n\n \n \n \"ALONZO: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@unpublished{R23,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Note =\t {Project proposal in the DFG Aktionsplan Informatik},\n  Pages =\t {1-43},\n  Title =\t {ALONZO: Deduktionsagenten h{\\"o}herer Ordnung\n                  f{\\"u}r Mathematische Assistenzsysteme},\n  url_preprint = {http://christoph-benzmueller.de/papers/R23.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n CALCULEMUS-II: Computer-supported Mathematical Knowledge Evolution.\n \n \n\n\n \n Benzmüller, C., & Hutter, D.\n\n\n \n\n\n\n Saarland University, Germany, 2003.\n Project proposal for a Marie Curie Research Training Network within the EU 6th framework; 73 pages\n\n\n\n
\n\n\n\n \n \n \"CALCULEMUS-II: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@book{R24,\n  Author =\t {Christoph Benzm{\\"u}ller and Dieter Hutter},\n  Keywords =\t {own, CALCULEMUS, Symb. Computation and\n                  Symb. Reasoning},\n  Note =\t {Project proposal for a Marie Curie Research Training\n                  Network within the EU 6th framework; 73 pages},\n  Pages =\t {1-73},\n  Publisher =\t {Saarland University, Germany},\n  Title =\t {{CALCULEMUS-II}: Computer-supported Mathematical\n                  Knowledge Evolution},\n  url_preprint = {http://christoph-benzmueller.de/papers/R24.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Assertion Application in Theorem Proving and Proof Planning.\n \n \n\n\n \n Vo, B. Q., Benzmüller, C., & Autexier, S.\n\n\n \n\n\n\n In Proceedings of the 10th Workshop on Automated Reasoning: Bridging the Gap between Theory and Practice, Liverpool, England, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"Assertion preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W19,\n  Address =\t {Liverpool, England},\n  Author =\t {Bao Quoc Vo and Christoph Benzm{\\"u}ller and Serge\n                  Autexier},\n  Booktitle =\t {Proceedings of the 10th Workshop on Automated\n                  Reasoning: Bridging the Gap between Theory and\n                  Practice},\n  Title =\t {Assertion Application in Theorem Proving and Proof\n                  Planning},\n  url_preprint = {http://christoph-benzmueller.de/papers/W19.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Tutorial Dialogs on Mathematical Proofs.\n \n \n\n\n \n Benzmüller, C., Fiedler, A., Gabsdil, M., Horacek, H., Kruijff-Korbayova, I., Pinkal, M., Siekmann, J., Tsovaltzi, D., Vo, B. Q., & Wolska, M.\n\n\n \n\n\n\n In Proceedings of IJCAI-03 Workshop on Knowledge Representation and Automated Reasoning for E-Learning Systems, pages 12-22, Acapulco, Mexico, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"Tutorial preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W20,\n  Address =\t {Acapulco, Mexico},\n  Author =\t {Christoph Benzm{\\"u}ller and Armin Fiedler and Malte\n                  Gabsdil and Helmut Horacek and Ivana\n                  Kruijff-Korbayova and Manfred Pinkal and J{\\"o}rg\n                  Siekmann and Dimitra Tsovaltzi and Bao Quoc Vo and\n                  Magdalena Wolska},\n  Booktitle =\t {Proceedings of IJCAI-03 Workshop on Knowledge\n                  Representation and Automated Reasoning for\n                  E-Learning Systems},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2003-ijcai-ws-dialog-talk.pdf">slides</a>},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Proof Assistants, Tutoring Systems},\n  Pages =\t {12-22},\n  Title =\t {Tutorial Dialogs on Mathematical Proofs},\n  url_preprint = {http://christoph-benzmueller.de/papers/W20.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The CALCULEMUS research training network: A short overview.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Proceedings of the 11th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (CALCULEMUS 2003), pages 1-16, Rome, Italy, 2003. MMIII ARACNE EDITRICE S.R.L. (ISBN 88-7999-545-6)\n \n\n\n\n
\n\n\n\n \n \n \"The preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W21,\n  Address =\t {Rome, Italy},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Proceedings of the 11th Symposium on the Integration\n                  of Symbolic Computation and Mechanized Reasoning\n                  (CALCULEMUS 2003)},\n  Comment =\t {<a href="http://christoph-benzmueller.de/papers/2003-calculemus-rom.pdf">slides</a>},\n  Keywords =\t {own, CALCULEMUS, Symb. Computation and\n                  Symb. Reasoning},\n  Pages =\t {1-16},\n  Publisher =\t {MMIII ARACNE EDITRICE S.R.L. (ISBN 88-7999-545-6)},\n  Title =\t {The {CALCULEMUS} research training network: A short\n                  overview},\n  url_preprint = {http://christoph-benzmueller.de/papers/W21.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n The CALCULEMUS research training network: A short overview.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Proceedings of the First QPQ Workshop on Deductive Software Components at CADE-19, pages 13-27, Miami, USA, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"The preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W22,\n  Address =\t {Miami, USA},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Proceedings of the First QPQ Workshop on Deductive\n                  Software Components at CADE-19},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2003-qpq-talk.pdf">slides</a>},\n  Keywords =\t {own, CALCULEMUS, Symb. Computation and\n                  Symb. Reasoning},\n  Pages =\t {13-27},\n  Title =\t {The {CALCULEMUS} research training network: A short\n                  overview},\n  url_preprint = {http://christoph-benzmueller.de/papers/W22.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Wizard of Oz Experiment for Tutorial Dialogues in Mathematics.\n \n \n\n\n \n Benzmüller, C., Fiedler, A., Gabsdil, M., Horacek, H., Kruijff-Korbayova, I., Pinkal, M., Siekmann, J., Tsovaltzi, D., Vo, B. Q., & Wolska, M.\n\n\n \n\n\n\n In Proceedings of AI in Education (AIED 2003) Workshop on Advanced Technologies for Mathematics Education, Sydney, Australia, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W23,\n  Address =\t {Sydney, Australia},\n  Author =\t {Christoph Benzm{\\"u}ller and Armin Fiedler and Malte\n                  Gabsdil and Helmut Horacek and Ivana\n                  Kruijff-Korbayova and Manfred Pinkal and J\\"org\n                  Siekmann and Dimitra Tsovaltzi and Bao Quoc Vo and\n                  Magdalena Wolska},\n  Booktitle =\t {Proceedings of AI in Education (AIED 2003) Workshop\n                  on Advanced Technologies for Mathematics Education},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Proof Assistants, Tutoring Systems},\n  Title =\t {A Wizard of Oz Experiment for Tutorial Dialogues in\n                  Mathematics},\n  url_preprint = {http://christoph-benzmueller.de/papers/W23.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Interactive Proof Construction at the Task Level.\n \n \n\n\n \n Hübner, M., Benzmüller, C., Autexier, S., & Meier, A.\n\n\n \n\n\n\n In Proceedings of the Workshop User Interfaces for Theorem Provers (UITP 2003), pages 81-100, Rome, Italy, 2003. ARACNE EDITRICE S.R.L. (ISBN 88-7999-545-6)\n Also available as: Technical Report No. 189, Institut für Informatik, Albert-Ludwig-Universität, Freiburg\n\n\n\n
\n\n\n\n \n \n \"Interactive preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W24,\n  Address =\t {Rome, Italy},\n  Author =\t {Malte H\\"ubner and Christoph Benzm{\\"u}ller and\n                  Serge Autexier and Andreas Meier},\n  Booktitle =\t {Proceedings of the Workshop User Interfaces for\n                  Theorem Provers (UITP 2003)},\n  Note =\t {Also available as: Technical Report No. 189,\n                  Institut f\\"ur Informatik,\n                  Albert-Ludwig-Universit\\"at, Freiburg},\n  Pages =\t {81-100},\n  Publisher =\t {ARACNE EDITRICE S.R.L. (ISBN 88-7999-545-6)},\n  Title =\t {Interactive Proof Construction at the Task Level},\n  url_preprint = {http://christoph-benzmueller.de/papers/W24.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Language Phenomena in Tutorial Dialogs on Mathematical Proofs.\n \n \n\n\n \n Benzmüller, C., Fiedler, A., Gabsdil, M., Horacek, H., Kruijff-Korbayova, I., Tsovaltzi, D., Vo, B. Q., & Wolska, M.\n\n\n \n\n\n\n In Proceedings of the 7th Workshop on the semantics and pragmatics of dialogue (DiaBruck), Wallerfangen, Germany, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"Language preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W25,\n  Address =\t {Wallerfangen, Germany},\n  Author =\t {Christoph Benzm{\\"u}ller and Armin Fiedler and Malte\n                  Gabsdil and Helmut Horacek and Ivana\n                  Kruijff-Korbayova and Dimitra Tsovaltzi and Bao Quoc\n                  Vo and Magdalena Wolska},\n  Booktitle =\t {Proceedings of the 7th Workshop on the semantics and\n                  pragmatics of dialogue (DiaBruck)},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Tutoring Systems},\n  Title =\t {Language Phenomena in Tutorial Dialogs on\n                  Mathematical Proofs},\n  url_preprint = {http://christoph-benzmueller.de/papers/W25.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Towards a Principled Approach to Tutoring Mathematical Proofs.\n \n \n\n\n \n Benzmüller, C., Fiedler, A., Gabsdil, M., Horacek, H., Kruijff-Korbayova, I., Tsovaltzi, D., Vo, B. Q., & Wolska, M.\n\n\n \n\n\n\n In Proceedings of the Workshop on Expressive Media and Intelligent Tools for Learning, German Conference on AI (KI 2003), Hamburg, Germany, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"Towards preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W26,\n  Address =\t {Hamburg, Germany},\n  Author =\t {Christoph Benzm{\\"u}ller and Armin Fiedler and Malte\n                  Gabsdil and Helmut Horacek and Ivana\n                  Kruijff-Korbayova and Dimitra Tsovaltzi and Bao Quoc\n                  Vo and Magdalena Wolska},\n  Booktitle =\t {Proceedings of the Workshop on Expressive Media and\n                  Intelligent Tools for Learning, German Conference on\n                  AI (KI 2003)},\n  Title =\t {Towards a Principled Approach to Tutoring\n                  Mathematical Proofs},\n  url_preprint = {http://christoph-benzmueller.de/papers/W26.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n OMEGA — From Proof Planning towards Mathematical Knowledge Management.\n \n \n\n\n \n Autexier, S., & Benzmüller, C.\n\n\n \n\n\n\n In Mathematical Knowledge Management Symposium, Heriot-Watt University, Edinburgh, Scotland, 2003. \n \n\n\n\n
\n\n\n\n \n \n \"OMEGA preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W27,\n  Address =\t {Heriot-Watt University, Edinburgh, Scotland},\n  Author =\t {Serge Autexier and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Mathematical Knowledge Management Symposium},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2003-MKM03-EDI-omega.pdf">slides</a>},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Mathematical Knowledge Management, Proof Planning,\n                  System Integration},\n  Title =\t {{OMEGA} --- From Proof Planning towards Mathematical\n                  Knowledge Management},\n  url_preprint = {http://christoph-benzmueller.de/papers/W27.pdf},\n  Year =\t 2003,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2002\n \n \n (15)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Proof Development with OMEGA.\n \n \n\n\n \n Siekmann, J., Benzmüller, C., Brezhnev, V., Cheikhrouhou, L., Fiedler, A., Franke, A., Horacek, H., Kohlhase, M., Meier, A., Melis, E., Moschner, M., Normann, I., Pollet, M., Sorge, V., Ullrich, C., Wirth, C., & Zimmer, J.\n\n\n \n\n\n\n In Voronkov, A., editor(s), Proceedings of the 18th International Conference on Automated Deduction (CADE-18), of LNCS, pages 144-149, Copenhagen, Denmark, 2002. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Proof preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C11,\n  Address =\t {Copenhagen, Denmark},\n  Author =\t {J{\\"o}rg Siekmann and Christoph Benzm{\\"u}ller and\n                  Vladimir Brezhnev and Lassaad Cheikhrouhou and Armin\n                  Fiedler and Andreas Franke and Helmut Horacek and\n                  Michael Kohlhase and Andreas Meier and Erica Melis\n                  and Markus Moschner and Immanuel Normann and Martin\n                  Pollet and Volker Sorge and Carsten Ullrich and\n                  Claus-Peter Wirth and J{\\"u}rgen Zimmer},\n  Booktitle =\t {Proceedings of the 18th International Conference on\n                  Automated Deduction (CADE-18)},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2002-cade-omega.pdf">slides</a>},\n  Doi =\t\t {10.1007/3-540-45620-1_12},\n  Editor =\t {Andrei Voronkov},\n  Isbn =\t 3540439315,\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Automated Reasoning, Proof Planning, System\n                  Integration},\n  Number =\t 2392,\n  Pages =\t {144-149},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Proof Development with {OMEGA}},\n  url_preprint = {http://christoph-benzmueller.de/papers/C11.pdf},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Proof Development with OMEGA: Sqrt(2) is irrational.\n \n \n\n\n \n Siekmann, J., Benzmüller, C., Fiedler, A., Meier, A., & Pollet, M.\n\n\n \n\n\n\n In Baaz, M., & Voronkov, A., editor(s), Logic for Programming, Artificial Intelligence, and Reasoning, 9th International Conference, LPAR 2002, of LNCS, pages 367-387, 2002. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Proof preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C12,\n  Abstract =\t {Freek Wiedijk proposed the well-known theorem about\n                  the irrationality of sqrt{2} as a case study and\n                  used this theorem for a comparison of fifteen\n                  (interactive) theorem proving systems, which were\n                  asked to present their solution. This represents an\n                  important shift of emphasis in the field of\n                  automated deduction away from the somehow artificial\n                  problems of the past as represented, for example, in\n                  the test set of the TPTP library back to real\n                  mathematical challenges. In this paper we present an\n                  overview of the OMEGA system as far as it is\n                  relevant for the purpose of this paper and show the\n                  development of a proof for this theorem.},\n  Author =\t {J\\"org Siekmann and Christoph Benzm{\\"u}ller and\n                  Armin Fiedler and Andreas Meier and Martin Pollet},\n  Booktitle =\t {Logic for Programming, Artificial Intelligence, and\n                  Reasoning, 9th International Conference, LPAR 2002},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2002-lpar.pdf">slides</a>},\n  Editor =\t {Matthias Baaz and Andrei Voronkov},\n  Isbn =\t 3540000100,\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Automated Reasoning, Proof Planning, System\n                  Integration},\n  Number =\t 2514,\n  Pages =\t {367-387},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Proof Development with {OMEGA}: Sqrt(2) is\n                  irrational},\n  url_preprint = {http://christoph-benzmueller.de/papers/C12.pdf},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n
\n Freek Wiedijk proposed the well-known theorem about the irrationality of sqrt2 as a case study and used this theorem for a comparison of fifteen (interactive) theorem proving systems, which were asked to present their solution. This represents an important shift of emphasis in the field of automated deduction away from the somehow artificial problems of the past as represented, for example, in the test set of the TPTP library back to real mathematical challenges. In this paper we present an overview of the OMEGA system as far as it is relevant for the purpose of this paper and show the development of a proof for this theorem.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n CALCULEMUS Autumn School 2002: Student Poster Abstracts.\n \n \n\n\n \n Zimmer, J., & Benzmüller, C.,\n editors.\n \n\n\n \n\n\n\n SEKI Publications (ISSN 1437-4447). 2002.\n (115 pages)\n\n\n\n
\n\n\n\n \n \n \"CALCULEMUS preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@proceedings{E1,\n  Abstract =\t {This report contains the descriptions of student\n                  posters accepted for presentation at the Calculemus\n                  Autumn School 2002 in Pisa.},\n  Editor =\t {J{\\"u}rgen Zimmer and Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, CALCULEMUS, Symb. Computation and\n                  Symb. Reasoning},\n  Note =\t {(115 pages)},\n  Number =\t {SR-02-06},\n  Pages =\t {1-116},\n  Publisher =\t {SEKI Publications (ISSN 1437-4447)},\n  Title =\t {{CALCULEMUS Autumn School 2002: Student Poster\n                  Abstracts}},\n  url_preprint = {http://christoph-benzmueller.de/papers/E1.pdf},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n
\n This report contains the descriptions of student posters accepted for presentation at the Calculemus Autumn School 2002 in Pisa.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n CALCULEMUS Autumn School 2002: Course Notes (Part I).\n \n \n\n\n \n Benzmüller, C., & Endsuleit, R.,\n editors.\n \n\n\n \n\n\n\n SEKI Publications (ISSN 1437-4447). 2002.\n (168 pages)\n\n\n\n
\n\n\n\n \n \n \"CALCULEMUS preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@proceedings{E2,\n  Abstract =\t {This are the notes (Part I) of the courses presented\n                  at the Calculemus Autumn School 2002 in Pisa.},\n  Editor =\t {Christoph Benzm{\\"u}ller and Regine Endsuleit},\n  Keywords =\t {own, CALCULEMUS, Symb. Computation and\n                  Symb. Reasoning},\n  Note =\t {(168 pages)},\n  Number =\t {SR-02-07},\n  Pages =\t {1-168},\n  Publisher =\t {SEKI Publications (ISSN 1437-4447)},\n  Title =\t {{CALCULEMUS Autumn School 2002: Course Notes (Part\n                  I)}},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/E2.pdf},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n
\n This are the notes (Part I) of the courses presented at the Calculemus Autumn School 2002 in Pisa.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n CALCULEMUS Autumn School 2002: Course Notes (Part II).\n \n \n\n\n \n Benzmüller, C., & Endsuleit, R.,\n editors.\n \n\n\n \n\n\n\n SEKI Publications (ISSN 1437-4447). 2002.\n (130 pages)\n\n\n\n
\n\n\n\n \n \n \"CALCULEMUS preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@proceedings{E3,\n  Abstract =\t {This are the notes (Part II) of the courses\n                  presented at the Calculemus Autumn School 2002 in\n                  Pisa.},\n  Editor =\t {Christoph Benzm{\\"u}ller and Regine Endsuleit},\n  Keywords =\t {own, CALCULEMUS, Symb. Computation and\n                  Symb. Reasoning},\n  Note =\t {(130 pages)},\n  Number =\t {SR-02-08},\n  Pages =\t {1-130},\n  Publisher =\t {SEKI Publications (ISSN 1437-4447)},\n  Title =\t {{CALCULEMUS Autumn School 2002: Course Notes (Part\n                  II)}},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/E3.pdf},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n
\n This are the notes (Part II) of the courses presented at the Calculemus Autumn School 2002 in Pisa.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n CALCULEMUS Autumn School 2002: Course Notes (Part III).\n \n \n\n\n \n Benzmüller, C., & Endsuleit, R.,\n editors.\n \n\n\n \n\n\n\n SEKI Publications (ISSN 1437-4447). 2002.\n 121 pages\n\n\n\n
\n\n\n\n \n \n \"CALCULEMUS preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n\n\n\n
\n
@proceedings{E4,\n  Abstract =\t {This are the notes (Part III) of the courses\n                  presented at the Calculemus Autumn School 2002 in\n                  Pisa.},\n  Editor =\t {Christoph Benzm{\\"u}ller and Regine Endsuleit},\n  Keywords =\t {own, CALCULEMUS, Symb. Computation and\n                  Symb. Reasoning},\n  Note =\t {121 pages},\n  Number =\t {SR-02-09},\n  Publisher =\t {SEKI Publications (ISSN 1437-4447)},\n  Title =\t {{CALCULEMUS Autumn School 2002: Course Notes (Part\n                  III)}},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/E4.pdf},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n
\n This are the notes (Part III) of the courses presented at the Calculemus Autumn School 2002 in Pisa.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Comparing Approaches to Resolution based Higher-Order Theorem Proving.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Synthese, 133(1-2): 203-235. 2002.\n \n\n\n\n
\n\n\n\n \n \n \"Comparing preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J5,\n  Abstract =\t {We investigate several approaches to resolution\n                  based automated theorem proving in classical\n                  higher-order logic (based on Church's simply typed\n                  lambda calculus) and discuss their requirements with\n                  respect to Henkin completeness and full\n                  extensionality. In particular we focus on Andrews'\n                  higher-order resolution [Andrews71], Huet's\n                  constrained resolution [Huet72], higher-order\n                  $E$-resolution, and extensional higher-order\n                  resolution [BenzmuellerKohlhase98]. With the help of\n                  examples we illustrate the parallels and differences\n                  of the extensionality treatment of these approaches\n                  and demonstrate that extensional higher-order\n                  resolution is the sole approach that can completely\n                  avoid additional extensionality axioms.},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Doi =\t\t {10.1023/A:1020840027781},\n  Issn =\t {0039-7857},\n  Journal =\t {Synthese},\n  Keywords =\t {own, LEO Prover, Automated Reasoning, Higher Order\n                  Logic, Henkin Semantics, ERIH PLUS, History of\n                  Logic},\n  Number =\t {1-2},\n  Pages =\t {203-235},\n  Title =\t {Comparing Approaches to Resolution based\n                  Higher-Order Theorem Proving},\n  url_preprint = {http://christoph-benzmueller.de/papers/J5.pdf},\n  Volume =\t 133,\n  Year =\t 2002,\n}\n\n
\n
\n\n\n
\n We investigate several approaches to resolution based automated theorem proving in classical higher-order logic (based on Church's simply typed lambda calculus) and discuss their requirements with respect to Henkin completeness and full extensionality. In particular we focus on Andrews' higher-order resolution [Andrews71], Huet's constrained resolution [Huet72], higher-order $E$-resolution, and extensional higher-order resolution [BenzmuellerKohlhase98]. With the help of examples we illustrate the parallels and differences of the extensionality treatment of these approaches and demonstrate that extensional higher-order resolution is the sole approach that can completely avoid additional extensionality axioms.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Irrationality of square root of 2 – A case study in OMEGA.\n \n \n\n\n \n Benzmüller, C., Fiedler, A., Meier, A., & Pollet, M.\n\n\n \n\n\n\n Technical Report SR-02-03, Saarland University, SEKI Publications (ISSN 1437-4447), 2002.\n \n\n\n\n
\n\n\n\n \n \n \"Irrationality preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@techreport{R15,\n  Author =\t {Christoph Benzm{\\"u}ller and Armin Fiedler and\n                  Andreas Meier and Martin Pollet},\n  Institution =\t {Saarland University, SEKI Publications (ISSN\n                  1437-4447)},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Mathematical Knowledge Management, Proof Planning,\n                  System Integration},\n  Number =\t {SR-02-03},\n  Pages =\t {1-103},\n  Title =\t {Irrationality of square root of 2 -- A case study in\n                  {OMEGA}},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R15.pdf},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automatic Learning of Proof Methods in Proof Planning.\n \n \n\n\n \n Jamnik, M., Kerber, M., Pollet, M., & Benzmüller, C.\n\n\n \n\n\n\n Technical Report CSRP-02-05, University of Birmingham, School of Computer Science, 2002.\n \n\n\n\n
\n\n\n\n \n \n \"Automatic preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R16,\n  Author =\t {Mateja Jamnik and Manfred Kerber and Martin Pollet\n                  and Christoph Benzm{\\"u}ller},\n  File =\t {/2002/CSRP-02-05.ps.gz},\n  Institution =\t {University of Birmingham, School of Computer\n                  Science},\n  Number =\t {CSRP-02-05},\n  Pages =\t {1-34},\n  Title =\t {Automatic Learning of Proof Methods in Proof\n                  Planning},\n  url_preprint = {http://christoph-benzmueller.de/papers/R16.pdf},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A remark on higher order RUE-resolution with EXTRUE.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Technical Report SR-02-05, Saarland University, SEKI Publications (ISSN 1437-4447), 2002.\n arXiv:0901.3608\n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R17,\n  Abstract =\t {We show that a prominent counterexample for the\n                  completeness of first order RUE-resolution does not\n                  apply to the higher order RUE-resolution approach\n                  EXTRUE.},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Institution =\t {Saarland University, SEKI Publications (ISSN\n                  1437-4447)},\n  Note =\t {arXiv:0901.3608},\n  Number =\t {SR-02-05},\n  Pages =\t {1-5},\n  Title =\t {{A remark on higher order RUE-resolution with\n                  EXTRUE}},\n  Type =\t {SEKI Report},\n  Url =\t\t {http://arxiv.org/abs/0901.3608},\n  doi =\t\t {10.48550/ARXIV.0901.3608},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n
\n We show that a prominent counterexample for the completeness of first order RUE-resolution does not apply to the higher order RUE-resolution approach EXTRUE.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Agent-based Theorem Proving.\n \n \n\n\n \n Benzmüller, C., & Sorge, V.\n\n\n \n\n\n\n In Proceedings of the 9th Workshop on Automated Reasoning: Bridging the Gap between Theory and Practice, pages 1-3, London, England, 2002. \n \n\n\n\n
\n\n\n\n \n \n \"Agent-based preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W15,\n  Address =\t {London, England},\n  Author =\t {Christoph Benzm{\\"u}ller and Volker Sorge},\n  Booktitle =\t {Proceedings of the 9th Workshop on Automated\n                  Reasoning: Bridging the Gap between Theory and\n                  Practice},\n  Pages =\t {1-3},\n  Title =\t {Agent-based Theorem Proving},\n  url_preprint = {http://christoph-benzmueller.de/papers/W15.pdf},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Agent-based Proof Search with Indexed Formulas.\n \n \n\n\n \n Hübner, M., Autexier, S., & Benzmüller, C.\n\n\n \n\n\n\n In Additonal Proceedings of 10th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (CALCULEMUS 2002), pages 11-20, Marseilles, France, 2002. \n \n\n\n\n
\n\n\n\n \n \n \"Agent-based preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W16,\n  Abstract =\t {This paper describes work aimed at integrating\n                  OMEGA's agent-based suggestion mechanism OANTS and\n                  the new theorem proving framework developed by\n                  Autexier [Autexier01].},\n  Address =\t {Marseilles, France},\n  Author =\t {Malte H{\\"u}bner and Serge Autexier and Christoph\n                  Benzm{\\"u}ller},\n  Booktitle =\t {Additonal Proceedings of 10th Symposium on the\n                  Integration of Symbolic Computation and Mechanized\n                  Reasoning (CALCULEMUS 2002)},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2002-calculemus-talk.pdf">slides</a>},\n  Pages =\t {11-20},\n  Title =\t {Agent-based Proof Search with Indexed Formulas},\n  url_preprint = {http://christoph-benzmueller.de/papers/W16.pdf},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n
\n This paper describes work aimed at integrating OMEGA's agent-based suggestion mechanism OANTS and the new theorem proving framework developed by Autexier [Autexier01].\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Symbolic Verification of Hybrid Systems supported by Mathematical Services.\n \n \n\n\n \n Benzmüller, C., Giromini, C., & Nonnengart, A.\n\n\n \n\n\n\n In Additonal Proceedings of 10th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (CALCULEMUS 2002), pages 1-10, Marseilles, France, 2002. \n \n\n\n\n
\n\n\n\n \n \n \"Symbolic preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W17,\n  Abstract =\t {Verification of hybrid systems is a challenging\n                  task. Unlike many other verification methods the\n                  approach proposed in [nonnengart99] avoids\n                  approximations and operates directly on the original\n                  system specifications. This approach, however,\n                  requires the solution of non-trivial mathematical\n                  subtasks. We propose to model those kinds of\n                  subtasks that are suitable for being tackled with\n                  reasoning specialists as mathematical service\n                  requests to a network of service systems like the\n                  MathWeb Software Bus. So far we have identified the\n                  following candidates of mathematical service\n                  requests: the solution of differential equations,\n                  subsumption and consistency of sets of\n                  constraints. A further candidate can be the\n                  elimination of second order set variables with\n                  higher order theorem provers.},\n  Address =\t {Marseilles, France},\n  Author =\t {Christoph Benzm{\\"u}ller and Corrado Giromini and\n                  Andreas Nonnengart},\n  Booktitle =\t {Additonal Proceedings of 10th Symposium on the\n                  Integration of Symbolic Computation and Mechanized\n                  Reasoning (CALCULEMUS 2002)},\n  Pages =\t {1-10},\n  Title =\t {Symbolic Verification of Hybrid Systems supported by\n                  Mathematical Services},\n  url_preprint = {http://christoph-benzmueller.de/papers/W17.pdf},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n
\n Verification of hybrid systems is a challenging task. Unlike many other verification methods the approach proposed in [nonnengart99] avoids approximations and operates directly on the original system specifications. This approach, however, requires the solution of non-trivial mathematical subtasks. We propose to model those kinds of subtasks that are suitable for being tackled with reasoning specialists as mathematical service requests to a network of service systems like the MathWeb Software Bus. So far we have identified the following candidates of mathematical service requests: the solution of differential equations, subsumption and consistency of sets of constraints. A further candidate can be the elimination of second order set variables with higher order theorem provers.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Reasoning Services in the MathWeb-SB for Symbolic Verification of Hybrid Systems.\n \n \n\n\n \n Benzmüller, C., Giromini, C., Nonnengart, A., & Zimmer, J.\n\n\n \n\n\n\n In Proceedings of the Verification Workshop - VERIFY'02 in connection with FLOC 2002, pages 29-39, Kopenhagen, Denmark, 2002. \n \n\n\n\n
\n\n\n\n \n \n \"Reasoning preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W18,\n  Abstract =\t {Verification of non-linear hybrid systems is a\n                  challenging task. Unlike many other verification\n                  methods the deduction-based verification approach we\n                  investigate in this paper avoids approximations and\n                  operates directly on the original non-linear system\n                  specifications. This approach, however, requires the\n                  solution of non-trivial mathematical subtasks. We\n                  propose to model existing reasoning systems, such as\n                  computer algebra systems and constraint solvers, as\n                  mathematical services and to provide them in a\n                  network of mathematical tools in a way that they can\n                  reasonably support subtasks as they may occur in\n                  formal methods applications. The motivation is to\n                  make it simpler to implement and test verification\n                  approaches by out-sourcing complex but precisely\n                  identifiable mathematical subtasks for which\n                  specialised reasoners do already exists.},\n  Address =\t {Kopenhagen, Denmark},\n  Author =\t {Christoph Benzm{\\"u}ller and Corrado Giromini and\n                  Andreas Nonnengart and J{\\"u}rgen Zimmer},\n  Booktitle =\t {Proceedings of the Verification Workshop - VERIFY'02\n                  in connection with FLOC 2002},\n  Pages =\t {29-39},\n  Title =\t {Reasoning Services in the MathWeb-SB for Symbolic\n                  Verification of Hybrid Systems},\n  url_preprint = {http://christoph-benzmueller.de/papers/W18.pdf},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n
\n Verification of non-linear hybrid systems is a challenging task. Unlike many other verification methods the deduction-based verification approach we investigate in this paper avoids approximations and operates directly on the original non-linear system specifications. This approach, however, requires the solution of non-trivial mathematical subtasks. We propose to model existing reasoning systems, such as computer algebra systems and constraint solvers, as mathematical services and to provide them in a network of mathematical tools in a way that they can reasonably support subtasks as they may occur in formal methods applications. The motivation is to make it simpler to implement and test verification approaches by out-sourcing complex but precisely identifiable mathematical subtasks for which specialised reasoners do already exists.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Automatic Learning of Proof Methods in Proof Planning.\n \n \n\n\n \n Jamnik, M., Kerber, M., Pollet, M., & Benzmüller, C.\n\n\n \n\n\n\n In Proceedings of the 9th Workshop on Automated Reasoning: Bridging the Gap between Theory and Practice, pages 1-2, London, England, 2002. \n \n\n\n\n
\n\n\n\n \n \n \"Automatic preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W28,\n  Address =\t {London, England},\n  Author =\t {Mateja Jamnik and Manfred Kerber and Martin Pollet\n                  and Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Proceedings of the 9th Workshop on Automated\n                  Reasoning: Bridging the Gap between Theory and\n                  Practice},\n  Pages =\t {1-2},\n  Title =\t {Automatic Learning of Proof Methods in Proof\n                  Planning},\n  url_preprint = {http://christoph-benzmueller.de/papers/W28.pdf},\n  Year =\t 2002,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2001\n \n \n (13)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Experiments with an Agent-oriented Reasoning system.\n \n \n\n\n \n Benzmüller, C., Jamnik, M., Kerber, M., & Sorge, V.\n\n\n \n\n\n\n In Baader, F., Brewka, G., & Eiter, T., editor(s), KI 2001: Advances in Artificial Intelligence, Joint German/Austrian Conference on AI, Vienna, Austria, September 19-21, 2001, Proceedings, of LNCS, pages 409-424, 2001. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Experiments preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C10,\n  Abstract =\t {This paper discusses an agent based approach to\n                  automated and interactive reasoning. It combines\n                  ideas from two subfields of AI (theorem\n                  proving/proof planning and multi-agent systems) and\n                  makes use of state of the art distribution\n                  techniques to decentralise and spread its reasoning\n                  agents over the internet. The approach particularly\n                  supports cooperative proofs between reasoning agents\n                  which are strong in different applications areas,\n                  e.g., higher-order and first-order theorem provers\n                  and computer algebra systems.},\n  Author =\t {Christoph Benzm{\\"u}ller and Mateja Jamnik and\n                  Manfred Kerber and Volker Sorge},\n  Booktitle =\t {KI 2001: Advances in Artificial Intelligence, Joint\n                  German/Austrian Conference on AI, Vienna, Austria,\n                  September 19-21, 2001, Proceedings},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2001-ki-talk.pdf">slides</a>},\n  Doi =\t\t {10.1007/3-540-45422-5_29},\n  Editor =\t {Franz Baader and Gerhard Brewka and Thomas Eiter},\n  Keywords =\t {own, Proof Assistants, OMEGA, LEO Prover, Automated\n                  Reasoning, System Integration, Agents},\n  Number =\t 2174,\n  Pages =\t {409-424},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Experiments with an Agent-oriented Reasoning system},\n  url_preprint = {http://christoph-benzmueller.de/papers/C10.pdf},\n  Year =\t 2001,\n}\n\n
\n
\n\n\n
\n This paper discusses an agent based approach to automated and interactive reasoning. It combines ideas from two subfields of AI (theorem proving/proof planning and multi-agent systems) and makes use of state of the art distribution techniques to decentralise and spread its reasoning agents over the internet. The approach particularly supports cooperative proofs between reasoning agents which are strong in different applications areas, e.g., higher-order and first-order theorem provers and computer algebra systems.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n OANTS – Combining Interactive and Automated Theorem Proving.\n \n \n\n\n \n Benzmüller, C., & Sorge, V.\n\n\n \n\n\n\n In Kerber, M., & Kohlhase, M., editor(s), Symbolic Computation and Automated Reasoning, pages 81-97, 2001. A.K.Peters\n \n\n\n\n
\n\n\n\n \n \n \"OANTS preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C8,\n  Abstract =\t {We present the O-ANTS theorem prover that is built\n                  on top of an agent-based command suggestion\n                  mechanism. The theorem prover inherits beneficial\n                  properties from the underlying suggestion mechanism\n                  such as run-time extendibility and resource\n                  adaptability. Moreover, it supports the distributed\n                  integration of external reasoning systems. We also\n                  discuss how the implementation and modeling of a\n                  calculus in our agent-based approach can be\n                  investigated wrt. the inheritance of properties such\n                  as completeness and soundness.},\n  Author =\t {Christoph Benzm{\\"u}ller and Volker Sorge},\n  Booktitle =\t {Symbolic Computation and Automated Reasoning},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2000-calculemus-oants.pdf">slides</a>},\n  Editor =\t {Manfred Kerber and Michael Kohlhase},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Automated Reasoning, System Integration, Agents, LEO\n                  Prover},\n  Pages =\t {81-97},\n  Publisher =\t {A.K.Peters},\n  Title =\t {{OANTS} -- Combining Interactive and Automated\n                  Theorem Proving},\n  url_preprint = {http://christoph-benzmueller.de/papers/C8.pdf},\n  Year =\t 2001,\n}\n\n
\n
\n\n\n
\n We present the O-ANTS theorem prover that is built on top of an agent-based command suggestion mechanism. The theorem prover inherits beneficial properties from the underlying suggestion mechanism such as run-time extendibility and resource adaptability. Moreover, it supports the distributed integration of external reasoning systems. We also discuss how the implementation and modeling of a calculus in our agent-based approach can be investigated wrt. the inheritance of properties such as completeness and soundness.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Learning Method Outlines in Proof Planning.\n \n \n\n\n \n Jamnik, M., Kerber, M., & Benzmüller, C.\n\n\n \n\n\n\n Technical Report CSRP-01-08, University of Birmingham, School of Computer Science, 2001.\n \n\n\n\n
\n\n\n\n \n \n \"Learning preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R14,\n  Author =\t {Mateja Jamnik and Manfred Kerber and Christoph\n                  Benzm{\\"u}ller},\n  Institution =\t {University of Birmingham, School of Computer\n                  Science},\n  Number =\t {CSRP-01-08},\n  Pages =\t {1-15},\n  Title =\t {Learning Method Outlines in Proof Planning},\n  url_preprint = {http://christoph-benzmueller.de/papers/R14.pdf},\n  Year =\t 2001,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n DIALOG: Tutorieller Dialog mit einem Mathematik Assistenzsystem.\n \n \n\n\n \n Pinkal, M., Siekmann, J., & Benzmüller, C.\n\n\n \n\n\n\n 2001.\n Project proposal in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes\n\n\n\n
\n\n\n\n \n \n \"DIALOG: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R25,\n  Author =\t {Manfred Pinkal and J{\\"o}rg Siekmann and Christoph\n                  Benzm{\\"u}ller},\n  Keywords =\t {own, DIALOG, Proof Presentation, Natural Language\n                  Dialog, Proof Assistants, Tutoring Systems},\n  Note =\t {Project proposal in the Collaborative Research\n                  Centre SFB 378 on Resource-adaptive Cognitive\n                  Processes},\n  Pages =\t {1-34},\n  Title =\t {DIALOG: Tutorieller Dialog mit einem Mathematik\n                  Assistenzsystem},\n  url_preprint = {http://christoph-benzmueller.de/papers/R25.pdf},\n  Year =\t 2001,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n OMEGA: Ressourcenadaptive Beweisplanung.\n \n \n\n\n \n Siekmann, J., Benzmüller, C., & Melis, E.\n\n\n \n\n\n\n 2001.\n Project proposal in the Collaborative Research Centre SFB 378 on Resource-adaptive Cognitive Processes\n\n\n\n
\n\n\n\n \n \n \"OMEGA: preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@unpublished{R26,\n  Author =\t {J{\\"o}rg Siekmann and Christoph Benzm{\\"u}ller and\n                  Erica Melis},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Mathematical Knowledge Management, Proof Planning,\n                  System Integration},\n  Note =\t {Project proposal in the Collaborative Research\n                  Centre SFB 378 on Resource-adaptive Cognitive\n                  Processes},\n  Pages =\t {1-30},\n  Title =\t {{OMEGA: Ressourcenadaptive Beweisplanung}},\n  url_preprint = {http://christoph-benzmueller.de/papers/R25.pdf},\n  Year =\t 2001,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n An Agent Based Approach to Reasoning.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Extended abstract for invited plenary talk at AISB'01 Convention `Agents and Cognition, pages 57-58, 2001. University of York\n \n\n\n\n
\n\n\n\n \n \n \"An preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W10,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Extended abstract for invited plenary talk at\n                  AISB'01 Convention `Agents and Cognition},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2001-aisb-agents.pdf">slides</a>},\n  Keywords =\t {own, Agents, Proof Assistants, Automated Reasoning},\n  Pages =\t {57-58},\n  Publisher =\t {University of York},\n  Title =\t {An Agent Based Approach to Reasoning},\n  url_preprint = {http://christoph-benzmueller.de/papers/W10.pdf},\n  Year =\t 2001,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n An Agent-oriented Approach to Reasoning.\n \n \n\n\n \n Benzmüller, C., Jamnik, M., Kerber, M., & Sorge, V.\n\n\n \n\n\n\n In Proceedings of the Calculemus Workshop 2001, pages 48-63, Siena, Italy, 2001. \n \n\n\n\n
\n\n\n\n \n \n \"An preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W11,\n  Abstract =\t {This paper discusses experiments with an agent\n                  oriented approach to automated and interactive\n                  reasoning. The approach combines ideas from two\n                  subfields of AI (theorem proving/proof planning and\n                  multi-agent systems) and makes use of state of the\n                  art distribution techniques to decentralise and\n                  spread its reasoning agents over the internet. It\n                  particularly supports cooperative proofs between\n                  reasoning systems which are strong in different\n                  application areas, e.g., higher-order and\n                  first-order theorem provers and computer algebra\n                  systems.},\n  Address =\t {Siena, Italy},\n  Author =\t {Christoph Benzm{\\"u}ller and Mateja Jamnik and\n                  Manfred Kerber and Volker Sorge},\n  Booktitle =\t {Proceedings of the Calculemus Workshop 2001},\n  Pages =\t {48-63},\n  Title =\t {An Agent-oriented Approach to Reasoning},\n  url_preprint = {http://christoph-benzmueller.de/papers/W11.pdf},\n  Year =\t 2001,\n}\n\n
\n
\n\n\n
\n This paper discusses experiments with an agent oriented approach to automated and interactive reasoning. The approach combines ideas from two subfields of AI (theorem proving/proof planning and multi-agent systems) and makes use of state of the art distribution techniques to decentralise and spread its reasoning agents over the internet. It particularly supports cooperative proofs between reasoning systems which are strong in different application areas, e.g., higher-order and first-order theorem provers and computer algebra systems.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Proof Planning: A Fresh Start?.\n \n \n\n\n \n Benzmüller, C., Meier, A., Melis, E., Pollet, M., & Sorge, V.\n\n\n \n\n\n\n In Proceedings of the IJCAR 2001 Workshop: Future Directions in Automated Reasoning, pages 25-37, Siena, Italy, 2001. \n \n\n\n\n
\n\n\n\n \n \n \"Proof preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W12,\n  Address =\t {Siena, Italy},\n  Author =\t {Christoph Benzm{\\"u}ller and Andreas Meier and Erica\n                  Melis and Martin Pollet and Volker Sorge},\n  Booktitle =\t {Proceedings of the IJCAR 2001 Workshop: Future\n                  Directions in Automated Reasoning},\n  Pages =\t {25-37},\n  Title =\t {Proof Planning: A Fresh Start?},\n  url_preprint = {http://christoph-benzmueller.de/papers/W12.pdf},\n  Year =\t 2001,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Lost Proof.\n \n \n\n\n \n Benzmüller, C., & Kerber, M.\n\n\n \n\n\n\n In Proceedings of the IJCAR 2001 Workshop: Future Directions in Automated Reasoning, pages 13-24, Siena, Italy, 2001. \n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W13,\n  Abstract =\t {We re-investigate a proof example presented by\n                  George Boolos which perspicuously illustrates\n                  G\\"odel's argument for the potentially drastic\n                  increase of proof-lengths in formal systems when\n                  carrying through the argument at too low a\n                  level. More concretely, restricting the order of the\n                  logic in which the proof is carried through to the\n                  order of the logic in which the problem is\n                  formulated in the first place can result in\n                  unmanageable long proofs, although there are short\n                  proofs in a logic of higher order. Our motivation in\n                  this paper is of practical nature and its aim is to\n                  sketch the implications of this example to current\n                  technology in automated theorem proving, to point to\n                  related questions about the foundational character\n                  of type theory (without explicit comprehension\n                  axioms) for mathematics, and to work out some\n                  challenging aspects with regard to the automation of\n                  this proof -- which, as we belief, nicely\n                  illustrates the discrepancy between the creativity\n                  and intuition required in mathematics and the\n                  limitations of state of the art theorem provers.},\n  Address =\t {Siena, Italy},\n  Author =\t {Christoph Benzm{\\"u}ller and Manfred Kerber},\n  Booktitle =\t {Proceedings of the IJCAR 2001 Workshop: Future\n                  Directions in Automated Reasoning},\n  Pages =\t {13-24},\n  Title =\t {A Lost Proof},\n  url_preprint = {http://christoph-benzmueller.de/papers/W13.pdf},\n  Year =\t 2001,\n}\n\n
\n
\n\n\n
\n We re-investigate a proof example presented by George Boolos which perspicuously illustrates Gödel's argument for the potentially drastic increase of proof-lengths in formal systems when carrying through the argument at too low a level. More concretely, restricting the order of the logic in which the proof is carried through to the order of the logic in which the problem is formulated in the first place can result in unmanageable long proofs, although there are short proofs in a logic of higher order. Our motivation in this paper is of practical nature and its aim is to sketch the implications of this example to current technology in automated theorem proving, to point to related questions about the foundational character of type theory (without explicit comprehension axioms) for mathematics, and to work out some challenging aspects with regard to the automation of this proof – which, as we belief, nicely illustrates the discrepancy between the creativity and intuition required in mathematics and the limitations of state of the art theorem provers.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Distributed Assertion Retrieval.\n \n \n\n\n \n Benzmüller, C., Meier, A., & Sorge, V.\n\n\n \n\n\n\n In First International Workshop on Mathematical Knowledge Management, pages 1-7, RISC Linz, Schloss Hagenberg, 2001. \n \n\n\n\n
\n\n\n\n \n \n \"Distributed preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W14,\n  Address =\t {RISC Linz, Schloss Hagenberg},\n  Author =\t {Christoph Benzm{\\"u}ller and Andreas Meier and\n                  Volker Sorge},\n  Booktitle =\t {First International Workshop on Mathematical\n                  Knowledge Management},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/2001-mkm-talk.pdf">slides</a>},\n  Pages =\t {1-7},\n  Title =\t {Distributed Assertion Retrieval},\n  url_preprint = {http://christoph-benzmueller.de/papers/W14.pdf},\n  Year =\t 2001,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Towards Learning New Methods in Proof Planning.\n \n \n\n\n \n Jamnik, M., Kerber, M., & Benzmüller, C.\n\n\n \n\n\n\n In Proceedings of the CADE-17 Workshop: Automated Deduction in the Context of Mathematics, pages 1-12, 2001. \n \n\n\n\n
\n\n\n\n \n \n \"Towards preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W6,\n  Author =\t {Mateja Jamnik and Manfred Kerber and Christoph\n                  Benzm{\\"u}ller},\n  Booktitle =\t {Proceedings of the CADE-17 Workshop: Automated\n                  Deduction in the Context of Mathematics},\n  Pages =\t {1-12},\n  Title =\t {Towards Learning New Methods in Proof Planning},\n  url_preprint = {http://christoph-benzmueller.de/papers/W6.pdf},\n  Year =\t 2001,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Learning proof methods in proof planning.\n \n \n\n\n \n Jamnik, M., Kerber, M., & Benzmüller, C.\n\n\n \n\n\n\n In Proceedings of the Eighth Workshop on Automated Reasoning, Bridging the Gap between Theory and Practice, pages 5-6, 2001. University of York\n (Mildly reviewed)\n\n\n\n
\n\n\n\n \n \n \"Learning preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W8,\n  Abstract =\t {In this paper we propose how proof planning systems\n                  can be extended by an automated learning\n                  capability. The idea is that a proof planner would\n                  be capable of learning new proof methods from well\n                  chosen examples of proofs which use a similar\n                  reasoning strategy to prove related theorems, and\n                  this strategy could be characterised as a proof\n                  method. We propose a representation framework for\n                  methods, and a machine learning technique which can\n                  learn methods using this representation\n                  framework. This is work in progress, and we hope to\n                  gain useful feedback from the workshop community.},\n  Author =\t {Mateja Jamnik and Manfred Kerber and Christoph\n                  Benzm{\\"u}ller},\n  Booktitle =\t {Proceedings of the Eighth Workshop on Automated\n                  Reasoning, Bridging the Gap between Theory and\n                  Practice},\n  Note =\t {(Mildly reviewed)},\n  Pages =\t {5-6},\n  Publisher =\t {University of York},\n  Title =\t {Learning proof methods in proof planning},\n  url_preprint = {http://christoph-benzmueller.de/papers/W8.pdf},\n  Year =\t 2001,\n}\n\n
\n
\n\n\n
\n In this paper we propose how proof planning systems can be extended by an automated learning capability. The idea is that a proof planner would be capable of learning new proof methods from well chosen examples of proofs which use a similar reasoning strategy to prove related theorems, and this strategy could be characterised as a proof method. We propose a representation framework for methods, and a machine learning technique which can learn methods using this representation framework. This is work in progress, and we hope to gain useful feedback from the workshop community.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Proof transformation and expansion with a parameterisable inference machine.\n \n \n\n\n \n Benzmüller, C., Meier, A., Pollet, M., & Sorge, V.\n\n\n \n\n\n\n In Proceedings of the Eighth Workshop on Automated Reasoning, Bridging the Gap between Theory and Practice, pages 1-2, 2001. University of York\n (Mildly reviewed)\n\n\n\n
\n\n\n\n \n \n \"Proof preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W9,\n  Author =\t {Christoph Benzm{\\"u}ller and Andreas Meier and\n                  Martin Pollet and Volker Sorge},\n  Booktitle =\t {Proceedings of the Eighth Workshop on Automated\n                  Reasoning, Bridging the Gap between Theory and\n                  Practice},\n  Note =\t {(Mildly reviewed)},\n  Pages =\t {1-2},\n  Publisher =\t {University of York},\n  Title =\t {Proof transformation and expansion with a\n                  parameterisable inference machine.},\n  url_preprint = {http://christoph-benzmueller.de/papers/W9.pdf},\n  Year =\t 2001,\n}\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2000\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Resource Guided Concurrent Deduction.\n \n \n\n\n \n Benzmüller, C., Jamnik, M., Kerber, M., & Sorge, V.\n\n\n \n\n\n\n In Kerber, M., & Kohlhase, M., editor(s), Symbolic Computation and Automated Reasoning, pages 245-246, 2000. A.K.Peters\n \n\n\n\n
\n\n\n\n \n \n \"Resource preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C7,\n  Author =\t {Christoph Benzm{\\"u}ller and Mateja Jamnik and\n                  Manfred Kerber and Volker Sorge},\n  Booktitle =\t {Symbolic Computation and Automated Reasoning},\n  Editor =\t {Manfred Kerber and Michael Kohlhase},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Automated Reasoning, System Integration, Agents, LEO\n                  Prover},\n  Pages =\t {245-246},\n  Publisher =\t {A.K.Peters},\n  Title =\t {Resource Guided Concurrent Deduction},\n  url_preprint = {http://christoph-benzmueller.de/papers/C7.pdf},\n  Year =\t 2000,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Towards Learning New Methods in Proof Planning.\n \n \n\n\n \n Jamnik, M., Kerber, M., & Benzmüller, C.\n\n\n \n\n\n\n In Kerber, M., & Kohlhase, M., editor(s), Symbolic Computation and Automated Reasoning, pages 142-159, 2000. A.K.Peters\n \n\n\n\n
\n\n\n\n \n \n \"Towards preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C9,\n  Abstract =\t {In this paper we propose how proof planning systems\n                  can be extended by an automated learning\n                  capability. The idea is that a proof planner would\n                  be capable of learning new proof methods from well\n                  chosen examples of proofs which use a similar\n                  reasoning strategy to prove related theorems, and\n                  this strategy could be characterised as a proof\n                  method. We propose a representation framework for\n                  methods, and a machine learning technique which can\n                  learn methods using this representation\n                  framework. The technique can be applied (amongst\n                  other) to learn whether and when to call external\n                  systems such as theorem provers or computer algebra\n                  systems. This is work in progress, and we hope to\n                  gain useful feedback from the CALCULEMUS community.},\n  Author =\t {Mateja Jamnik and Manfred Kerber and Christoph\n                  Benzm{\\"u}ller},\n  Booktitle =\t {Symbolic Computation and Automated Reasoning},\n  Editor =\t {Manfred Kerber and Michael Kohlhase},\n  Keywords =\t {own, CALCULEMUS, Symb. Computation and\n                  Symb. Reasoning, Proof Planning, Machine Learning},\n  Pages =\t {142-159},\n  Publisher =\t {A.K.Peters},\n  Title =\t {Towards Learning New Methods in Proof Planning},\n  url_preprint = {http://christoph-benzmueller.de/papers/C9.pdf},\n  Year =\t 2000,\n}\n\n
\n
\n\n\n
\n In this paper we propose how proof planning systems can be extended by an automated learning capability. The idea is that a proof planner would be capable of learning new proof methods from well chosen examples of proofs which use a similar reasoning strategy to prove related theorems, and this strategy could be characterised as a proof method. We propose a representation framework for methods, and a machine learning technique which can learn methods using this representation framework. The technique can be applied (amongst other) to learn whether and when to call external systems such as theorem provers or computer algebra systems. This is work in progress, and we hope to gain useful feedback from the CALCULEMUS community.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Towards Learning new Methods in Proof Planning.\n \n \n\n\n \n Jamnik, M., Kerber, M., & Benzmüller, C.\n\n\n \n\n\n\n Technical Report CSRP-00-09, University of Birmingham, School of Computer Science, 2000.\n \n\n\n\n
\n\n\n\n \n \n \"Towards preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R13,\n  Author =\t {Mateja Jamnik and Manfred Kerber and Christoph\n                  Benzm{\\"u}ller},\n  Institution =\t {University of Birmingham, School of Computer\n                  Science},\n  Number =\t {CSRP-00-09},\n  Pages =\t {1-16},\n  Title =\t {Towards Learning new Methods in Proof Planning},\n  url_preprint = {http://christoph-benzmueller.de/papers/R13.pdf},\n  Year =\t 2000,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Adaptive Course Generation and Presentation.\n \n \n\n\n \n Siekmann, J., Benzmüller, C., Fiedler, A., Franke, A., Goguadze, G., Horacek, H., Kohlhase, M., Libbrecht, P., Meier, A., Melis, E., Pollet, M., Sorge, V., Ullrich, C., & Zimmer, J.\n\n\n \n\n\n\n In Brusilovski, P., editor(s), Proceedings of the Fifth International Conference on Intelligent Tutoring Systems—Workshop W2: Adaptive and Intelligent Web-Based Education Systems, pages 54-61, Montreal, 2000. \n \n\n\n\n
\n\n\n\n \n \n \"Adaptive preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W5,\n  Abstract =\t {Today's interactive mathematics textbooks use a\n                  collection of predefined documents, typically\n                  organized as a network of html pages. This makes a\n                  reuse and a sound re-combination of the encoded\n                  knowledge impossible and inhibits a radical adaption\n                  of course presentation and content to the user's\n                  needs. In order to avoid these drawbacks we have\n                  designed a web-based framework for dynamically\n                  producing interactive documents for learning\n                  mathematics called ID. The system design relies on\n                  the separation of knowledge representation from\n                  system functionalities. Salient features of our\n                  system are the individual generation of interactive\n                  documents based on general domain knowledge,\n                  user-specific preferences and the user's knowledge\n                  as well as the integration of external problem\n                  solving systems. The paper describes the distributed\n                  web-based architecture of our system and the\n                  principles of its components.},\n  Address =\t {Montreal},\n  Author =\t {J{\\"o}rg Siekmann and Christoph Benzm{\\"u}ller and\n                  Armin Fiedler and Andreas Franke and George Goguadze\n                  and Helmut Horacek and Michael Kohlhase and Paul\n                  Libbrecht and Andreas Meier and Erica Melis and\n                  Martin Pollet and Volker Sorge and Carsten Ullrich\n                  and J{\\"u}rgen Zimmer},\n  Booktitle =\t {Proceedings of the Fifth International Conference on\n                  Intelligent Tutoring Systems---Workshop W2: Adaptive\n                  and Intelligent Web-Based Education Systems},\n  Editor =\t {P. Brusilovski},\n  Pages =\t {54-61},\n  Title =\t {Adaptive Course Generation and Presentation},\n  url_preprint = {http://christoph-benzmueller.de/papers/W5.pdf},\n  Year =\t 2000,\n}\n\n
\n
\n\n\n
\n Today's interactive mathematics textbooks use a collection of predefined documents, typically organized as a network of html pages. This makes a reuse and a sound re-combination of the encoded knowledge impossible and inhibits a radical adaption of course presentation and content to the user's needs. In order to avoid these drawbacks we have designed a web-based framework for dynamically producing interactive documents for learning mathematics called ID. The system design relies on the separation of knowledge representation from system functionalities. Salient features of our system are the individual generation of interactive documents based on general domain knowledge, user-specific preferences and the user's knowledge as well as the integration of external problem solving systems. The paper describes the distributed web-based architecture of our system and the principles of its components.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Resource Guided Concurrent Deduction.\n \n \n\n\n \n Benzmüller, C., Jamnik, M., Kerber, M., & Sorge, V.\n\n\n \n\n\n\n In Proceedings of the AISB'2000 Symposium `How to design a functioning mind', pages 137-138, Birmingham, England, 2000. \n (Mildly reviewed)\n\n\n\n
\n\n\n\n \n \n \"Resource preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W7,\n  Address =\t {Birmingham, England},\n  Author =\t {Christoph Benzm{\\"u}ller and Mateja Jamnik and\n                  Manfred Kerber and Volker Sorge},\n  Booktitle =\t {Proceedings of the AISB'2000 Symposium `How to\n                  design a functioning mind'},\n  Note =\t {(Mildly reviewed)},\n  Pages =\t {137-138},\n  Title =\t {Resource Guided Concurrent Deduction},\n  url_preprint = {http://christoph-benzmueller.de/papers/W7.pdf},\n  Year =\t 2000,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1999\n \n \n (14)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Extensional Higher-Order Paramodulation and RUE-Resolution.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n In Ganzinger, H., editor(s), Automated Deduction - CADE-16, 16th International Conference on Automated Deduction, Trento, Italy, July 7-10, 1999, Proceedings, of LNCS, pages 399-413, 1999. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Extensional preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{C5,\n  Abstract =\t {This paper presents two approaches to primitive\n                  equality treatment in higher-order (HO) automated\n                  theorem proving: a calculus $\\EXTPARA$ adapting\n                  traditional first-order (FO)\n                  paramodulation~\\cite{RoWo69} , and a calculus\n                  $\\EXTRUE$ adapting FO\n                  RUE-Resolution~\\cite{Digricoli79} to HO logic (based\n                  on Church's simply typed\n                  $\\lambda$-calculus). $\\EXTPARA$ and $\\EXTRUE$ extend\n                  the extensional HO resolution approach\n                  $\\EXTRES$~\\cite{BenKoh:ehor98}. In order to reach\n                  Henkin completeness without the need for additional\n                  extensionality axioms both calculi employ new,\n                  positive extensionality rules analogously to the\n                  respective negative ones provided by $\\EXTRES$ that\n                  operate on unification constraints. As the\n                  extensionality rules have an intrinsic and\n                  unavoidable difference-reducing character the HO\n                  paramodulation approach looses its pure\n                  term-rewriting character. On the other hand examples\n                  demonstrate that the extensionality rules harmonise\n                  rather well with the difference-reducing HO\n                  RUE-resolution idea.},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Booktitle =\t {Automated Deduction - CADE-16, 16th International\n                  Conference on Automated Deduction, Trento, Italy,\n                  July 7-10, 1999, Proceedings},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/1999-CADE-para-and-rue.pdf">slides</a>},\n  Doi =\t\t {10.1007/3-540-48660-7_39},\n  Editor =\t {Harald Ganzinger},\n  Number =\t 1632,\n  Pages =\t {399-413},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Extensional Higher-Order Paramodulation and\n                  {RUE}-Resolution},\n  url_preprint = {http://christoph-benzmueller.de/papers/C5.pdf},\n  Year =\t 1999,\n}\n\n
\n
\n\n\n
\n This paper presents two approaches to primitive equality treatment in higher-order (HO) automated theorem proving: a calculus $\\EXTPARA$ adapting traditional first-order (FO) paramodulation i̧teRoWo69 , and a calculus $\\EXTRUE$ adapting FO RUE-Resolution i̧teDigricoli79 to HO logic (based on Church's simply typed $λ$-calculus). $\\EXTPARA$ and $\\EXTRUE$ extend the extensional HO resolution approach $\\EXTRES$ i̧teBenKoh:ehor98. In order to reach Henkin completeness without the need for additional extensionality axioms both calculi employ new, positive extensionality rules analogously to the respective negative ones provided by $\\EXTRES$ that operate on unification constraints. As the extensionality rules have an intrinsic and unavoidable difference-reducing character the HO paramodulation approach looses its pure term-rewriting character. On the other hand examples demonstrate that the extensionality rules harmonise rather well with the difference-reducing HO RUE-resolution idea.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Critical Agents Supporting Interactive Theorem Proving.\n \n \n\n\n \n Benzmüller, C., & Sorge, V.\n\n\n \n\n\n\n In Borahona, P., & J. Alferes, J., editor(s), Progress in Artificial Intelligence, 9th Portuguese Conference on Artificial Intelligence, EPIA '99, Évora, Portugal, September 21-24, 1999, Proceedings, of LNCS, pages 208-221, 1999. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Critical preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C6,\n  Abstract =\t {We introduce a resource adaptive agent mechanism\n                  which supports the user in interactive theorem\n                  proving. The mechanism, an extension\n                  of~\\cite{BeSo98b}, uses a two layered architecture\n                  of agent societies to suggest appropriate commands\n                  together with possible command argument\n                  instantiations. Experiments with this approach show\n                  that its effectiveness can be further improved by\n                  introducing a resource concept. In this paper we\n                  provide an abstract view on the overall mechanism,\n                  motivate the necessity of an appropriate resource\n                  concept and discuss its realization within the agent\n                  architecture.},\n  Author =\t {Christoph Benzm{\\"u}ller and Volker Sorge},\n  Booktitle =\t {Progress in Artificial Intelligence, 9th Portuguese\n                  Conference on Artificial Intelligence, EPIA '99,\n                  {\\'E}vora, Portugal, September 21-24, 1999,\n                  Proceedings},\n  Comment =\t {<a href="http://christoph-benzmueller.de//papers/1999-epia-agents.pdf">slides</a>},\n  Doi =\t\t {10.1007/3-540-48159-1_15},\n  Editor =\t {Pedro Borahona and Jose J.~Alferes},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  System Integration, Agents, LEO Prover},\n  Number =\t 1695,\n  Pages =\t {208-221},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {Critical Agents Supporting Interactive Theorem\n                  Proving},\n  url_preprint = {http://christoph-benzmueller.de/papers/C6.pdf},\n  Year =\t 1999,\n}\n\n
\n
\n\n\n
\n We introduce a resource adaptive agent mechanism which supports the user in interactive theorem proving. The mechanism, an extension of i̧teBeSo98b, uses a two layered architecture of agent societies to suggest appropriate commands together with possible command argument instantiations. Experiments with this approach show that its effectiveness can be further improved by introducing a resource concept. In this paper we provide an abstract view on the overall mechanism, motivate the necessity of an appropriate resource concept and discuss its realization within the agent architecture.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Integrating TPS and OMEGA.\n \n \n\n\n \n Benzmüller, C., Bishop, M., & Sorge, V.\n\n\n \n\n\n\n Journal of Universal Computer Science, 5(3): 188-207. 1999.\n \n\n\n\n
\n\n\n\n \n \n \"Integrating preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J1,\n  Abstract =\t {This paper reports on the integration of the\n                  higher-order theorem proving environment TPS\n                  [Andrews96] into the mathematical assistant OMEGA\n                  [Omega97]. TPS can be called from OMEGA either as a\n                  black box or as an interactive system. In black box\n                  mode, the user has control over the parameters which\n                  control proof search in TPS; in interactive mode,\n                  all features of the TPS-system are available to the\n                  user. If the subproblem which is passed to TPS\n                  contains concepts defined in OMEGA's database of\n                  mathematical theories, these definitions are not\n                  instantiated but are also passed to TPS. Using a\n                  special theory which contains proof tactics that\n                  model the ND-calculus variant of TPS within OMEGA,\n                  any complete or partial proof generated in TPS can\n                  be translated one to one into an OMEGA proof\n                  plan. Proof transformation is realised by proof plan\n                  expansion in OMEGA's 3-dimensional proof data\n                  structure, and remains transparent to the user.},\n  Author =\t {Christoph Benzm{\\"u}ller and Matt Bishop and Volker\n                  Sorge},\n  Doi =\t\t {10.3217/jucs-005-03-0188},\n  Journal =\t {Journal of Universal Computer Science},\n  Keywords =\t {own, Proof Assistants, OMEGA, Proof Transformation,\n                  System Integration, Higher Order Logic},\n  Number =\t 3,\n  Pages =\t {188-207},\n  Title =\t {Integrating {TPS} and {OMEGA}},\n  url_preprint = {http://christoph-benzmueller.de/papers/J1.pdf},\n  Volume =\t 5,\n  Year =\t 1999,\n}\n\n
\n
\n\n\n
\n This paper reports on the integration of the higher-order theorem proving environment TPS [Andrews96] into the mathematical assistant OMEGA [Omega97]. TPS can be called from OMEGA either as a black box or as an interactive system. In black box mode, the user has control over the parameters which control proof search in TPS; in interactive mode, all features of the TPS-system are available to the user. If the subproblem which is passed to TPS contains concepts defined in OMEGA's database of mathematical theories, these definitions are not instantiated but are also passed to TPS. Using a special theory which contains proof tactics that model the ND-calculus variant of TPS within OMEGA, any complete or partial proof generated in TPS can be translated one to one into an OMEGA proof plan. Proof transformation is realised by proof plan expansion in OMEGA's 3-dimensional proof data structure, and remains transparent to the user.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n LOUI: Lovely OMEGA User Interface.\n \n \n\n\n \n Siekmann, J., Hess, S., Benzmüller, C., Cheikhrouhou, L., Fiedler, A., Horacek, H., Kohlhase, M., Konrad, K., Meier, A., Melis, E., Pollet, M., & Sorge, V.\n\n\n \n\n\n\n Formal Aspects of Computing, 11(3): 326-342. 1999.\n \n\n\n\n
\n\n\n\n \n \n \"LOUI: preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J2,\n  Author =\t {J{\\"o}rg Siekmann and Stephan Hess and Christoph\n                  Benzm{\\"u}ller and Lassaad Cheikhrouhou and Armin\n                  Fiedler and Helmut Horacek and Michael Kohlhase and\n                  Karsten Konrad and Andreas Meier and Erica Melis and\n                  Martin Pollet and Volker Sorge},\n  Doi =\t\t {10.1007/s001650050053},\n  Journal =\t {Formal Aspects of Computing},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Proof Presentation, User Interface},\n  Number =\t 3,\n  Pages =\t {326-342},\n  Title =\t {{LOUI}: Lovely {OMEGA} User Interface},\n  url_preprint = {http://christoph-benzmueller.de/papers/J2.pdf},\n  Volume =\t 11,\n  Year =\t 1999,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n An Interactive Proof Development Environment $+$ Anticipation = A Mathematical Assistant?.\n \n \n\n\n \n Siekmann, J., Horacek, H., Kohlhase, M., Benzmüller, C., Cheikhrouhou, L., Fehrer, D., Fiedler, A., Hess, S., Konrad, K., Meier, A., Melis, E., & Sorge, V.\n\n\n \n\n\n\n International Journal of Computing Anticipatory Systems (CASYS), 3: 101-110. 1999.\n \n\n\n\n
\n\n\n\n \n \n \"An preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J3,\n  Author =\t {J{\\"o}rg Siekmann and Helmut Horacek and Michael\n                  Kohlhase and Christoph Benzm{\\"u}ller and Lassaad\n                  Cheikhrouhou and Detlef Fehrer and Armin Fiedler and\n                  Stephan Hess and Karsten Konrad and Andreas Meier\n                  and Erica Melis and Volker Sorge},\n  Issn =\t {1373-5411},\n  Journal =\t {International Journal of Computing Anticipatory\n                  Systems (CASYS)},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Proof Presentation, User Interface},\n  Pages =\t {101-110},\n  Title =\t {An Interactive Proof Development Environment $+$ Anticipation = A Mathematical Assistant?},\n  url_preprint = {http://christoph-benzmueller.de/papers/J3.pdf},\n  Volume =\t 3,\n  Year =\t 1999,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Agent based Mathematical Reasoning.\n \n \n\n\n \n Benzmüller, C., Jamnik, M., Kerber, M., & Sorge, V.\n\n\n \n\n\n\n Electronic Notes in Theoretical Computer Science, Elsevier, 23(3): 21-33. 1999.\n \n\n\n\n
\n\n\n\n \n \n \"Agent preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@article{J4,\n  Abstract =\t {In this contribution we propose an agent\n                  architecture for theorem proving which we intend to\n                  investigate in depth in the future. The work\n                  reported in this paper is in an early state, and by\n                  no means finished. We present and discuss our\n                  proposal in order to get feedback from the\n                  Calculemus community.},\n  Author =\t {Christoph Benzm{\\"u}ller and Mateja Jamnik and\n                  Manfred Kerber and Volker Sorge},\n  Doi =\t\t {10.1016/S1571-0661(05)82522-8},\n  Journal =\t {Electronic Notes in Theoretical Computer Science,\n                  Elsevier},\n  Keywords =\t {own, Agents, Proof Assistants, OMEGA, Automated\n                  Reasoning, System Integration},\n  Number =\t 3,\n  Pages =\t {21-33},\n  Title =\t {Agent based Mathematical Reasoning},\n  url_preprint = {http://christoph-benzmueller.de/papers/J4.pdf},\n  Volume =\t 23,\n  Year =\t 1999,\n}\n\n
\n
\n\n\n
\n In this contribution we propose an agent architecture for theorem proving which we intend to investigate in depth in the future. The work reported in this paper is in an early state, and by no means finished. We present and discuss our proposal in order to get feedback from the Calculemus community.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Towards Concurrent Resource Guided Deduction.\n \n \n\n\n \n Benzmüller, C., Jamnik, M., Kerber, M., & Sorge, V.\n\n\n \n\n\n\n Technical Report SR-99-07, Saarland University, SEKI Publications (ISSN 1437-4447), 1999.\n \n\n\n\n
\n\n\n\n \n \n \"Towards preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R10,\n  Author =\t {Christoph Benzm{\\"u}ller and Mateja Jamnik and\n                  Manfred Kerber and Volker Sorge},\n  Institution =\t {Saarland University, SEKI Publications (ISSN\n                  1437-4447)},\n  Number =\t {SR-99-07},\n  Pages =\t {1-27},\n  Title =\t {Towards Concurrent Resource Guided Deduction},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R10.pdf},\n  Year =\t 1999,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Equality and Extensionality in Higher-Order Theorem Proving.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Technical Report SR-99-08, Saarland University, SEKI Publications (ISSN 1437-4447), 1999.\n \n\n\n\n
\n\n\n\n \n \n \"Equality preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@techreport{R11,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Institution =\t {Saarland University, SEKI Publications (ISSN\n                  1437-4447)},\n  Keywords =\t {own, Higher Order Logic, Henkin Semantics, LEO\n                  Prover, Automated Reasoning},\n  Number =\t {SR-99-08},\n  Pages =\t {1-139},\n  Title =\t {Equality and Extensionality in Higher-Order Theorem\n                  Proving},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R11.pdf},\n  Year =\t 1999,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n OANTS for Interactive ATP.\n \n \n\n\n \n Benzmüller, C., Sorge, V., & Byrnes, J.\n\n\n \n\n\n\n 1999.\n Draft, AG Siekmann, Saarland University\n\n\n\n
\n\n\n\n \n \n \"OANTS preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@unpublished{R12,\n  Author =\t {Christoph Benzm{\\"u}ller and Volker Sorge and John\n                  Byrnes},\n  Note =\t {Draft, AG Siekmann, Saarland University},\n  Pages =\t {1-5},\n  Title =\t {{OANTS} for Interactive {ATP}},\n  url_preprint = {http://christoph-benzmueller.de/papers/R12.pdf},\n  Year =\t 1999,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Forschungsinteressen am Graduiertenkolleg Kognitionswissenschaft.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n 1999.\n Draft, AG Siekmann, Saarland University\n\n\n\n
\n\n\n\n \n \n \"Forschungsinteressen preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@unpublished{R8,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Note =\t {Draft, AG Siekmann, Saarland University},\n  Pages =\t {1-17},\n  Title =\t {{F}orschungsinteressen am {G}raduiertenkolleg\n                  {K}ognitionswissenschaft},\n  url_preprint = {http://christoph-benzmueller.de/papers/R8.pdf},\n  Year =\t 1999,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Resource Adaptive Agents in Interactive Theorem Proving.\n \n \n\n\n \n Benzmüller, C., & Sorge, V.\n\n\n \n\n\n\n Technical Report SR-99-02, Saarland University, SEKI Publications (ISSN 1437-4447), 1999.\n \n\n\n\n
\n\n\n\n \n \n \"ResourcePaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R9,\n  Author =\t {Christoph Benzm{\\"u}ller and Volker Sorge},\n  Institution =\t {Saarland University, SEKI Publications (ISSN\n                  1437-4447)},\n  Number =\t {SR-99-02},\n  Pages =\t {1-13},\n  Publisher =\t {{SEKI Publications (ISSN 1437-4447)}},\n  Title =\t {Resource Adaptive Agents in Interactive Theorem\n                  Proving},\n  Type =\t {SEKI Report},\n  Url =\t\t {http://arxiv.org/abs/0901.3585},\n  doi =\t\t {10.48550/ARXIV.0901.3585},\n  Year =\t 1999,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Equality and Extensionality in Higher-Order Theorem Proving.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Ph.D. Thesis, Naturwissenschaftlich-Technische Fakultät I, Saarland University, Saarbrücken, Germany, 1999.\n \n\n\n\n
\n\n\n\n \n \n \"Equality preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@phdthesis{T2,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Keywords =\t {own, thesis, Higher Order Logic, Henkin Semantics,\n                  LEO Prover, Automated Reasoning},\n  Pages =\t {1-174},\n  School =\t {Naturwissenschaftlich-Technische Fakult{\\"a}t I,\n                  Saarland University, Saarbr{\\"u}cken, Germany},\n  Title =\t {Equality and Extensionality in Higher-Order Theorem\n                  Proving},\n  url_preprint = {http://christoph-benzmueller.de/papers/T2.pdf},\n  Year =\t 1999,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Towards Fine-Grained Proof Planning with Critical Agents.\n \n \n\n\n \n Benzmüller, C., & Sorge, V.\n\n\n \n\n\n\n In Proceedings of the 6th Workshop on Automated Reasoning, pages 19-20, 1999. Edinburgh College of Art & Divison of Informatics, University of Edinburgh\n (Mildly reviewed)\n\n\n\n
\n\n\n\n \n \n \"Towards preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W3,\n  Author =\t {Christoph Benzm{\\"u}ller and Volker Sorge},\n  Booktitle =\t {Proceedings of the 6th Workshop on Automated\n                  Reasoning},\n  Note =\t {(Mildly reviewed)},\n  Pages =\t {19-20},\n  Publisher =\t {Edinburgh College of Art \\& Divison of Informatics,\n                  University of Edinburgh},\n  Title =\t {Towards Fine-Grained Proof Planning with Critical\n                  Agents},\n  url_preprint = {http://christoph-benzmueller.de/papers/W3.pdf},\n  Year =\t 1999,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Agent Based Mathematical Reasoning.\n \n \n\n\n \n Benzmüller, C., Jamnik, M., Kerber, M., & Sorge, V.\n\n\n \n\n\n\n In Proceedings of the Calculemus Workshop: Systems for Integrated Computation and Deduction, pages 1-12, Trento, Italy, 1999. \n \n\n\n\n
\n\n\n\n \n \n \"Agent preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W4,\n  Abstract =\t {In this contribution we propose an agent\n                  architecture for theorem proving which we intend to\n                  investigate in depth in the future. The work\n                  reported in this paper is in an early state, and by\n                  no means finished. We present and discuss our\n                  proposal in order to get feedback from the\n                  Calculemus community.},\n  Address =\t {Trento, Italy},\n  Author =\t {Christoph Benzm{\\"u}ller and Mateja Jamnik and\n                  Manfred Kerber and Volker Sorge},\n  Booktitle =\t {Proceedings of the Calculemus Workshop: Systems for\n                  Integrated Computation and Deduction},\n  Comment =\t {<a href="http://christoph-benzmueller.de/papers/1999-calculemus.ps.gz">slides</a>},\n  Pages =\t {1-12},\n  Title =\t {Agent Based Mathematical Reasoning},\n  url_preprint = {http://christoph-benzmueller.de/papers/W4.pdf},\n  Year =\t 1999,\n}\n\n
\n
\n\n\n
\n In this contribution we propose an agent architecture for theorem proving which we intend to investigate in depth in the future. The work reported in this paper is in an early state, and by no means finished. We present and discuss our proposal in order to get feedback from the Calculemus community.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1998\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Extensional Higher-Order Resolution.\n \n \n\n\n \n Benzmüller, C., & Kohlhase, M.\n\n\n \n\n\n\n In Kirchner, C., & Kirchner, H., editor(s), Automated Deduction - CADE-15, 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, Proceedings, of LNAI, pages 56-71, 1998. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Extensional preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C2,\n  Abstract =\t {In this paper we present an extensional higher-order\n                  resolution calculus that is complete relative to\n                  Henkin model semantics. The treatment of the\n                  extensionality principles -- necessary for the\n                  completeness result -- by specialized\n                  (goal-directed) inference rules is of practical\n                  applicability, as an implentation of the calculus in\n                  the LEO-System shows. Furthermore, we prove the\n                  long-standing conjecture, that it is sufficient to\n                  restrict the order of primitive substitutions to the\n                  order of input formulae.},\n  Author =\t {Christoph Benzm{\\"u}ller and Michael Kohlhase},\n  Booktitle =\t {Automated Deduction - CADE-15, 15th International\n                  Conference on Automated Deduction, Lindau, Germany,\n                  July 5-10, 1998, Proceedings},\n  Doi =\t\t {10.1007/BFb0054248},\n  Editor =\t {Claude Kirchner and H{\\'e}l{\\`e}ne Kirchner},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Automated\n                  Reasoning, Henkin Semantics},\n  Number =\t 1421,\n  Pages =\t {56-71},\n  Publisher =\t {Springer},\n  Series =\t {LNAI},\n  Title =\t {Extensional Higher-Order Resolution},\n  url_preprint = {http://christoph-benzmueller.de/papers/C2.pdf},\n  Year =\t 1998,\n}\n\n
\n
\n\n\n
\n In this paper we present an extensional higher-order resolution calculus that is complete relative to Henkin model semantics. The treatment of the extensionality principles – necessary for the completeness result – by specialized (goal-directed) inference rules is of practical applicability, as an implentation of the calculus in the LEO-System shows. Furthermore, we prove the long-standing conjecture, that it is sufficient to restrict the order of primitive substitutions to the order of input formulae.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n LEO – A Higher-Order Theorem Prover.\n \n \n\n\n \n Benzmüller, C., & Kohlhase, M.\n\n\n \n\n\n\n In Kirchner, C., & Kirchner, H., editor(s), Automated Deduction - CADE-15, 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, Proceedings, of LNCS, pages 139-143, 1998. Springer\n \n\n\n\n
\n\n\n\n \n \n \"LEO preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C3,\n  Abstract =\t {In this paper we discuss the Higher-Order Theorem\n                  Prover LEO, which is based on the Extensional\n                  Higher-Order Resolution Calculus EXTRES.},\n  Author =\t {Christoph Benzm{\\"u}ller and Michael Kohlhase},\n  Booktitle =\t {Automated Deduction - CADE-15, 15th International\n                  Conference on Automated Deduction, Lindau, Germany,\n                  July 5-10, 1998, Proceedings},\n  Comment =\t {<a href="~/chris/trunk/www/papers/1998-leo-talk.pdf">slides</a>},\n  Doi =\t\t {10.1007/BFb0054256},\n  Editor =\t {Claude Kirchner and H{\\'e}l{\\`e}ne Kirchner},\n  Keywords =\t {own, LEO Prover, Higher Order Logic, Automated\n                  Reasoning, Henkin Semantics},\n  Number =\t 1421,\n  Pages =\t {139-143},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {{LEO} -- A Higher-Order Theorem Prover},\n  url_preprint = {http://christoph-benzmueller.de/papers/C3.pdf},\n  Year =\t 1998,\n}\n\n
\n
\n\n\n
\n In this paper we discuss the Higher-Order Theorem Prover LEO, which is based on the Extensional Higher-Order Resolution Calculus EXTRES.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Blackboard Architecture for Guiding Interactive Proofs.\n \n \n\n\n \n Benzmüller, C., & Sorge, V.\n\n\n \n\n\n\n In Giunchiglia, F., editor(s), Artificial Intelligence: Methodology, Systems, and Applications, 8th International Conference, AIMSA '98, Sozopol, Bulgaria, September 21-13, 1998, Proceedings, of LNCS, pages 102-114, 1998. Springer\n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C4,\n  Abstract =\t {The acceptance and usability of current interactive\n                  theorem proving environments is, among other things,\n                  strongly influenced by the availability of an\n                  intelligent default suggestion mechanism for\n                  commands. Such mechanisms support the user by\n                  decreasing the necessary interactions during the\n                  proof construction. Although many systems offer such\n                  facilities, they are often limited in their\n                  functionality. In this paper we present a new\n                  agent-based mechanism that independently observes\n                  the proof state, steadily computes suggestions on\n                  how to further construct the proof, and communicates\n                  these suggestions to the user via a graphical user\n                  interface. We furthermore introduce a focus\n                  technique in order to restrict the search space when\n                  deriving default suggestions. Although the agents we\n                  discuss in this paper are rather simple from a\n                  computational viewpoint, we indicate how the\n                  presented approach can be extended in order to\n                  increase its deductive power.},\n  Author =\t {Christoph Benzm{\\"u}ller and Volker Sorge},\n  Booktitle =\t {Artificial Intelligence: Methodology, Systems, and\n                  Applications, 8th International Conference, AIMSA\n                  '98, Sozopol, Bulgaria, September 21-13, 1998,\n                  Proceedings},\n  Doi =\t\t {10.1007/BFb0057438},\n  Editor =\t {Fausto Giunchiglia},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  System Integration, Agents},\n  Number =\t 1480,\n  Pages =\t {102-114},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {A Blackboard Architecture for Guiding Interactive\n                  Proofs},\n  url_preprint = {http://christoph-benzmueller.de/papers/C4.pdf},\n  Year =\t 1998,\n}\n\n
\n
\n\n\n
\n The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestion mechanism for commands. Such mechanisms support the user by decreasing the necessary interactions during the proof construction. Although many systems offer such facilities, they are often limited in their functionality. In this paper we present a new agent-based mechanism that independently observes the proof state, steadily computes suggestions on how to further construct the proof, and communicates these suggestions to the user via a graphical user interface. We furthermore introduce a focus technique in order to restrict the search space when deriving default suggestions. Although the agents we discuss in this paper are rather simple from a computational viewpoint, we indicate how the presented approach can be extended in order to increase its deductive power.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n An Adaptation of Paramodulation and RUE-Resolution to Higher-Order Logic.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Technical Report SR-98-07, Saarland University, SEKI Publications (ISSN 1437-4447), 1998.\n \n\n\n\n
\n\n\n\n \n \n \"An preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R7,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Institution =\t {Saarland University, SEKI Publications (ISSN\n                  1437-4447)},\n  Number =\t {SR-98-07},\n  Pages =\t {1-55},\n  Publisher =\t {{SEKI Publications (ISSN 1437-4447)}},\n  Title =\t {An Adaptation of Paramodulation and RUE-Resolution\n                  to Higher-Order Logic},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R7.pdf},\n  Year =\t 1998,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Distributed Graphical User Interface for the Interactive Proof System.\n \n \n\n\n \n Siekmann, J., Hess, S., Benzmüller, C., Cheikhrouhou, L., Fehrer, D., Fiedler, A., Horacek, H., Kohlhase, M., Konrad, K., Meier, A., Melis, E., & Sorge, V.\n\n\n \n\n\n\n In Proceedings of the International Workshop \"User Interfaces for Theorem Provers 1998 (UITP'98), pages 130-138, Eindhoven, Netherlands, 1998. \n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{W1,\n  Abstract =\t {Most interactive proof development environments are\n                  insufficient to handle the complexity of the\n                  information to be conveyed to the user and to\n                  support his orientation in large-scale proofs. In\n                  this paper we present a distributed client-server\n                  extension of the OMEGA proof development system,\n                  focusing on the LOUI (Lovely OMEGA User Interface)\n                  client. This graphical user interface provides\n                  advanced communication facilities through an\n                  adaptable proof tree visualization and through\n                  various selective proof object display methods. Some\n                  of LOUI's main features are the graphical display of\n                  co-references in proof graphs, a selective term\n                  browser, and support for dynamically adding\n                  knowledge to partial proofs -- all based upon and\n                  implemented in a client-server architecture.},\n  Address =\t {Eindhoven, Netherlands},\n  Author =\t {J{\\"o}rg Siekmann and Stephan Hess and Christoph\n                  Benzm{\\"u}ller and Lassaad Cheikhrouhou and Detlef\n                  Fehrer and Armin Fiedler and Helmut Horacek and\n                  Michael Kohlhase and Karsten Konrad and Andreas\n                  Meier and Erica Melis and Volker Sorge},\n  Booktitle =\t {Proceedings of the International Workshop "User\n                  Interfaces for Theorem Provers 1998 (UITP'98)},\n  Pages =\t {130-138},\n  Title =\t {A Distributed Graphical User Interface for the\n                  Interactive Proof System},\n  url_preprint = {http://christoph-benzmueller.de/papers/W1.pdf},\n  Year =\t 1998,\n}\n\n
\n
\n\n\n
\n Most interactive proof development environments are insufficient to handle the complexity of the information to be conveyed to the user and to support his orientation in large-scale proofs. In this paper we present a distributed client-server extension of the OMEGA proof development system, focusing on the LOUI (Lovely OMEGA User Interface) client. This graphical user interface provides advanced communication facilities through an adaptable proof tree visualization and through various selective proof object display methods. Some of LOUI's main features are the graphical display of co-references in proof graphs, a selective term browser, and support for dynamically adding knowledge to partial proofs – all based upon and implemented in a client-server architecture.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n Integrating TPS with OMEGA.\n \n \n\n\n \n Benzmüller, C., & Sorge, V.\n\n\n \n\n\n\n In Grundy, J., & Newey, M., editor(s), Theorem Proving in Higher Order Logics: Emerging Trends, of Technical Report 98-08, Department of Computer Science and Computer Science Lab, The Australian National University, pages 1-18, Canberra, Australia, 1998. \n \n\n\n\n
\n\n\n\n \n \n \"Integrating preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{W2,\n  Abstract =\t {We report on the integration of TPS as an external\n                  reasoning component into the mathematical assistant\n                  system OMEGA. Thereby TPS can be used both as an\n                  automatic theorem prover for higher order logic as\n                  well as interactively employed from within the OMEGA\n                  environment. TPS proofs can be directly incorporated\n                  into OMEGA on a tactic level enabling their\n                  visualization and verbalization. Using an example we\n                  show how \\tps\\/ proofs can be inserted into OMEGA's\n                  knowledge base by expanding them to calculus level\n                  using both OMEGA's tactic mechanism and the first\n                  order theorem prover OTTER. Furthermore we\n                  demonstrate how the facts from OMEGA's knowledge\n                  base can be used to build a TPS library.},\n  Address =\t {Canberra, Australia},\n  Author =\t {Christoph Benzm{\\"u}ller and Volker Sorge},\n  Booktitle =\t {Theorem Proving in Higher Order Logics: Emerging\n                  Trends},\n  Editor =\t {Jim Grundy and Malcolm Newey},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Proof Transformation, System Integration},\n  Pages =\t {1-18},\n  Series =\t {Technical Report 98-08, Department of Computer\n                  Science and Computer Science Lab, The Australian\n                  National University},\n  Title =\t {Integrating {TPS} with {OMEGA}},\n  url_preprint = {http://christoph-benzmueller.de/papers/W2.pdf},\n  Year =\t 1998,\n}\n\n
\n
\n\n\n
\n We report on the integration of TPS as an external reasoning component into the mathematical assistant system OMEGA. Thereby TPS can be used both as an automatic theorem prover for higher order logic as well as interactively employed from within the OMEGA environment. TPS proofs can be directly incorporated into OMEGA on a tactic level enabling their visualization and verbalization. Using an example we show how \\tps\\/ proofs can be inserted into OMEGA's knowledge base by expanding them to calculus level using both OMEGA's tactic mechanism and the first order theorem prover OTTER. Furthermore we demonstrate how the facts from OMEGA's knowledge base can be used to build a TPS library.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1997\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n OMEGA: Towards a mathematical assistant.\n \n \n\n\n \n Benzmüller, C., Cheikhrouhou, L., Fehrer, D., Fiedler, A., Huang, X., Kerber, M., Kohlhase, M., Konrad, K., Melis, E., Meier, A., Schaarschmidt, W., Siekmann, J., & Sorge, V.\n\n\n \n\n\n\n In McCune, W., editor(s), Automated Deduction - CADE-14, 14th International Conference on Automated Deduction, Townsville, North Queensland, Australia, July 13-17, 1997, Proceedings, of LNCS, pages 252-255, 1997. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OMEGA: preprint\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n\n\n
\n
@inproceedings{C1,\n  Abstract =\t {{Omega} is a mixed-initiative system with the\n                  ultimate purpose of supporting theorem proving in\n                  main-stream mathematics and mathematics\n                  education. The current system consists of a proof\n                  planner and an integrated collection of tools for\n                  formulating problems, proving subproblems, and proof\n                  presentation.},\n  Author =\t {Christoph Benzm{\\"u}ller and Lassaad Cheikhrouhou\n                  and Detlef Fehrer and Armin Fiedler and Xiaorong\n                  Huang and Manfred Kerber and Michael Kohlhase and\n                  Karsten Konrad and Erica Melis and Andreas Meier and\n                  Wolf Schaarschmidt and J{\\"o}rg Siekmann and Volker\n                  Sorge},\n  Booktitle =\t {Automated Deduction - CADE-14, 14th International\n                  Conference on Automated Deduction, Townsville, North\n                  Queensland, Australia, July 13-17, 1997,\n                  Proceedings},\n  Doi =\t\t {10.1007/3-540-63104-6_23},\n  Editor =\t {William McCune},\n  Keywords =\t {own, Proof Assistants, OMEGA, Interactive Proof,\n                  Automated Reasoning, Proof Planning, System\n                  Integration},\n  Number =\t 1249,\n  Pages =\t {252-255},\n  Publisher =\t {Springer},\n  Series =\t {LNCS},\n  Title =\t {{OMEGA}: Towards a mathematical assistant},\n  url_preprint = {http://christoph-benzmueller.de/papers/C1.pdf},\n  Year =\t 1997,\n}\n\n
\n
\n\n\n
\n Omega is a mixed-initiative system with the ultimate purpose of supporting theorem proving in main-stream mathematics and mathematics education. The current system consists of a proof planner and an integrated collection of tools for formulating problems, proving subproblems, and proof presentation.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n A Calculus and a System Architecture for Extensional Higher-Order Resolution.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Technical Report 97-198, Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, USA, 1997.\n \n\n\n\n
\n\n\n\n \n \n \"A preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R4,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Institution =\t {Department of Mathematical Sciences, Carnegie Mellon\n                  University, Pittsburgh, USA},\n  Number =\t {97-198},\n  Pages =\t {1-28},\n  Title =\t {A Calculus and a System Architecture for Extensional\n                  Higher-Order Resolution},\n  Type =\t {Research Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R4.pdf},\n  Year =\t 1997,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Model Existence for Higher-Order Logic.\n \n \n\n\n \n Benzmüller, C., & Kohlhase, M.\n\n\n \n\n\n\n Technical Report SR-97-09, Saarland University, SEKI Publications (ISSN 1437-4447), 1997.\n \n\n\n\n
\n\n\n\n \n \n \"Model preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R5,\n  Author =\t {Christoph Benzm{\\"u}ller and Michael Kohlhase},\n  Institution =\t {Saarland University, SEKI Publications (ISSN\n                  1437-4447)},\n  Number =\t {SR-97-09},\n  Pages =\t {1-34},\n  Publisher =\t {{SEKI Publications (ISSN 1437-4447)}},\n  Title =\t {Model Existence for Higher-Order Logic},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R5.pdf},\n  Year =\t 1997,\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n Henkin Completeness of Higher-Order Resolution.\n \n \n\n\n \n Benzmüller, C., & Kohlhase, M.\n\n\n \n\n\n\n Technical Report SR-97-10, Saarland University, SEKI Publications (ISSN 1437-4447), 1997.\n \n\n\n\n
\n\n\n\n \n \n \"Henkin preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R6,\n  Author =\t {Christoph Benzm{\\"u}ller and Michael Kohlhase},\n  Institution =\t {Saarland University, SEKI Publications (ISSN\n                  1437-4447)},\n  Number =\t {SR-97-10},\n  Pages =\t {1-12},\n  Publisher =\t {{SEKI Publications (ISSN 1437-4447)}},\n  Title =\t {Henkin Completeness of Higher-Order Resolution},\n  Type =\t {SEKI Report},\n  url_preprint = {http://christoph-benzmueller.de/papers/R6.pdf},\n  Year =\t 1997,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1995\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Proposal for my PhD-Study.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n 1995.\n Draft, AG Siekmann, Saarland University\n\n\n\n
\n\n\n\n \n \n \"Proposal preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@unpublished{R3,\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Note =\t {Draft, AG Siekmann, Saarland University},\n  Pages =\t {1-26},\n  Title =\t {Proposal for my {PhD}-Study},\n  url_preprint = {http://christoph-benzmueller.de/papers/R3.pdf},\n  Year =\t 1995,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1994\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Eine Fallstudie zur Spezifikation von Systemanforderungen in der Spezifikationssprache OBSCURE.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Master's thesis, Department of Computer Science, Saarland University, Germany, 1994.\n \n\n\n\n
\n\n\n\n \n \n \"Eine preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n
@mastersthesis{T1,\n  Keywords =\t {thesis},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Pages =\t {1-194},\n  School =\t {Department of Computer Science, Saarland University,\n                  Germany},\n  Title =\t {{Eine Fallstudie zur Spezifikation von\n                  Systemanforderungen in der Spezifikationssprache\n                  OBSCURE}},\n  url_preprint = {http://christoph-benzmueller.de/papers/T1.pdf},\n  Year =\t 1994,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1993\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n HDMS–A und OBSCURE in KORSO— Die Funktionale Essenz von HDMS–A aus Sicht der algorithmischen Spezifikationsmethode — TEIL 3: Spezifikation der atomaren Funktionen.\n \n \n\n\n \n Benzmüller, C.\n\n\n \n\n\n\n Technical Report A/06/93, Saarland University, SEKI Publications (ISSN 1437-4447), 1993.\n \n\n\n\n
\n\n\n\n \n \n \"HDMS–A preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R2,\n  Annote =\t {KORSO, Heck III, siehe Ben93},\n  Author =\t {Christoph Benzm{\\"u}ller},\n  Institution =\t {Saarland University, SEKI Publications (ISSN\n                  1437-4447)},\n  Number =\t {A/06/93},\n  Pages =\t {1-59},\n  Title =\t {{HDMS--A und OBSCURE in KORSO--- Die Funktionale\n                  Essenz von HDMS--A aus Sicht der algorithmischen\n                  Spezifikationsmethode --- TEIL 3: Spezifikation der\n                  atomaren Funktionen}},\n  Type =\t {Technischer Bericht},\n  url_preprint = {http://christoph-benzmueller.de/papers/R2.pdf},\n  Year =\t 1993,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1992\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n Das Fallbeispiel `UNIX' — Dokumentation einer UNIX-Filesystem-Spezifikation mit OWEB.\n \n \n\n\n \n Autexier, S., Benzmüller, C., & Heckler, R. A.\n\n\n \n\n\n\n Technical Report WP 92/36, Saarland University, SEKI Publications (ISSN 1437-4447), 1992.\n \n\n\n\n
\n\n\n\n \n \n \"Das preprint\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{R1,\n  Author =\t {Serge Autexier and Christoph Benzm{\\"u}ller and\n                  Ramses A. Heckler},\n  Institution =\t {Saarland University, SEKI Publications (ISSN\n                  1437-4447)},\n  Number =\t {WP 92/36},\n  Title =\t {{Das Fallbeispiel `UNIX' --- Dokumentation einer\n                  UNIX-Filesystem-Spezifikation mit OWEB}},\n  Type =\t {Working Paper},\n  url_preprint = {http://christoph-benzmueller.de/papers/R1.pdf},\n  Year =\t 1992,\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);