TY - CPAPER TI - Elixir meets TPTP : Bringing Automated Reasoning to the BEAM Ecosystem AU - Schuster, Johannes AU - Fuenmayor, David AU - Benzmüller, Christoph PY - 2026 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/117803 LA - eng AB - Automated theorem provers (ATPs) are powerful tools for formal reasoning, yet integrating them into larger software systems remains cumbersome: existing interfaces are typically script-based, tightly coupled, or limited in working across multiple backends in a uniform way. We present AtpClient, an Elixir library that provides a unified, extensible interface to ATP services across four backends, SystemOnTPTP, StarExec, Isabelle, and locally installed provers, using TPTP standards. The library acts as a truth-grounding service for host applications: it exposes a consistent API that abstracts over differences in communication protocols, result formats, and termination semantics, and normalizes the verdict of each backend into a single result type. Built on the BEAM virtual machine, it benefits from robust process isolation, fault-tolerant result polling, and uniform cancellation, making it well-suited to multi-prover experimentation and portfolio solving. We describe the architecture, discuss key design decisions, and reflect on challenges encountered when bridging the gap between ATP services and a functional runtime. We further show how the library is consumed by two downstream tools built on it without backend-specific tinkering: a Livebook Smart Cell that turns it into an interactive TPTP editor, and a Model Context Protocol server that exposes the backends to LLM-based agents. AtpClient is open source and available on Hex, the Elixir package registry. KW - Automated Theorem Proving KW - Elixir KW - Livebook KW - SystemOnTPTP KW - Isabelle/HOL KW - Model Context Protocol ER - TY - CPAPER TI - Building Blocks for Reasoning on the BEAM AU - Schuster, Johannes AU - Benzmüller, Christoph PY - 2026 T2 - Proceedings of 16th International Workshop on the Implementation on Logics. Proceedings of the 26th Conference on Logic for Programming, Artificial Intelligence, and Reasoning (short papers) SP - 98-111 PB - Kalpa Publications in Computing DO - 10.29007/z6j1 UR - https://fis.uni-bamberg.de/handle/uniba/117777 LA - eng ER - TY - JOUR TI - HOL in HOL over a set-theoretic universe : consistency of NK with infinity and choice AU - Benzmüller, Christoph AU - Kirchner, Daniel PY - 2026 JO - Archive of Formal Proofs PB - SourceForge CY - San Diego, CA SN - 2150-914x UR - https://fis.uni-bamberg.de/handle/uniba/117778 LA - eng ER - TY - GEN TI - Mathematical Proof Assistants for Teaching Logic : The LogiKEy Methodology AU - Benzmüller, Christoph AU - Fuenmayor, David AU - Pasetto, Luca PY - 2026 SP - 1-29 PB - arXiv DO - 10.48550/arxiv.2610.08214 UR - https://fis.uni-bamberg.de/handle/uniba/117577 LA - eng ER - TY - JOUR TI - Diagonalization as computation : Gödel sentence construction and a type-disciplined blueprint AU - Vestrucci, Andrea PY - 2026 SP - 761-799 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/117550 LA - eng AB - We present a type-disciplined, compositional reconstruction of the diagonal strategy in Gödel’s first incompleteness theorem. The goal is not a new or “more direct” proof of incompleteness, but an explicit computational unpacking of the mechanism. The paper exhibits a concrete pipeline of code-transformers between primitive recursive syntactic domains, thereby avoiding well-definedness issues arising in Lindenbaum-quotient formulations. A central feature is the separation between a graph-mediated witness form of the Gödel sentence and a canonical normal form, connected by an internal normalization lemma formalizable in the base theory. The paper also presents the construction categorically in a category of primitive recursive code domains and morphisms, and extracts a general diagonal-flipping blueprint clarifying how type stratification distinguishes paradoxical from limitative diagonal arguments. KW - Gödel’s first incompleteness theorem KW - Diagonalization KW - Gödel numbering KW - Primitive recursive functions KW - Lawvere fixed-point theorem KW - Diagonal arguments ER - TY - JOUR TI - Diagonalization as computation : Gödel sentence construction and a type-disciplined blueprint AU - Vestrucci, Andrea PY - 2026 JO - Archive for mathematical logic VL - 65 IS - 6 SP - 761-799 PB - Springer CY - Berlin ; Heidelberg SN - 1432-0665 DO - 10.1007/s00153-026-01021-7 UR - https://fis.uni-bamberg.de/handle/uniba/117549 LA - eng AB - We present a type-disciplined, compositional reconstruction of the diagonal strategy in Gödel’s first incompleteness theorem. The goal is not a new or “more direct” proof of incompleteness, but an explicit computational unpacking of the mechanism. The paper exhibits a concrete pipeline of code-transformers between primitive recursive syntactic domains, thereby avoiding well-definedness issues arising in Lindenbaum-quotient formulations. A central feature is the separation between a graph-mediated witness form of the Gödel sentence and a canonical normal form, connected by an internal normalization lemma formalizable in the base theory. The paper also presents the construction categorically in a category of primitive recursive code domains and morphisms, and extracts a general diagonal-flipping blueprint clarifying how type stratification distinguishes paradoxical from limitative diagonal arguments. KW - Gödel’s first incompleteness theorem KW - Diagonalization KW - Gödel numbering KW - Primitive recursive functions KW - Lawvere fixed-point theorem KW - Diagonal arguments ER - TY - GEN TI - Gödel's and Scott's Variants of the Ontological Argument in Lean 4 and TPTP THF AU - Benzmüller, Christoph PY - 2026 IS - Online first PB - arXiv DO - 10.48550/arxiv.2609.26806 UR - https://fis.uni-bamberg.de/handle/uniba/117502 LA - eng ER - TY - GEN TI - Proofs Without Nominals : Gödel's Ontological Argument, its Shallow Embedding, and the Open Questions of the Monatshefte Notes AU - Benzmüller, Christoph PY - 2026 PB - arXiv DO - 10.48550/arxiv.2609.36279 UR - https://fis.uni-bamberg.de/handle/uniba/117503 LA - eng ER - TY - CPAPER TI - Neuro-Symbolic Verification of LLM Outputs for Data-Sensitive Domains AU - Sigloch, Paul AU - Benzmüller, Christoph PY - 2026 T2 - KI 2026: Advances in Artificial Intelligence : 49th German Conference on AI, KI 2026, Bremen, Germany, August 11–14, 2026, Proceedings SP - 324-331 PB - Springer Nature Switzerland CY - Cham SN - 9783032323347 DO - 10.1007/978-3-032-32335-4_30 UR - https://fis.uni-bamberg.de/handle/uniba/117504 LA - eng ER - TY - CPAPER TI - The Fatio Protocol for Formal Dialogue in Isabelle/HOL AU - Pasetto, Luca AU - Benzmüller, Christoph PY - 2026 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-117139 UR - https://fis.uni-bamberg.de/handle/uniba/117139 LA - eng AB - - KW - Fatio Protocol for Formal Dialogue ER - TY - CHAP TI - On Absolute Infinity and Modal Collapse in Gödel’s Ontological Proof AU - Mühlenbeck, Cordelia AU - Benzmüller, Christoph PY - 2026 T2 - Logic, Knowledge, and Tradition : Essays in Honor of Srećko Kovač SP - 72–82 PB - Brill CY - Leiden ; Boston SN - 978-90-04-75635-9 DO - 10.1163/9789004756359-005 UR - https://fis.uni-bamberg.de/handle/uniba/117154 LA - eng ER - TY - JOUR TI - A Deep Embedding of HOL in HOL : Soundness, Completeness, Consistency (Isabelle/HOL dataset) AU - Benzmüller, Christoph AU - Kirchner, Daniel PY - 2026 JO - Archive of Formal Proofs PB - SourceForge CY - San Diego, CA SN - 2150-914x UR - https://fis.uni-bamberg.de/handle/uniba/117132 LA - eng ER - TY - JOUR TI - Monadic Second-Order Logic in HOL : Deep and Shallow Embeddings with Automated Faithfulness (Isabelle/HOL dataset) AU - Benzmüller, Christoph AU - Kirchner, Daniel PY - 2026 JO - Archive of Formal Proofs PB - SourceForge CY - San Diego, CA SN - 2150-914x UR - https://fis.uni-bamberg.de/handle/uniba/117133 LA - eng ER - TY - CPAPER TI - Elixir meets TPTP : Bringing Automated Reasoning to the BEAM Ecosystem AU - Schuster, Johannes AU - Fuenmayor, David AU - Benzmüller, Christoph PY - 2026 T2 - Proceedings of the 10th Workshop on Practical Aspects of Automated Reasoning (PAAR 2026), co-located with FLoC 2026, July 25, 2026, Lisbon, Portugal PB - RWTH Aachen CY - Aachen, Germany T3 - CEUR workshop proceedings SN - 1613-0073 UR - https://fis.uni-bamberg.de/handle/uniba/117137 LA - eng AB - Automated theorem provers (ATPs) are powerful tools for formal reasoning, yet integrating them into larger software systems remains cumbersome: existing interfaces are typically script-based, tightly coupled, or limited in working across multiple backends in a uniform way. We present AtpClient, an Elixir library that provides a unified, extensible interface to ATP services across four backends, SystemOnTPTP, StarExec, Isabelle, and locally installed provers, using TPTP standards. The library acts as a truth-grounding service for host applications: it exposes a consistent API that abstracts over differences in communication protocols, result formats, and termination semantics, and normalizes the verdict of each backend into a single result type. Built on the BEAM virtual machine, it benefits from robust process isolation, fault-tolerant result polling, and uniform cancellation, making it well-suited to multi-prover experimentation and portfolio solving. We describe the architecture, discuss key design decisions, and reflect on challenges encountered when bridging the gap between ATP services and a functional runtime. We further show how the library is consumed by two downstream tools built on it without backend-specific tinkering: a Livebook Smart Cell that turns it into an interactive TPTP editor, and a Model Context Protocol server that exposes the backends to LLM-based agents. AtpClient is open source and available on Hex, the Elixir package registry. KW - Automated Theorem Proving KW - Elixir KW - Livebook KW - SystemOnTPTP KW - Isabelle/HOL KW - Model Context Protocol ER - TY - GEN TI - First-Order Modal Logic in HOL : Deep and Shallow Embeddings with Automated Faithfulness (Extended Preprint) AU - Benzmüller, Christoph AU - Kirchner, Daniel PY - 2026 PB - arXiv DO - 10.48550/arxiv.2607.10880 UR - https://fis.uni-bamberg.de/handle/uniba/117136 LA - eng ER - TY - GEN TI - A Comment on Modal Collapse and Ultrafilters in Gödel's Ontological Argument AU - Benzmüller, Christoph PY - 2026 PB - arXiv DO - 10.48550/arxiv.2608.07578 UR - https://fis.uni-bamberg.de/handle/uniba/117135 LA - eng ER - TY - GEN TI - Monadic Second-Order Logic in HOL : Deep and Shallow with Automated Faithfulness (Extended Preprint) AU - Benzmüller, Christoph AU - Kirchner, Daniel PY - 2026 PB - arXiv DO - 10.48550/arxiv.2609.07345 UR - https://fis.uni-bamberg.de/handle/uniba/117134 LA - eng ER - TY - CPAPER TI - Faithful Logic Embeddings in HOL : Deep and Shallow AU - Benzmüller, Christoph PY - 2026 SP - 280-301 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/116614 LA - eng AB - Deep and shallow embeddings of non-classical logics in classical higher-order logic have been explored, implemented, and used in various reasoning tools in recent years. This paper presents a method for the simultaneous deployment of deep and shallow embeddings of various degrees in classical higher-order logic. This enables flexible, interactive and automated theorem proving and counterexample finding at meta and object level, as well as automated faithfulness proofs between these logic embeddings. The method is beneficial for logic education, research and application and is illustrated here using a simple propositional modal logic. However, this approach is conceptual in nature and not limited to this simple logic context. KW - Logic embeddings KW - Faithfulness KW - Automated Reasoning ER - TY - JOUR TI - Solving quantified modal logic problems by translation to classical logics AU - Steen, Alexander AU - Sutcliffe, Geoff AU - Benzmüller, Christoph PY - 2026 SP - 1-27 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/116610 LA - eng AB - This article describes an evaluation of Automated Theorem Proving (ATP) systems on problems taken from the QMLTP library of first-order modal logic problems. Principally, the problems are translated to both typed first-order and higher-order logic in the TPTP language using an embedding approach, and solved using first-order resp. higher-order logic ATP systems and model finders. Additionally, the results from native modal logic ATP systems are considered, and compared with the results from the embedding approach. The findings are that the embedding process is reliable and successful when state-of-the-art ATP systems are used as backend reasoners, The first-order and higher-order embeddings perform similarly, native modal logic ATP systems have comparable performance to classical systems using the embedding for proving theorems, native modal logic ATP systems are outperformed by the embedding approach for disproving conjectures, and the embedding approach can cope with a wider range of modal logics than the native modal systems considered. KW - Non-classical logics KW - Quantified modal logics KW - Higher-order logic KW - First-order logic KW - Automated theorem proving ER - TY - GEN TI - Neuro-Symbolic Verification of LLM Outputs for Data-Sensitive Domains (extended preprint) AU - Sigloch, Paul AU - Benzmüller, Christoph PY - 2026 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/115590 LA - eng AB - LLMs deployed in high-stakes domains face fundamental reliability challenges: hallucinations, inconsistencies, and privacy vulnerabilities introduce unacceptable risks where errors carry legal, financial, or safety consequences. This paper presents a hybrid verification architecture combining formal symbolic methods with neural semantic analysis to provide complementary guarantees for LLM-generated content. This architecture employs logical reasoning for input verification, leveraging completeness properties to provide decidable guarantees on structured requirements. For output validation, embedding-based semantic similarity detects contextual hallucinations where formal methods lack expressiveness. This separation is realized in a parallel, actor-based pipeline, addressing limitations of prompt-based self-verification approaches, which inherit the distributional biases that produce hallucinations. The proposed architecture and type-aware verification method are validated with HAIMEDA, a real-world medical device damage assessment reporting system developed through Action Design Research. Evaluation shows hallucination detection rates of over 83% for structured entities and 72% for semantic fabrications, with a 30% reduction in report creation time, demonstrating that neuro-symbolic architectures can provide principled safeguards for LLM deployment in data-sensitive domains. KW - Neuro-symbolic AI KW - LLM verification KW - Formal verification KW - Trustworthy AI KW - Hybrid AI KW - Actor model KW - AI system architecture ER - TY - GEN TI - Many Logics, One Methodology : A Plea for Logical Pluralism in Formalised Reasoning (preprint) AU - Benzmüller, Christoph AU - Kirchner, Daniel AU - Pasetto, Luca PY - 2026 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/115589 LA - eng AB - This position statement looks back on two decades of work on shallow embeddings of non-classical logics in classical higher-order logic (HOL), a line of research that expanded into a range of logic embeddings in HOL and inspired the LogiKEy logic-pluralistic knowledge representation and reasoning methodology. This paper advances the case for logical pluralism at object-logic level within a unifying meta-logical framework such as LogiKEy, grounding the argument in computational metaphysics. More broadly, it advocates principled support for logical pluralism in modern proof assistants, and cautions against logical imperialism -- the rigid adoption of a single foundational logic for large-scale theory developments -- which impedes the interdisciplinary reuse that LogiKEy is designed to enable. KW - Logical Pluralism KW - Meta-Logical Reasoning KW - Proof Assistants KW - Higher-Order Logic KW - Classical and Non-Classical Logics ER - TY - CPAPER TI - Formalizing Mental Privacy in LogiKEy AU - Pasetto, Luca AU - Benzmüller, Christoph AU - Markovich, Réka PY - 2026 SP - 3643-3645 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/115582 LA - eng AB - Neurotechnology and AI are expanding how systems can access and influence mental states, raising concerns about mental privacy. Yet the legal status of a right to mental privacy remains unsettled: it is often treated as a special case of the right to privacy, while others argue it is grounded in freedom of thought, which protects against coercion to disclose or adopt beliefs. Despite the regulatory and technological stakes, it is unclear how these epistemic rights formally interact or how autonomous systems can reason about them. We address this by introducing a Logic for Mental Privacy (LMP) that integrates multi-modal formalizations of the right to privacy and freedom of thought as epistemic claim-rights. We mechanize LMP in Isabelle/HOL via shallow semantical embeddings in Higher-Order Logic within the LogiKEy framework, and use automated reasoning to study its normative consequences. A case study shows how access to cognitive data can steer belief formation while remaining compliant with duties on explicitly protected content, yielding an indirect compromise of freedom of thought and exposing a normative gap around mental privacy. Overall, we show how legal knowledge representation and automated reasoning can inform debates on neurotechnology governance and support the design and analysis of normative multiagent systems. KW - Normative Multiagent Systems KW - Legal Knowledge Representation KW - Automated Reasoning KW - Modal Logic KW - Higher-Order Logic KW - LogiKEy KW - Mental Privacy KW - Freedom of Thought KW - Normative Positions ER - TY - GEN TI - Neuro-Symbolic Verification of LLM Outputs for Data-Sensitive Domains (extended preprint) AU - Sigloch, Paul AU - Benzmüller, Christoph PY - 2026 PB - arXiv DO - 10.48550/arxiv.2605.26942 UR - https://fis.uni-bamberg.de/handle/uniba/115305 LA - eng AB - LLMs deployed in high-stakes domains face fundamental reliability challenges: hallucinations, inconsistencies, and privacy vulnerabilities introduce unacceptable risks where errors carry legal, financial, or safety consequences. This paper presents a hybrid verification architecture combining formal symbolic methods with neural semantic analysis to provide complementary guarantees for LLM-generated content. This architecture employs logical reasoning for input verification, leveraging completeness properties to provide decidable guarantees on structured requirements. For output validation, embedding-based semantic similarity detects contextual hallucinations where formal methods lack expressiveness. This separation is realized in a parallel, actor-based pipeline, addressing limitations of prompt-based self-verification approaches, which inherit the distributional biases that produce hallucinations. The proposed architecture and type-aware verification method are validated with HAIMEDA, a real-world medical device damage assessment reporting system developed through Action Design Research. Evaluation shows hallucination detection rates of over 83% for structured entities and 72% for semantic fabrications, with a 30% reduction in report creation time, demonstrating that neuro-symbolic architectures can provide principled safeguards for LLM deployment in data-sensitive domains. KW - Neuro-symbolic AI KW - LLM verification KW - Formal verification KW - Trustworthy AI KW - Hybrid AI KW - Actor model KW - AI system architecture ER - TY - GEN TI - Many Logics, One Methodology : A Plea for Logical Pluralism in Formalised Reasoning (preprint) AU - Benzmüller, Christoph AU - Kirchner, Daniel AU - Pasetto, Luca PY - 2026 PB - arXiv DO - 10.48550/arxiv.2605.27246 UR - https://fis.uni-bamberg.de/handle/uniba/115304 LA - eng AB - This position statement looks back on two decades of work on shallow embeddings of non-classical logics in classical higher-order logic (HOL), a line of research that expanded into a range of logic embeddings in HOL and inspired the LogiKEy logic-pluralistic knowledge representation and reasoning methodology. This paper advances the case for logical pluralism at object-logic level within a unifying meta-logical framework such as LogiKEy, grounding the argument in computational metaphysics. More broadly, it advocates principled support for logical pluralism in modern proof assistants, and cautions against logical imperialism -- the rigid adoption of a single foundational logic for large-scale theory developments -- which impedes the interdisciplinary reuse that LogiKEy is designed to enable. KW - Logical Pluralism KW - Meta-Logical Reasoning KW - Proof Assistants KW - Higher-Order Logic KW - Classical and Non-Classical Logics ER - TY - CPAPER TI - Formalizing Mental Privacy in LogiKEy AU - Pasetto, Luca AU - Benzmüller, Christoph AU - Markovich, Réka PY - 2026 T2 - AAMAS 2026: Proc. of the 25th International Conference on Autonomous Agents and Multiagent Systems SP - 3643-3645 DO - 10.65109/ptsf2244 UR - https://fis.uni-bamberg.de/handle/uniba/115278 LA - eng AB - Neurotechnology and AI are expanding how systems can access and influence mental states, raising concerns about mental privacy. Yet the legal status of a right to mental privacy remains unsettled: it is often treated as a special case of the right to privacy, while others argue it is grounded in freedom of thought, which protects against coercion to disclose or adopt beliefs. Despite the regulatory and technological stakes, it is unclear how these epistemic rights formally interact or how autonomous systems can reason about them. We address this by introducing a Logic for Mental Privacy (LMP) that integrates multi-modal formalizations of the right to privacy and freedom of thought as epistemic claim-rights. We mechanize LMP in Isabelle/HOL via shallow semantical embeddings in Higher-Order Logic within the LogiKEy framework, and use automated reasoning to study its normative consequences. A case study shows how access to cognitive data can steer belief formation while remaining compliant with duties on explicitly protected content, yielding an indirect compromise of freedom of thought and exposing a normative gap around mental privacy. Overall, we show how legal knowledge representation and automated reasoning can inform debates on neurotechnology governance and support the design and analysis of normative multiagent systems. KW - Normative Multiagent Systems KW - Legal Knowledge Representation KW - Automated Reasoning KW - Modal Logic KW - Higher-Order Logic KW - LogiKEy KW - Mental Privacy KW - Freedom of Thought KW - Normative Positions ER - TY - JOUR TI - On the Maximality of Positive Properties and Modal Collapse in Variants of Gödel’s Ontological Proof for the Existence of God AU - Mühlenbeck, Cordelia AU - Benzmüller, Christoph PY - 2026 JO - Logic and logical philosophy : LLP IS - Online First SP - 1-21 PB - Nicholas Copernicus Univ. Press CY - Toruń SN - 1425-3305 DO - 10.12775/llp.2026.007 UR - https://fis.uni-bamberg.de/handle/uniba/114345 LA - eng ER - TY - JOUR TI - Neural-guided superoptimization in ethereum AU - Aguiar, Matheus Araújo AU - Albert, Elvira AU - Genaim, Samir AU - Gordillo, Pablo AU - Hernández-Cerezo, Alejandro AU - Kirchner, Daniel AU - Rubio, Albert PY - 2026 SP - 1-15 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/113119 LA - eng AB - Context: Superoptimization is a synthesis technique that, given a loop-free sequence of instructions, searches for an equivalent sequence that is optimal wrt. an objective function. Superoptimization of Ethereum smart contracts aims at minimizing the size of their bytecode and the gas consumption of executing the contract’s functions. The search for the optimal solution poses huge computational demands – as the search space to find the optimal sequence is exponential on the given size-bound – being the main challenge for superoptimization today to scale up to real, industrial software. Even if the underlying problem for finding the optimal solution is decidable, practical tools often prioritize efficiency over completeness. This means they might be implemented to find a sub-optimal solution or even time out. Objective: This work aims at leveraging superoptimization to a real setting: Ethereum blockchain. This paper proposes a neural-guided superoptimization (NGS) approach which incorporates deep neural networks using (supervised) learning into superoptimization to improve scalability by predicting: (1) if a sequence is already optimal and hence the search can be skipped; (2) the size-bound for the optimal solution in order to reduce the search space. Method: We have downloaded over 13,000 smart contracts deployed on the blockchain for training and testing the machine learning models, and a disjoint set with 100 of the smart contracts with more transactions to prove our scalability gains and impact for the Ethereum community. Results: Incorporating DNNs resulted in a 16x overall speedup (12x for gas) with only 12% optimization loss (14% for gas), or a 3-4x speedup with no optimization loss. For the 100 analyzed contracts, this approach reduced the average compilation time to 3 min per contract and achieved monetary savings of $1.24M. Conclusions: The integration of machine learning models mitigates several limitations of traditional superoptimization by drastically reducing execution times while maintaining most of the original optimization gains. KW - Smart contracts KW - Ethereum KW - Optimization KW - Machine learning ER - TY - CHAP TI - Symbolische Kontrolle für subsymbolische Künstliche Intelligenz? AU - Benzmüller, Christoph PY - 2026 SP - 211–226 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/113190 LA - deu AB - Forschungsaktivitäten in Richtung starker Künstlichen Intelligenz (KI) bzw. Artificial General Intelligence (AGI) haben aktuell stark an Fahrt aufgenommen. Ausgangspunkt sind dabei beachtliche Fortschritte vor allem im Bereich der datengetriebenen subsymbolischen KI (z. B. dem tiefen maschinellen Lernen), aber auch in der regelbasierten symbolischen KI. Mit solchen Aktivitäten im Einklang stehen sollte das Bestreben nach verantwortungsvoller KI, oder besser noch, nach sicherer KI. Selbst wenn eine starke KI (zumindest aus meiner Sicht) nicht unmittelbar absehbar ist, sollte diesem Aspekt größte Aufmerksamkeit geschenkt werden. Es ist nämlich insbesondere der unreflektierte Einsatz leistungsfähiger unvollkommener KI-Systeme in sehr kritischen Anwendungsgebieten (einschließlich des militärischen Bereichs), der zunehmend Anlass zur Sorge bereitet. In diesem Kapitel skizziere ich meine Position zu den Themen starke und sichere KI, führe dazu Äußerungen aus vorherigen eigenen Arbeiten zusammen und ergänze diese. KW - - ER - TY - JOUR TI - AI Ethics Beyond Compliance : Governance, Power, and Human Flourishing AU - Lumbreras, Sara AU - Vestrucci, Andrea AU - Weir, Ralph Stefan PY - 2026 SP - 5-9 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/113194 LA - eng AB - - KW - AI Ethics ER - TY - CPAPER TI - Visualizing Kripke Models in LogiKEy : the Case of SDL AU - Passeto, Luca AU - Benzmüller, Christoph PY - 2026 PB - Otto-Friedrich-Universität CY - Bamberg T3 - CEUR workshop proceedings UR - https://fis.uni-bamberg.de/handle/uniba/113026 LA - eng AB - LogiKEy is a framework and methodology for the design and engineering of ethico-legal reasoners. It is based on semantical embeddings of logics and logic combinations in expressive classical higher-order logic (HOL). This meta-logical approach allows the use of off-the-shelf theorem provers and (counter-)model finders for HOL such as Nitpick. While these model finders produce precise model descriptions, their raw textual output can be hard to read and interpret for users. In this paper, we present a tool that converts a Kripke model description from Nitpick into a TikZ graph. We showcase the tool using an example in Standard Deontic Logic (SDL). KW - Proof assistants KW - Model finders KW - Isabelle/HOL KW - Automated theorem proving KW - Semantical embedding KW - Higher-order logic ER - TY - CPAPER TI - Logical Modalities within the European AI Act : An Analysis AU - Lawniczak, Lara AU - Benzmüller, Christoph PY - 2026 SP - 348-353 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/112989 LA - eng AB - The paper presents a comprehensive analysis of the European AI Act in terms of its logical modalities, with the aim of preparing its formal representation, for example, within the logic-pluralistic Knowledge Engineering Framework and Methodology (LogiKEy). LogiKEy develops computational tools for normative reasoning based on formal methods, employing Higher-Order Logic (HOL) as a unifying meta-logic to integrate diverse logics through shallow semantic embeddings. This integration is facilitated by Isabelle/HOL, a proof assistant tool equipped with several automated theorem provers. The modalities within the AI Act and the logics suitable for their representation are discussed. For a selection of these logics, embeddings in HOL are created, which are then used to encode sample paragraphs. Initial experiments evaluate the suitability of these embeddings for automated reasoning, and highlight key challenges on the way to more robust reasoning capabilities. KW - European AI Act KW - Modalities KW - Non-classical logics KW - Higher-order Logic KW - Proof Assistants KW - Automated Reasoning ER - TY - JOUR TI - Notes on Gödel’s and Scott’s variants of the ontological argument AU - Benzmüller, Christoph AU - Scott, Dana PY - 2026 SP - 569-611 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/112503 LA - eng AB - Notes on Kurt Gödel’s modal ontological argument and Dana Scott’s variant of it are presented. These remarks, supported by experimental studies with a proof assistant system for classical higher-order logic, implicitly answer some questions the authors have received over the last decade(s). In addition, some new insights resulting from the conducted experiments are reported. KW - Gödel’s ontological argument KW - Interactive and automated theorem proving KW - Higher-order modal logic ER - TY - JOUR TI - Dependently-Typed Higher-Order Logic AU - Rothgang, Colin AU - Rabe, Florian AU - Benzmüller, Christoph PY - 2026 JO - ACM transactions on computational logic : TOCL VL - 27 IS - 1 SP - 1-54 PB - Association for Computing Machinery (ACM) CY - New York, NY SN - 1529-3785 DO - 10.1145/3771725 UR - https://fis.uni-bamberg.de/handle/uniba/110822 LA - eng ER - TY - CHAP TI - Belief Complexities and Modeling : An Interplay AU - Vestrucci, Andrea PY - 2025 T2 - Neuroscience of religion : integrating brain, mind and beliefs SP - 197-228 PB - Springer CY - Cham, Switzerland T3 - New approaches to the scientific study of religion SN - 978-3-032-02444-2 DO - 10.1007/978-3-032-02444-2_12 UR - https://fis.uni-bamberg.de/handle/uniba/117360 LA - eng ER - TY - CPAPER TI - HOL as a Lingua Franca for Argumentative Reasoning Agents AU - Fuenmayor, David AU - Benzmüller, Christoph PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-117138 UR - https://fis.uni-bamberg.de/handle/uniba/117138 LA - eng AB - - KW - HOL ER - TY - CPAPER TI - Faithful Logic Embeddings in HOL : Deep and Shallow AU - Benzmüller, Christoph PY - 2025 T2 - Automated Deduction – CADE 30 : 30th International Conference on Automated Deduction, Stuttgart, Germany, July 28-31, 2025, Proceedings SP - 280-301 PB - Springer Nature Switzerland CY - Cham SN - 9783031999833 DO - 10.1007/978-3-031-99984-0_16 UR - https://fis.uni-bamberg.de/handle/uniba/116345 LA - eng AB - Deep and shallow embeddings of non-classical logics in classical higher-order logic have been explored, implemented, and used in various reasoning tools in recent years. This paper presents a method for the simultaneous deployment of deep and shallow embeddings of various degrees in classical higher-order logic. This enables flexible, interactive and automated theorem proving and counterexample finding at meta and object level, as well as automated faithfulness proofs between these logic embeddings. The method is beneficial for logic education, research and application and is illustrated here using a simple propositional modal logic. However, this approach is conceptual in nature and not limited to this simple logic context. KW - Logic embeddings KW - Faithfulness KW - Automated Reasoning ER - TY - CHAP TI - Language and Religion AU - Jonas, Silvia AU - Vestrucci, Andrea PY - 2025 T2 - Encyclopedia of Language and Linguistics PB - Elsevier CY - Burlington ET - 2 SN - 978-0-08-054784-8 DO - 10.1016/b978-0-323-95504-1.00657-8 UR - https://fis.uni-bamberg.de/handle/uniba/115069 LA - eng ER - TY - RPRT TI - PetraKIP - Persönliches transparentes KI-basiertes Portfolio für die Lehrerbildung; Teilvorhaben: Lehr-Lernmethoden, Erforschung und Anwendung(sentwicklung) eines KI-basierten Portfolios (LeaKIP) : Schlussbericht AU - Romeike, Ralf AU - Benzmüller, Christoph AU - Landgraf, Tim PY - 2025 PB - Technische Informationsbibliothek CY - Hannover DO - 10.34657/31447 UR - https://fis.uni-bamberg.de/handle/uniba/114485 LA - deu ER - TY - THES TI - A Universal Mathematical Language for Argumentative Reasoning Agents AU - Fuenmayor, David PY - 2025 PB - Freie Universität Berlin CY - Berlin DO - 10.17169/refubium-48234 UR - https://fis.uni-bamberg.de/handle/uniba/114460 LA - eng ER - TY - GEN TI - AI Ethics Beyond Compliance : Governance, Power, and Human Flourishing ED - Vestrucci, Andrea ED - Lumbreras, Sara ED - Weir, Ralph Stefan PY - 2025 IS - 79 PB - Wydawn. Naukowe Scholar CY - Warszawa SN - 0860-3839 UR - https://fis.uni-bamberg.de/handle/uniba/112618 LA - eng ER - TY - JOUR TI - AI Ethics Beyond Compliance : Governance, Power, and Human Flourishing AU - Lumbreras, Sara AU - Vestrucci, Andrea AU - Weir, Ralph Stefan PY - 2025 JO - Edukacja Filozoficzna IS - 79 SP - 5-9 PB - Wydawn. Naukowe Scholar CY - Warszawa SN - 0860-3839 UR - https://fis.uni-bamberg.de/handle/uniba/112617 LA - eng AB - - KW - AI Ethics ER - TY - JOUR TI - La « liberté royale » du langage : paradoxes et révélation divine dans le De servo arbitrio de Luther AU - Vestrucci, Andrea PY - 2025 JO - Revue d'histoire du protestantisme VL - 10 IS - 4 SP - 423-445 PB - Droz CY - Genève SN - 2297-6167 DO - 10.47421/RHP_10.4_423-445 UR - https://fis.uni-bamberg.de/handle/uniba/112616 LA - fra ER - TY - JOUR TI - Forms of Paradox in Erasmus and Luther AU - Vestrucci, Andrea PY - 2025 JO - Lutherjahrbuch : Organ der internationalen Lutherforschung VL - 92 SP - 186-217 PB - Vandenhoeck & Ruprecht CY - Göttingen SN - 0342-0914 DO - 10.13109/9783666874987.186 UR - https://fis.uni-bamberg.de/handle/uniba/112615 LA - eng ER - TY - CPAPER TI - Logical Modalities within the European AI Act : An Analysis AU - Lawniczak, Lara AU - Benzmüller, Christoph PY - 2025 T2 - ICAIL '25: Proceedings of the Twentieth International Conference on Artificial Intelligence and Law SP - 348-353 PB - ACM SN - 979-8-4007-1939-4 DO - 10.1145/3769126.3769202 UR - https://fis.uni-bamberg.de/handle/uniba/112576 LA - eng AB - The paper presents a comprehensive analysis of the European AI Act in terms of its logical modalities, with the aim of preparing its formal representation, for example, within the logic-pluralistic Knowledge Engineering Framework and Methodology (LogiKEy). LogiKEy develops computational tools for normative reasoning based on formal methods, employing Higher-Order Logic (HOL) as a unifying meta-logic to integrate diverse logics through shallow semantic embeddings. This integration is facilitated by Isabelle/HOL, a proof assistant tool equipped with several automated theorem provers. The modalities within the AI Act and the logics suitable for their representation are discussed. For a selection of these logics, embeddings in HOL are created, which are then used to encode sample paragraphs. Initial experiments evaluate the suitability of these embeddings for automated reasoning, and highlight key challenges on the way to more robust reasoning capabilities. KW - European AI Act KW - Modalities KW - Non-classical logics KW - Higher-order Logic KW - Proof Assistants KW - Automated Reasoning ER - TY - THES TI - Symbolic AI in Critical Healthcare Setting : Towards Automated Governance of Spontaneous Breathing Trials for Streamlined Extubation AU - Stößel, Patrick Salvatore PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-110690 UR - https://fis.uni-bamberg.de/handle/uniba/110690 LA - eng AB - This thesis presents a novel approach to clinical decision support in critical care by leveraging symbolic artificial intelligence (AI) for the formalization and automated verification of Spontaneous Breathing Trial (SBT) readiness assessments. It introduces a prototype system that transforms Intensive Care Unit (ICU) checklist logic into machine-verifiable higher-order logic (HOL) using Isabelle/HOL, ensuring correctness-by-construction, traceability, and semantic fidelity. The system was implemented in Java and supports modular, extensible workflows encompassing Health Level 7 (HL7)-compatible data ingestion, logic generation, and automated proof execution. A simulated environment was used to evaluate the prototype’s performance across clinical and technical dimensions. Results demonstrate consistent and explainable classifications aligned with clinical expectations, and profiling indicates linear scalability with respect to patient count and checklist complexity. Qualitative analysis highlights the system’s interpretability, workflow compatibility, and auditability. Limitations concerning real-world integration, proof traceability, and regulatory readiness are critically examined. The work establishes a reusable methodology for the formalization of protocol-based reasoning and outlines future directions including live deployment, integration with subsymbolic models, and regulatory certification. This research contributes a technically sound and ethically aligned foundation for the development of transparent, verifiable, and adaptable AI systems in healthcare. KW - Symbolische Künstliche Intelligenz KW - Erklärbarkeit KW - Verifizierbarkeit KW - Höherstufige Logik KW - Medizinanwendung ER - TY - GEN TI - Logical Modalities within the European AI Act : An Analysis AU - Lawniczak, Lara AU - Benzmüller, Christoph PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/112312 LA - eng AB - The paper presents a comprehensive analysis of the European AI Act in terms of its logical modalities, with the aim of preparing its formal representation, for example, within the logic-pluralistic Knowledge Engineering Framework and Methodology (LogiKEy). LogiKEy develops computational tools for normative reasoning based on formal methods, employing Higher-Order Logic (HOL) as a unifying meta-logic to integrate diverse logics through shallow semantic embeddings. This integration is facilitated by Isabelle/HOL, a proof assistant tool equipped with several automated theorem provers. The modalities within the AI Act and the logics suitable for their representation are discussed. For a selection of these logics, embeddings in HOL are created, which are then used to encode sample paragraphs. Initial experiments evaluate the suitability of these embeddings for automated reasoning, and highlight key challenges on the way to more robust reasoning capabilities. KW - European AI Act KW - Modalities KW - Non-classical logics KW - Higher-order Logic KW - Proof Assistants KW - Automated Reasoning ER - TY - GEN TI - Script-Based Dialog Policy Planning for LLM-Powered Conversational Agents : A Basic Architecture for an "AI Therapist" AU - Wasenmüller, Robert AU - Hilbert, Kevin AU - Benzmüller, Christoph PY - 2025 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/112110 LA - eng AB - Large Language Model (LLM)-Powered Conversational Agents have the potential to provide users with scaled behavioral healthcare support, and potentially even deliver full-scale "AI therapy'" in the future. While such agents can already conduct fluent and proactive emotional support conversations, they inherently lack the ability to (a) consistently and reliably act by predefined rules to align their conversation with an overarching therapeutic concept and (b) make their decision paths inspectable for risk management and clinical evaluation -- both essential requirements for an "AI Therapist". In this work, we introduce a novel paradigm for dialog policy planning in conversational agents enabling them to (a) act according to an expert-written "script" that outlines the therapeutic approach and (b) explicitly transition through a finite set of states over the course of the conversation. The script acts as a deterministic component, constraining the LLM's behavior in desirable ways and establishing a basic architecture for an AI Therapist. We implement two variants of Script-Based Dialog Policy Planning using different prompting techniques and synthesize a total of 100 conversations with LLM-simulated patients. The results demonstrate the feasibility of this new technology and provide insights into the efficiency and effectiveness of different implementation variants. KW - Large Language Model (LLM) ER - TY - CPAPER TI - Visualizing Kripke Models in LogiKEy : the Case of SDL AU - Passeto, Luca AU - Benzmüller, Christoph PY - 2025 T2 - Joint Proceedings of the Workshops and Doctoral Consortium of the 41st International Conference on Logic Programming (ICLP-WS-DC 2025) PB - RWTH Aachen CY - Aachen, Germany T3 - CEUR workshop proceedings SN - 1613-0073 UR - https://fis.uni-bamberg.de/handle/uniba/112064 LA - eng AB - LogiKEy is a framework and methodology for the design and engineering of ethico-legal reasoners. It is based on semantical embeddings of logics and logic combinations in expressive classical higher-order logic (HOL). This meta-logical approach allows the use of off-the-shelf theorem provers and (counter-)model finders for HOL such as Nitpick. While these model finders produce precise model descriptions, their raw textual output can be hard to read and interpret for users. In this paper, we present a tool that converts a Kripke model description from Nitpick into a TikZ graph. We showcase the tool using an example in Standard Deontic Logic (SDL). KW - Proof assistants KW - Model finders KW - Isabelle/HOL KW - Automated theorem proving KW - Semantical embedding KW - Higher-order logic ER - TY - JOUR TI - On Reductions of Hintikka Sets for Higher-Order Logic AU - Steen, Alexander AU - Benzmüller, Christoph PY - 2025 JO - Journal of applied logics - IfCoLoG journal of logics and their applications VL - 12 IS - 7 SP - 1813-1834 PB - College Publications CY - London SN - 2631-9810 UR - https://fis.uni-bamberg.de/handle/uniba/112065 LA - eng ER - TY - CPAPER TI - Symbolic Approach to Trustworthy AI : Exploration and Healthcare Case Study AU - Vestrucci, Andrea AU - Benzmüller, Christoph AU - Evangelatos, Nikolaos PY - 2025 T2 - Information System Design : Intelligent Healthcare Informatics : Proceedings of Ninth International Conference on Information System Design and Intelligent Applications (ISDIA 2025) SP - 367-379 PB - Springer Nature CY - Singapore SN - 978-981-96-9241-5 DO - 10.1007/978-981-96-9242-2_27 UR - https://fis.uni-bamberg.de/handle/uniba/111633 LA - eng ER - TY - CPAPER TI - XAI in Healthcare : Analysis and Evaluation of XAI Tools and Legal Liability for Neural Networks : A Case Study on Tumor Image Classification AU - Tenne, Alina AU - Vestrucci, Andrea AU - Benzmüller, Christoph PY - 2025 T2 - Information System Design : Intelligent Healthcare Informatics : Proceedings of Ninth International Conference on Information System Design and Intelligent Applications (ISDIA 2025) SP - 423-434 PB - Springer Nature CY - Singapore SN - 978-981-96-9241-5 DO - 10.1007/978-981-96-9242-2_31 UR - https://fis.uni-bamberg.de/handle/uniba/111634 LA - eng ER - TY - JOUR TI - Challenges for Non-Classical Reasoning in Contemporary AI Applications AU - Steen, Alexander AU - Benzmüller, Christoph PY - 2025 SP - 7-16 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/110814 LA - eng AB - In knowledge representation and reasoning, a key area in artificial intelligence research, non-classical logics play a prominent double role: firstly, non-classical logic languages allow for a precise and transparent encoding of domain specific knowledge. Secondly, as the logical languages are equipped with custom-tailored rules of logical inference, they make available a principled approach to derive new knowledge from previous information. In practice, the first aspect addresses data storage and retrieval, the second aspect the utilization of available information. This article briefly surveys contemporary challenges of NCL research in AI. KW - AI Applications ER - TY - JOUR TI - Non-Classical Reasoning for Contemporary AI Applications AU - Steen, Alexander AU - Benzmüller, Christoph PY - 2025 SP - 3-5 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/110813 LA - eng AB - - KW - AI Applications ER - TY - JOUR TI - Reasoning with Epistemic Rights and Duties : Automating a Dynamic Logic of the Right to Know in LogiKEy AU - Lawniczak, Lara AU - Pasetto, Luca AU - Benzmüller, Christoph AU - Li, Xu AU - Markovich, Réka PY - 2025 JO - Frontiers in Artificial Intelligence and Applications IS - 413, ECAI 2025 SP - 1623-1630 PB - IOS Press CY - Amsterdam [u.a.] SN - 0922-6389 DO - 10.3233/faia250988 UR - https://fis.uni-bamberg.de/handle/uniba/110980 LA - eng ER - TY - CHAP TI - Symbolische Kontrolle für subsymbolische Künstliche Intelligenz? AU - Benzmüller, Christoph PY - 2025 T2 - Künstliche Intelligenz und Wir : Stand, Nutzung und Herausforderungen der KI SP - 211-226 PB - Springer Vieweg CY - Berlin SN - 9783662715666 DO - 10.1007/978-3-662-71567-3_11 UR - https://fis.uni-bamberg.de/handle/uniba/110724 LA - deu AB - Forschungsaktivitäten in Richtung starker Künstlichen Intelligenz (KI) bzw. Artificial General Intelligence (AGI) haben aktuell stark an Fahrt aufgenommen. Ausgangspunkt sind dabei beachtliche Fortschritte vor allem im Bereich der datengetriebenen subsymbolischen KI (z. B. dem tiefen maschinellen Lernen), aber auch in der regelbasierten symbolischen KI. Mit solchen Aktivitäten im Einklang stehen sollte das Bestreben nach verantwortungsvoller KI, oder besser noch, nach sicherer KI. Selbst wenn eine starke KI (zumindest aus meiner Sicht) nicht unmittelbar absehbar ist, sollte diesem Aspekt größte Aufmerksamkeit geschenkt werden. Es ist nämlich insbesondere der unreflektierte Einsatz leistungsfähiger unvollkommener KI-Systeme in sehr kritischen Anwendungsgebieten (einschließlich des militärischen Bereichs), der zunehmend Anlass zur Sorge bereitet. In diesem Kapitel skizziere ich meine Position zu den Themen starke und sichere KI, führe dazu Äußerungen aus vorherigen eigenen Arbeiten zusammen und ergänze diese. KW - - ER - TY - CHAP TI - Automatic Reasoning-Code Generation Using NLP-Based Entity Relations Identification AU - Aggarwal, Radhya AU - Kataria, Swastika AU - Urolagin, Siddhaling AU - Benzmüller, Christoph PY - 2025 T2 - Information System Design: Big Data Analytics and Data Science SP - 169-183 PB - Springer Nature Singapore CY - Singapore SN - 9789819692477 DO - 10.1007/978-981-96-9248-4_13 UR - https://fis.uni-bamberg.de/handle/uniba/110663 LA - eng ER - TY - JOUR TI - Secure Optimizations on Ethereum Bytecode Jump-Free Sequences AU - Albert, Elvira AU - Genaim, Samir AU - Kirchner, Daniel AU - Martin-Martin, Enrique PY - 2025 JO - IEEE Transactions on Dependable and Secure Computing VL - 22 IS - 4 SP - 3676-3691 PB - IEEE CY - New York, NY SN - 1941-0018 DO - 10.1109/tdsc.2025.3536803 UR - https://fis.uni-bamberg.de/handle/uniba/110286 LA - eng ER - TY - JOUR TI - Neural-guided superoptimization in ethereum AU - Aguiar, Matheus Araújo AU - Albert, Elvira AU - Genaim, Samir AU - Gordillo, Pablo AU - Hernández-Cerezo, Alejandro AU - Kirchner, Daniel AU - Rubio, Albert PY - 2025 JO - Information and Software Technology VL - 186 IS - October 2025, 107800 SP - 1-15 PB - Elsevier Science CY - Amsterdam [u.a.] SN - 0950-5849 DO - 10.1016/j.infsof.2025.107800 UR - https://fis.uni-bamberg.de/handle/uniba/110288 LA - eng AB - Context: Superoptimization is a synthesis technique that, given a loop-free sequence of instructions, searches for an equivalent sequence that is optimal wrt. an objective function. Superoptimization of Ethereum smart contracts aims at minimizing the size of their bytecode and the gas consumption of executing the contract’s functions. The search for the optimal solution poses huge computational demands – as the search space to find the optimal sequence is exponential on the given size-bound – being the main challenge for superoptimization today to scale up to real, industrial software. Even if the underlying problem for finding the optimal solution is decidable, practical tools often prioritize efficiency over completeness. This means they might be implemented to find a sub-optimal solution or even time out. Objective: This work aims at leveraging superoptimization to a real setting: Ethereum blockchain. This paper proposes a neural-guided superoptimization (NGS) approach which incorporates deep neural networks using (supervised) learning into superoptimization to improve scalability by predicting: (1) if a sequence is already optimal and hence the search can be skipped; (2) the size-bound for the optimal solution in order to reduce the search space. Method: We have downloaded over 13,000 smart contracts deployed on the blockchain for training and testing the machine learning models, and a disjoint set with 100 of the smart contracts with more transactions to prove our scalability gains and impact for the Ethereum community. Results: Incorporating DNNs resulted in a 16x overall speedup (12x for gas) with only 12% optimization loss (14% for gas), or a 3-4x speedup with no optimization loss. For the 100 analyzed contracts, this approach reduced the average compilation time to 3 min per contract and achieved monetary savings of $1.24M. Conclusions: The integration of machine learning models mitigates several limitations of traditional superoptimization by drastically reducing execution times while maintaining most of the original optimization gains. KW - Smart contracts KW - Ethereum KW - Optimization KW - Machine learning ER - TY - CHAP TI - KI, Überzeugungen und Freiheit AU - Vestrucci, Andrea PY - 2025 T2 - Braucht Demokratie Religion? : Auseinandersetzungen mit Hartmut Rosa SP - 277-293 PB - University of Bamberg Press CY - Bamberg SN - 978-3-98989-060-2 DO - 10.20378/irb-109909 UR - https://fis.uni-bamberg.de/handle/uniba/109909 LA - deu AB - - KW - - ER - TY - BOOK TI - Braucht Demokratie Religion? : Auseinandersetzungen mit Hartmut Rosa AU - Braches-Chyrek, Rita AU - Bründl, Jürgen AU - Fischer, Pascal AU - Freitag, Sabine AU - Gerten, Michael AU - Gies, Kathrin AU - Grell, Frithjof Roland Gerhard AU - Hoffjann, Olaf AU - Huber, Stefan AU - Jäger, Gabriel AU - Kügler, Joachim AU - Laubach, Thomas AU - Lochner, Carolin AU - Rau, Caroline AU - Reheis, Fritz AU - Rüb, Paula Maria AU - Schmitt, Alexander AU - Steinberger, Simon AU - Vestrucci, Andrea AU - Zintl, Reinhard ED - Laubach, Thomas ED - Huber, Stefan PY - 2025 PB - University of Bamberg Press CY - Bamberg T3 - Bamberger Theologische Studien SN - 978-3-98989-060-2 DO - 10.20378/irb-108272 UR - https://fis.uni-bamberg.de/handle/uniba/108272 LA - deu AB - Demokratie und Religion erleben derzeit eine gleichzeitige Krise gesellschaftlicher Legitimation. In vielen Gesellschaften nimmt das Vertrauen in demokratische Institutionen ebenso ab wie in religiöse Organisationen – besonders in Europa. Während Demokratien an Gestaltungskraft verlieren, wird Religion zunehmend als rückwärtsgewandt oder konflikthaft wahrgenommen. Vor diesem Hintergrund wirft die These von Hartmut Rosa, Religion könne zur Stärkung demokratischer Strukturen beitragen, grundlegende Fragen auf. Der vorliegende Band versammelt Beiträge eines interdisziplinären Symposiums an der Otto-Friedrich-Universität Bamberg. Forschende aus Theologie, Politikwissenschaft, Geschichtswissenschaft, Kommunikationswissenschaft, Literaturwissenschaft, Informatik, Pädagogik und Philosophie analysieren das Verhältnis von Religion und Demokratie aus unterschiedlichen Perspektiven. Ziel ist es, einen differenzierten Beitrag zur Auseinandersetzung mit Rosas These und ihrer gesellschaftlichen Relevanz zu leisten. Die Beiträge regen zur kritischen Reflexion über das Verhältnis von politischer Ordnung und religiöser Sinnstiftung an. Sie entstanden im Rahmen einer hochschulweiten Auseinandersetzung mit Hartmut Rosas Buch "Demokratie braucht Religion", die universitäre und außeruniversitäre Akteur:innen miteinander ins Gespräch brachte. KW - Demokratie KW - Religion KW - Politik KW - Hartmut Rosa KW - Resonanz KW - Gesellschaft KW - Democracy KW - Politics KW - Resonance KW - Society ER - TY - JOUR TI - Faithful Logic Embeddings in HOL : Deep and Shallow (Isabelle/HOL dataset) AU - Benzmüller, Christoph PY - 2025 JO - Archive of Formal Proofs SN - 2150-914x UR - https://fis.uni-bamberg.de/handle/uniba/108582 LA - eng ER - TY - GEN TI - Faithful Logic Embeddings in HOL : Deep and Shallow AU - Benzmüller, Christoph PY - 2025 SP - 1-24 PB - arXiv DO - 10.48550/arxiv.2502.19311 UR - https://fis.uni-bamberg.de/handle/uniba/108501 LA - eng ER - TY - JOUR TI - Modelling Value-Oriented Legal Reasoning in LogiKEy AU - Benzmüller, Christoph AU - Fuenmayor, David AU - Lomfeld, Bertram PY - 2025 SP - 31–78 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/108279 LA - eng AB - The logico-pluralist L OGI KE Y knowledge engineering methodology and framework is applied to the modelling of a theory of legal balancing, in which legal knowledge (cases and laws) is encoded by utilising context-dependent value preferences. The theory obtained is then used to formalise, automatically evaluate, and reconstruct illustrative property law cases (involving the appropriation of wild animals) within the Isabelle HOL proof assistant system, illustrating how L OGI KE Y can harness interactive and automated theorem-proving technology to provide a testbed for the development and formal verification of legal domain-specific languages and theories. Modelling value-oriented legal reasoning in that framework, we establish novel bridges between the latest research in knowledge representation and reasoning in non-classical logics, automated theorem proving, and applications in legal reasoning. KW - legal balancing; value-oriented reasoning KW - automated theorem proving KW - logical pluralism KW - proof assistants KW - Isabelle/HOL ER - TY - CPAPER TI - Check News in One Click : NLP-Empowered Pro-Kremlin Propaganda Detection AU - Solopova, Veronika AU - Herman, Viktoriia AU - Benzmüller, Christoph AU - Landgraf, Tim PY - 2025 SP - 44-51 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/108391 LA - eng AB - Many European citizens become targets of the Kremlin propaganda campaigns, aiming to minimise public support for Ukraine, foster a climate of mistrust and disunity, and shape elections (Meister, 2022). To address this challenge, we developed “Check News in 1 Click”, the first NLP-empowered pro-Kremlin propaganda detection application available in 7 languages, which provides the lay user with feedback on their news, and explains manipulative linguistic features and keywords. We conducted a user study, analysed user entries and models’ behaviour paired with questionnaire answers, and investigated the advantages and disadvantages of the proposed interpretative solution. KW - Propaganda ER - TY - JOUR TI - Who finds the short proof? : Searching for Wormholes in Proof-Space AU - Benzmüller, Christoph PY - 2025 SP - 6 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/108389 LA - eng AB - In my talk I presented recently published results that had not been communicated at conferences or workshops before: An exploration of Boolos’ Curious Inference using higher-order automated theorem provers (ATPs). Surprisingly, only suitable shorthand notations had to be provided by hand for ATPs to find a short proof. The higher-order lemmas required for constructing a short proof are automatically discovered by the ATPs. Given the observations and suggestions in this paper, full proof automation of Boolos’ and related examples now seems to be within reach of higher-order ATPs KW - short proof ER - TY - JOUR TI - Notes on Gödel’s and Scott’s variants of the ontological argument AU - Benzmüller, Christoph AU - Scott, Dana PY - 2025 JO - Monatshefte für Mathematik VL - 208 IS - 4 SP - 569-611 PB - Springer CY - Wien [u.a.] SN - 1436-5081 DO - 10.1007/s00605-025-02078-x UR - https://fis.uni-bamberg.de/handle/uniba/107698 LA - eng AB - Notes on Kurt Gödel’s modal ontological argument and Dana Scott’s variant of it are presented. These remarks, supported by experimental studies with a proof assistant system for classical higher-order logic, implicitly answer some questions the authors have received over the last decade(s). In addition, some new insights resulting from the conducted experiments are reported. KW - Gödel’s ontological argument KW - Interactive and automated theorem proving KW - Higher-order modal logic ER - TY - CPAPER TI - Towards StarExec in the Cloud AU - Fuenmayor, David AU - McKeown, Jack AU - Sutcliffe, Geoff PY - 2025 VL - 21 SP - 45-60 PB - EasyChair SN - 2515-1762 DO - 10.29007/nsxs UR - https://fis.uni-bamberg.de/handle/uniba/107566 LA - eng ER - TY - CPAPER TI - Searching for Wormholes in Proof-Space AU - Fuenmayor, David AU - Benzmüller, Christoph PY - 2025 T2 - Proceedings of the 14th and 15th International Workshops on the Implementation of Logics IS - 21 SP - 15-17 SN - 2515-1762 DO - 10.29007/fc89 UR - https://fis.uni-bamberg.de/handle/uniba/107401 LA - eng ER - TY - JOUR TI - Notes on Gödel's and Scott's Variants of the Ontological Argument (Isabelle/HOL dataset) AU - Benzmüller, Christoph AU - Scott, Dana S. PY - 2025 JO - Archive of Formal Proofs SN - 2150-914x UR - https://fis.uni-bamberg.de/handle/uniba/106964 LA - eng ER - TY - GEN TI - Logical Modalities within the European AI Act : An Analysis AU - Lawniczak, Lara AU - Benzmüller, Christoph PY - 2025 PB - arXiv DO - 10.48550/arxiv.2501.19112 UR - https://fis.uni-bamberg.de/handle/uniba/106261 LA - eng AB - The paper presents a comprehensive analysis of the European AI Act in terms of its logical modalities, with the aim of preparing its formal representation, for example, within the logic-pluralistic Knowledge Engineering Framework and Methodology (LogiKEy). LogiKEy develops computational tools for normative reasoning based on formal methods, employing Higher-Order Logic (HOL) as a unifying meta-logic to integrate diverse logics through shallow semantic embeddings. This integration is facilitated by Isabelle/HOL, a proof assistant tool equipped with several automated theorem provers. The modalities within the AI Act and the logics suitable for their representation are discussed. For a selection of these logics, embeddings in HOL are created, which are then used to encode sample paragraphs. Initial experiments evaluate the suitability of these embeddings for automated reasoning, and highlight key challenges on the way to more robust reasoning capabilities. KW - European AI Act KW - Modalities KW - Non-classical logics KW - Higher-order Logic KW - Proof Assistants KW - Automated Reasoning ER - TY - JOUR TI - Solving quantified modal logic problems by translation to classical logics AU - Steen, Alexander AU - Sutcliffe, Geoff AU - Benzmüller, Christoph PY - 2025 JO - Journal of logic and computation VL - 35 IS - 4, exaf006 SP - 1-23 PB - Oxford Univ. Press CY - Eynsham, Oxford SN - 1465-363X DO - 10.1093/logcom/exaf006 UR - https://fis.uni-bamberg.de/handle/uniba/106288 LA - eng AB - This article describes an evaluation of Automated Theorem Proving (ATP) systems on problems taken from the QMLTP library of first-order modal logic problems. Principally, the problems are translated to both typed first-order and higher-order logic in the TPTP language using an embedding approach, and solved using first-order resp. higher-order logic ATP systems and model finders. Additionally, the results from native modal logic ATP systems are considered, and compared with the results from the embedding approach. The findings are that the embedding process is reliable and successful when state-of-the-art ATP systems are used as backend reasoners, The first-order and higher-order embeddings perform similarly, native modal logic ATP systems have comparable performance to classical systems using the embedding for proving theorems, native modal logic ATP systems are outperformed by the embedding approach for disproving conjectures, and the embedding approach can cope with a wider range of modal logics than the native modal systems considered. KW - Non-classical logics KW - Quantified modal logics KW - Higher-order logic KW - First-order logic KW - Automated theorem proving ER - TY - JOUR TI - Computer-Verified Foundations of Metaphysics AU - Kirchner, Daniel PY - 2025 SP - 95-98 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/106098 LA - eng AB - - KW - Metaphysics ER - TY - JOUR TI - Conditional normative reasoning as a fragment of HOL AU - Parent, Xavier AU - Benzmüller, Christoph PY - 2024 SP - 561-592 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/111089 LA - eng AB - We report on the mechanisation of (preference-based) conditional normative reasoning. Our focus is on Åqvist's system E for conditional obligation, and its extensions. Our mechanisation is achieved via a shallow semantical embedding in Isabelle/HOL. We consider two possible uses of the framework. The first one is as a tool for meta-reasoning about the considered logic. We employ it for the automated verification of deontic correspondences (broadly conceived) and related matters, analogous to what has been previously achieved for the modal logic cube. The equivalence is automatically verified in one direction, leading from the property to the axiom. The second use is as a tool for assessing ethical arguments. We provide a computer encoding of a well-known paradox (or impossibility theorem) in population ethics, Parfit's repugnant conclusion. While some have proposed overcoming the impossibility theorem by abandoning the presupposed transitivity of ‘better than’, our formalisation unveils a less extreme approach, suggesting among other things the option of weakening transitivity suitably rather than discarding it entirely. Whether the presented encoding increases or decreases the attractiveness and persuasiveness of the repugnant conclusion is a question we would like to pass on to philosophy and ethics. KW - Conditional obligation KW - correspondence KW - population ethics KW - mere addition/repugnant conclusion paradox KW - weakenings of transitivity ER - TY - BOOK TI - Proceedings of the 5th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2024), Nancy, France, July 1, 2024 ED - Benzmüller, Christoph ED - Otten, Jens ED - Ramanayake, Revantha PY - 2024 UR - https://fis.uni-bamberg.de/handle/uniba/105539 LA - eng ER - TY - CPAPER TI - Implementing the Fatio Protocol for Multi-Agent Argumentation in LogiKEy AU - Passeto, Luca AU - Benzmüller, Christoph PY - 2024 T2 - Proceedings of the 5th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2024), Nancy, France, July 1, 2024 SP - 38-47 UR - https://fis.uni-bamberg.de/handle/uniba/105540 LA - eng ER - TY - GEN TI - Script-Based Dialog Policy Planning for LLM-Powered Conversational Agents : A Basic Architecture for an "AI Therapist" AU - Wasenmüller, Robert AU - Hilbert, Kevin AU - Benzmüller, Christoph PY - 2024 PB - arXiv DO - 10.48550/arxiv.2412.15242 UR - https://fis.uni-bamberg.de/handle/uniba/105541 LA - eng AB - Large Language Model (LLM)-Powered Conversational Agents have the potential to provide users with scaled behavioral healthcare support, and potentially even deliver full-scale "AI therapy'" in the future. While such agents can already conduct fluent and proactive emotional support conversations, they inherently lack the ability to (a) consistently and reliably act by predefined rules to align their conversation with an overarching therapeutic concept and (b) make their decision paths inspectable for risk management and clinical evaluation -- both essential requirements for an "AI Therapist". In this work, we introduce a novel paradigm for dialog policy planning in conversational agents enabling them to (a) act according to an expert-written "script" that outlines the therapeutic approach and (b) explicitly transition through a finite set of states over the course of the conversation. The script acts as a deterministic component, constraining the LLM's behavior in desirable ways and establishing a basic architecture for an AI Therapist. We implement two variants of Script-Based Dialog Policy Planning using different prompting techniques and synthesize a total of 100 conversations with LLM-simulated patients. The results demonstrate the feasibility of this new technology and provide insights into the efficiency and effectiveness of different implementation variants. KW - Large Language Model (LLM) ER - TY - CHAP TI - Kurt Gödel and the Logical Existence of God AU - Vestrucci, Andrea AU - Benzmüller, Christoph PY - 2024 T2 - Divined explanations : the theological and philosophical context for the development of the sciences (1600-2000). SP - 255-285 PB - Brill CY - Leiden SN - 978-90-04-70188-5 DO - 10.1163/9789004701908_013 UR - https://fis.uni-bamberg.de/handle/uniba/105272 LA - eng ER - TY - THES TI - Responsible decision-making in trustworthy human-AI interaction : linking counterfactual explanations and regret AU - Martin Pena, Rosa PY - 2024 PB - Universidad de Valladolid CY - Valladolid DO - 10.35376/10324/71450 UR - https://fis.uni-bamberg.de/handle/uniba/104711 LA - eng ER - TY - GEN TI - Künstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen ED - Steen, Alexander ED - Benzmüller, Christoph PY - 2024 VL - 38 IS - 1-2, Non-Classical Reasoning PB - Springer CY - Berlin SN - 0933-1875 UR - https://fis.uni-bamberg.de/handle/uniba/104325 LA - eng ER - TY - JOUR TI - Computer-Verified Foundations of Metaphysics AU - Kirchner, Daniel PY - 2024 JO - Künstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen VL - 38 IS - 1-2 SP - 95-98 PB - Springer CY - Berlin SN - 1610-1987 DO - 10.1007/s13218-024-00834-z UR - https://fis.uni-bamberg.de/handle/uniba/104324 LA - eng AB - - KW - Metaphysics ER - TY - JOUR TI - Conditional normative reasoning as a fragment of HOL AU - Parent, Xavier AU - Benzmüller, Christoph PY - 2024 JO - Journal of Applied Non-Classical Logics VL - 34 IS - 4 SP - 561-592 PB - Taylor & Francis CY - London SN - 1166-3081 DO - 10.1080/11663081.2024.2386917 UR - https://fis.uni-bamberg.de/handle/uniba/98211 LA - eng AB - We report on the mechanisation of (preference-based) conditional normative reasoning. Our focus is on Åqvist's system E for conditional obligation, and its extensions. Our mechanisation is achieved via a shallow semantical embedding in Isabelle/HOL. We consider two possible uses of the framework. The first one is as a tool for meta-reasoning about the considered logic. We employ it for the automated verification of deontic correspondences (broadly conceived) and related matters, analogous to what has been previously achieved for the modal logic cube. The equivalence is automatically verified in one direction, leading from the property to the axiom. The second use is as a tool for assessing ethical arguments. We provide a computer encoding of a well-known paradox (or impossibility theorem) in population ethics, Parfit's repugnant conclusion. While some have proposed overcoming the impossibility theorem by abandoning the presupposed transitivity of ‘better than’, our formalisation unveils a less extreme approach, suggesting among other things the option of weakening transitivity suitably rather than discarding it entirely. Whether the presented encoding increases or decreases the attractiveness and persuasiveness of the repugnant conclusion is a question we would like to pass on to philosophy and ethics. KW - Conditional obligation KW - correspondence KW - population ethics KW - mere addition/repugnant conclusion paradox KW - weakenings of transitivity ER - TY - CHAP TI - Logikbasierte Wissensverarbeitung AU - Benzmüller, Christoph PY - 2024 T2 - Künstliche Intelligenz für Lehrkräfte : Eine fachliche Einführung mit didaktischen Hinweisen SP - 139-162 PB - Springer Vieweg CY - Wiesbaden SN - 978-3-658-44247-7 DO - 10.1007/978-3-658-44248-4_11 UR - https://fis.uni-bamberg.de/handle/uniba/98158 LA - deu ER - TY - CHAP TI - Schließen aus Wissen AU - Furbach, Ulrich AU - Benzmüller, Christoph PY - 2024 T2 - Künstliche Intelligenz für Lehrkräfte : Eine fachliche Einführung mit didaktischen Hinweisen SP - 39-50 PB - Springer Vieweg CY - Wiesbaden SN - 978-3-658-44247-7 DO - 10.1007/978-3-658-44248-4_4 UR - https://fis.uni-bamberg.de/handle/uniba/98159 LA - deu ER - TY - CHAP TI - Verantwortung AU - Höper, Lukas AU - Schulte, Carsten AU - Benzmüller, Christoph PY - 2024 T2 - Künstliche Intelligenz für Lehrkräfte : Eine fachliche Einführung mit didaktischen Hinweisen SP - 219-242 PB - Springer Vieweg CY - Wiesbaden SN - 978-3-658-44247-7 DO - 10.1007/978-3-658-44248-4_16 UR - https://fis.uni-bamberg.de/handle/uniba/98067 LA - deu ER - TY - GEN TI - Check News in One Click : NLP-Empowered Pro-Kremlin Propaganda Detection AU - Solopova, Veronika AU - Herman, Viktoriia AU - Benzmüller, Christoph AU - Landgraf, Tim PY - 2024 SP - 1-8 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/95775 LA - eng AB - Many European citizens become targets of the Kremlin propaganda campaigns, aiming to minimise public support for Ukraine, foster a climate of mistrust and disunity, and shape elections (Meister, 2022). To address this challenge, we developed ''Check News in 1 Click'', the first NLP-empowered pro-Kremlin propaganda detection application available in 7 languages, which provides the lay user with feedback on their news, and explains manipulative linguistic features and keywords. We conducted a user study, analysed user entries and models' behaviour paired with questionnaire answers, and investigated the advantages and disadvantages of the proposed interpretative solution. KW - News ER - TY - CPAPER TI - AI-powered automatic feedback on reflective writing AU - Solopova, Veronika AU - Romeike, Ralf AU - Gläser-Zikuda, Michaela AU - Benzmüller, Christoph AU - Landgraf, Tim AU - Hofmann, Florian AU - Schießl, Jessica AU - Zhang, Chengming AU - Plößl, Lea AU - Witte, Sascha PY - 2024 T2 - Annual Conference of the European Teacher Education Network (ETEN) “Teacher Education – Connecting Glocal” SP - 1-13 PB - Otto-Friedrich-Universität CY - Bamberg DO - 10.20378/irb-95237 UR - https://fis.uni-bamberg.de/handle/uniba/95237 LA - eng AB - - KW - AI KW - reflective writing KW - automatic feedback ER - TY - CPAPER TI - The LogiKEy Methodology : Applications in AI Ethics and Prospects in Logic Teaching AU - Benzmüller, Christoph AU - Fuenmayor, David PY - 2024 T2 - Formal Methods and Science in Philosophy V, International Conference, Book of AbstractS SP - 9-10 CY - Zagreb UR - https://fis.uni-bamberg.de/handle/uniba/96832 LA - eng ER - TY - CPAPER TI - On the Maximum of Positive Properties and Modal Collapse in Gödel’s Ontological Argument Compared to its Variants AU - Mühlenbeck, Cordelia AU - Benzmüller, Christoph PY - 2024 T2 - Formal Methods and Science in Philosophy V, International Conference, Book of Abstracts SP - 31-32 CY - Zagreb UR - https://fis.uni-bamberg.de/handle/uniba/96833 LA - eng ER - TY - JOUR TI - Challenges for Non-Classical Reasoning in Contemporary AI Applications AU - Steen, Alexander AU - Benzmüller, Christoph PY - 2024 JO - Künstliche Intelligenz : KI VL - 38 IS - 1-2 SP - 7-16 PB - Springer Nature CY - Berlin SN - 1610-1987 DO - 10.1007/s13218-024-00855-8 UR - https://fis.uni-bamberg.de/handle/uniba/96576 LA - eng AB - In knowledge representation and reasoning, a key area in artificial intelligence research, non-classical logics play a prominent double role: firstly, non-classical logic languages allow for a precise and transparent encoding of domain specific knowledge. Secondly, as the logical languages are equipped with custom-tailored rules of logical inference, they make available a principled approach to derive new knowledge from previous information. In practice, the first aspect addresses data storage and retrieval, the second aspect the utilization of available information. This article briefly surveys contemporary challenges of NCL research in AI. KW - AI Applications ER - TY - JOUR TI - Non-Classical Reasoning for Contemporary AI Applications AU - Steen, Alexander AU - Benzmüller, Christoph PY - 2024 JO - Künstliche Intelligenz : KI VL - 38 IS - 1-2 SP - 3-5 PB - Springer Science and Business Media LLC CY - Berlin SN - 1610-1987 DO - 10.1007/s13218-024-00857-6 UR - https://fis.uni-bamberg.de/handle/uniba/96577 LA - eng AB - - KW - AI Applications ER - TY - BOOK TI - Automated Reasoning : 12th International Joint Conference : IJCAR 2024 ; Nancy, France, July 3–6, 2024; Proceedings ED - Benzmüller, Christoph ED - Heule, Marijn J.H. ED - Schmidt, Renate A. PY - 2024 PB - Springer Nature Switzerland CY - Cham SN - 978-3-031-63498-7 DO - 10.1007/978-3-031-63501-4 UR - https://fis.uni-bamberg.de/handle/uniba/96328 LA - eng ER - TY - BOOK TI - Automated Reasoning : 12th International Joint Conference : IJCAR 2024 ; Nancy, France, July 3–6, 2024 ; Proceedings ED - Benzmüller, Christoph ED - Schmidt, Renate A. ED - Heule, Marijn J.H. PY - 2024 PB - Springer Nature Switzerland CY - Cham SN - 978-3-031-63498-7 DO - 10.1007/978-3-031-63498-7 UR - https://fis.uni-bamberg.de/handle/uniba/96329 LA - eng ER - TY - BOOK TI - Digital Sapiens : Decidere con l'intelligenza artificiale AU - Vestrucci, Andrea AU - Lattanzi, Nicola PY - 2024 PB - Castelvecchi CY - Rom SN - 979-1-256-14051-0 UR - https://fis.uni-bamberg.de/handle/uniba/96318 LA - ita ER - TY - CHAP TI - Prefazione AU - Vestrucci, Andrea PY - 2024 T2 - Oltre la giustizia. La difesa di una prospettiva pluralistica della vita buona SP - 5-16 PB - Castelvecchi CY - Rom SN - 978-88-6826-507-6 UR - https://fis.uni-bamberg.de/handle/uniba/96322 LA - ita ER - TY - GEN TI - Solving Quantified Modal Logic Problems by Translation to Classical Logics AU - Steen, Alexander AU - Sutcliffe, Geoff AU - Benzmüller, Christoph PY - 2024 PB - arXiv DO - 10.48550/arxiv.2212.09570 UR - https://fis.uni-bamberg.de/handle/uniba/95350 LA - eng ER - TY - JOUR TI - Conditional normative reasoning as a fragment of HOL (Isabelle/HOL dataset) AU - Parent, Xavier AU - Benzmüller, Christoph PY - 2024 JO - Archive of Formal Proofs SN - 2150-914X UR - https://fis.uni-bamberg.de/handle/uniba/94698 LA - eng ER - TY - CPAPER TI - Check News in One Click : NLP-Empowered Pro-Kremlin Propaganda Detection AU - Solopova, Veronika AU - Herman, Viktoriia AU - Benzmüller, Christoph AU - Landgraf, Tim PY - 2024 T2 - Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics : System Demonstrations SP - 44-51 PB - Association for Computational Linguistics CY - St. Julians, Malta UR - https://fis.uni-bamberg.de/handle/uniba/94661 LA - eng AB - Many European citizens become targets of the Kremlin propaganda campaigns, aiming to minimise public support for Ukraine, foster a climate of mistrust and disunity, and shape elections (Meister, 2022). To address this challenge, we developed “Check News in 1 Click”, the first NLP-empowered pro-Kremlin propaganda detection application available in 7 languages, which provides the lay user with feedback on their news, and explains manipulative linguistic features and keywords. We conducted a user study, analysed user entries and models’ behaviour paired with questionnaire answers, and investigated the advantages and disadvantages of the proposed interpretative solution. KW - Propaganda ER - TY - JOUR TI - Who finds the short proof? : Searching for Wormholes in Proof-Space AU - Benzmüller, Christoph PY - 2024 JO - Dagstuhl Reports : Dokumentationen zu Dagstuhl-Seminaren und Dagstuhl-Perspektiven-Workshops VL - 13 IS - 10 SP - 6 PB - Schloss Dagstuhl CY - Wadern SN - 2192-5283 DO - 10.4230/DagRep.13.10.1 UR - https://fis.uni-bamberg.de/handle/uniba/94634 LA - eng AB - In my talk I presented recently published results that had not been communicated at conferences or workshops before: An exploration of Boolos’ Curious Inference using higher-order automated theorem provers (ATPs). Surprisingly, only suitable shorthand notations had to be provided by hand for ATPs to find a short proof. The higher-order lemmas required for constructing a short proof are automatically discovered by the ATPs. Given the observations and suggestions in this paper, full proof automation of Boolos’ and related examples now seems to be within reach of higher-order ATPs KW - short proof ER - TY - JOUR TI - Modelling Value-Oriented Legal Reasoning in LogiKEy AU - Benzmüller, Christoph AU - Fuenmayor, David AU - Lomfeld, Bertram PY - 2024 JO - Logics VL - 2 IS - 1 SP - 31-78 PB - MDPI AG CY - Basel, Switzerland SN - 2813-0405 DO - 10.3390/logics2010003 UR - https://fis.uni-bamberg.de/handle/uniba/94348 LA - eng AB - The logico-pluralist L OGI KE Y knowledge engineering methodology and framework is applied to the modelling of a theory of legal balancing, in which legal knowledge (cases and laws) is encoded by utilising context-dependent value preferences. The theory obtained is then used to formalise, automatically evaluate, and reconstruct illustrative property law cases (involving the appropriation of wild animals) within the Isabelle HOL proof assistant system, illustrating how L OGI KE Y can harness interactive and automated theorem-proving technology to provide a testbed for the development and formal verification of legal domain-specific languages and theories. Modelling value-oriented legal reasoning in that framework, we establish novel bridges between the latest research in knowledge representation and reasoning in non-classical logics, automated theorem proving, and applications in legal reasoning. KW - legal balancing; value-oriented reasoning KW - automated theorem proving KW - logical pluralism KW - proof assistants KW - Isabelle/HOL ER - TY - GEN TI - Check News in One Click : NLP-Empowered Pro-Kremlin Propaganda Detection AU - Solopova, Veronika AU - Herman, Viktoriia AU - Benzmüller, Christoph AU - Landgraf, Tim PY - 2024 SP - 1-8 PB - arXiv DO - 10.48550/arxiv.2401.15717 UR - https://fis.uni-bamberg.de/handle/uniba/93777 LA - eng AB - Many European citizens become targets of the Kremlin propaganda campaigns, aiming to minimise public support for Ukraine, foster a climate of mistrust and disunity, and shape elections (Meister, 2022). To address this challenge, we developed ''Check News in 1 Click'', the first NLP-empowered pro-Kremlin propaganda detection application available in 7 languages, which provides the lay user with feedback on their news, and explains manipulative linguistic features and keywords. We conducted a user study, analysed user entries and models' behaviour paired with questionnaire answers, and investigated the advantages and disadvantages of the proposed interpretative solution. KW - News ER - TY - CPAPER TI - Is HOL (as a metalogic) all we need for flexible normative reasoning? AU - Benzmüller, Christoph PY - 2024 SP - 22 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/93108 LA - eng AB - - KW - HOL ER - TY - GEN TI - PapagAI : Automated Feedback for Reflective Essays AU - Solopova, Veronika AU - Gruszczynski, Adrian AU - Rostom, Eiad AU - Cremer, Fritz AU - Witte, Sascha AU - Zhang, Chengming AU - López, Fernando Ramos AU - Plößl, Lea AU - Hofmann, Florian AU - Romeike, Ralf AU - Gläser-Zikuda, Michaela AU - Benzmüller, Christoph AU - Landgraf, Tim PY - 2024 SP - 1-12 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/93073 LA - eng AB - Written reflective practice is a regular exercise pre-service teachers perform during their higher education. Usually, their lecturers are expected to provide individual feedback, which can be a challenging task to perform on a regular basis. In this paper, we present the first open-source automated feedback tool based on didactic theory and implemented as a hybrid AI system. We describe the components and discuss the advantages and disadvantages of our system compared to the state-of-art generative large language models. The main objective of our work is to enable better learning outcomes for students and to complement the teaching activities of lecturers. KW - Automated feedback KW - Dialogue KW - Hybrid AI KW - NLP ER - TY - JOUR TI - Church’s Type Theory AU - Benzmüller, Christoph AU - Andrews, Peter PY - 2024 JO - Stanford encyclopedia of philosophy CY - Stanford, Calif. SN - 1095-5054 UR - https://fis.uni-bamberg.de/handle/uniba/93057 LA - eng ER - TY - JOUR TI - What are Non-classical Logics and Why Do We Need Them? : An Extended Interview with Dov Gabbay and Leon van der Torre AU - Steen, Alexander AU - Benzmüller, Christoph PY - 2024 JO - Künstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen IS - Online-First PB - Springer CY - Berlin SN - 0933-1875 DO - 10.1007/s13218-023-00824-7 UR - https://fis.uni-bamberg.de/handle/uniba/92592 LA - eng ER - TY - JOUR TI - Mathematical Proof Between Generations AU - Bayer, Jonas AU - Benzmüller, Christoph AU - Buzzard, Kevin AU - David, Marco AU - Lamport, Leslie AU - Matiyasevich, Yuri AU - Paulson, Lawrence AU - Schleicher, Dierk AU - Stock, Benedikt AU - Zelmanov, Efim PY - 2024 JO - Notices of the American Mathematical Society VL - 71 IS - 1 SP - 79-92 SN - 0002-9920 DO - 10.1090/noti2860 UR - https://fis.uni-bamberg.de/handle/uniba/92522 LA - eng ER - TY - JOUR TI - A formalization of abstract argumentation in higher-order logic AU - Steen, Alexander AU - Fuenmayor, David PY - 2024 JO - Journal of Logic and Computation VL - 34 IS - 2 SP - 229-260 PB - Oxford University Press (OUP) CY - Eynsham SN - 0955-792X DO - 10.1093/logcom/exac027 UR - https://fis.uni-bamberg.de/handle/uniba/91044 LA - eng ER - TY - JOUR TI - Who Finds the Short Proof? AU - Benzmüller, Christoph AU - Fuenmayor, David AU - Steen, Alexander AU - Sutcliffe, Geoff PY - 2024 JO - Logic journal of the IGPL VL - 32 IS - 3 SP - 442-464 PB - Oxford University Press CY - Oxford [u.a.] SN - 1368-9894 DO - 10.1093/jigpal/jzac082 UR - https://fis.uni-bamberg.de/handle/uniba/57954 LA - eng ER - TY - CPAPER TI - ARQNL 2022 : Automated Reasoning in Quantified Non-Classical Logics 2022 : 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 ED - Benzmüller, Christoph ED - Otten, Jens PY - 2023 T3 - CEUR-WS UR - https://fis.uni-bamberg.de/handle/uniba/117507 LA - eng ER - TY - GEN TI - Artifact of the Paper "Formally Verified EVM Block-Optimizations" AU - Albert, Elvira AU - Genaim, Samir AU - Kirchner, Daniel AU - Martin-Martin, Enrique PY - 2023 IS - Published April 24, 2023 PB - Zenodo DO - 10.5281/zenodo.7858277 UR - https://fis.uni-bamberg.de/handle/uniba/110285 LA - eng ER - TY - CHAP TI - A Journey Beyond Babel AU - Vestrucci, Andrea PY - 2023 T2 - Beyond Babel: Religion and Linguistic Pluralism SP - 1-12 PB - Springer International Publishing CY - Cham SN - 978-3-031-42126-6 DO - 10.1007/978-3-031-42127-3_1 UR - https://fis.uni-bamberg.de/handle/uniba/96320 LA - eng ER - TY - BOOK TI - Beyond Babel : Religion and Linguistic Pluralism ED - Vestrucci, Andrea PY - 2023 PB - Springer International Publishing CY - Cham T3 - Sophia Studies in Cross-cultural Philosophy of Traditions and Cultures SN - 978-3-031-42127-3 DO - 10.1007/978-3-031-42127-3 UR - https://fis.uni-bamberg.de/handle/uniba/96319 LA - eng ER - TY - CPAPER TI - Is HOL (as a metalogic) all we need for flexible normative reasoning? AU - Benzmüller, Christoph PY - 2023 VL - 13 IS - 4 SP - 22 PB - Schloss Dagstuhl CY - Wadern SN - 2192-5283 DO - 10.4230/dagrep.13.4.1 UR - https://fis.uni-bamberg.de/handle/uniba/91647 LA - eng AB - - KW - HOL ER - TY - CHAP TI - A Simplified Variant of Gödel’s Ontological Argument AU - Benzmüller, Christoph PY - 2023 T2 - Beyond Babel : Religion and Linguistic Pluralism SP - 271-286 PB - Springer International Publishing CY - Cham ET - 1 SN - 978-3-031-42126-6 DO - 10.1007/978-3-031-42127-3_19 UR - https://fis.uni-bamberg.de/handle/uniba/91648 LA - eng ER - TY - CPAPER TI - Formally Verified EVM Block-Optimizations AU - Kirchner, Daniel AU - Genaim, Samir AU - Albert, Elvira AU - Martin-Martin, Enrique PY - 2023 SP - 176-189 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/90216 LA - eng AB - The efficiency and the security of smart contracts are their two fundamental properties, but might come at odds: the use of optimizers to enhance efficiency may introduce bugs and compromise security. Our focus is on EVM (Ethereum Virtual Machine) block-optimizations, which enhance the efficiency of jump-free blocks of opcodes by eliminating, reordering and even changing the original opcodes. We reconcile efficiency and security by providing the verification technology to formally prove the correctness of EVM block-optimizations on smart contracts using the Coq proof assistant. This amounts to the challenging problem of proving semantic equivalence of two blocks of EVM instructions, which is realized by means of three novel Coq components: a symbolic execution engine which can execute an EVM block and produce a symbolic state; a number of simplification lemmas which transform a symbolic state into an equivalent one; and a checker of symbolic states to compare the symbolic states produced for the two EVM blocks under comparison. KW - Coq KW - Ethereum Virtual Machine KW - Smart Contracts KW - Optimization KW - Theorem Proving ER - TY - CPAPER TI - Theorem Proving in Dependently-Typed Higher-Order Logic AU - Rothgang, Colin AU - Rabe, Florian AU - Benzmüller, Christoph PY - 2023 SP - 438-455 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture Notes in Computer Science UR - https://fis.uni-bamberg.de/handle/uniba/91274 LA - eng AB - Higher-order logic HOL offers a very simple syntax and semantics for representing and reasoning about typed data structures. But its type system lacks advanced features where types may depend on terms. Dependent type theory offers such a rich type system, but has rather substantial conceptual differences to HOL, as well as comparatively poor proof automation support. We introduce a dependently-typed extension DHOL of HOL that retains the style and conceptual framework of HOL. Moreover, we build a translation from DHOL to HOL and implement it as a preprocessor to a HOL theorem prover, thereby obtaining a theorem prover for DHOL. KW - Dependently-Typed Higher-Order Logic ER - TY - GEN TI - Normative Conditional Reasoning as a Fragment of HOL AU - Parent, Xavier AU - Benzmüller, Christoph PY - 2023 SP - 1-22 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/91043 LA - eng AB - We report some results regarding the mechanization of normative (preference-based) conditional reasoning. Our focus is on Aqvist's system E for conditional obligation (and its extensions). Our mechanization is achieved via a shallow semantical embedding in Isabelle/HOL. We consider two possible uses of the framework. The first one is as a tool for meta-reasoning about the considered logic. We employ it for the automated verification of deontic correspondences (broadly conceived) and related matters, analogous to what has been previously achieved for the modal logic cube. The second use is as a tool for assessing ethical arguments. We provide a computer encoding of a well-known paradox in population ethics, Parfit's repugnant conclusion. Whether the presented encoding increases or decreases the attractiveness and persuasiveness of the repugnant conclusion is a question we would like to pass on to philosophy and ethics. KW - Conditional obligation KW - betterness KW - Isabelle/HOL KW - automated theorem proving KW - population ethics KW - mere addition/repugnant conclusion paradox ER - TY - CPAPER TI - PapagAI : Automated Feedback for Reflective Essays AU - Solopova, Veronika AU - Rostom, Eiad AU - Cremer, Fritz AU - Gruszczynski, Adrian AU - Witte, Sascha AU - Zhang, Chengming AU - López, Fernando Ramos AU - Plößl. Lea AU - Romeike, Ralf AU - Gläser-Zikuda, Michaela AU - Hofmann, Florian AU - Landgraf, Tim AU - Benzmüller, Christoph PY - 2023 T2 - KI 2023: Advances in Artificial Intelligence : 46th German Conference on AI, Berlin, Germany, September 26–29, 2023 ; Proceedings SP - 198-206 PB - Springer CY - Cham SN - 978-3-031-42607-0 DO - 10.1007/978-3-031-42608-7_16 UR - https://fis.uni-bamberg.de/handle/uniba/90982 LA - eng ER - TY - CPAPER TI - The Evolution of Pro-Kremlin Propaganda From a Machine Learning and Linguistics Perspective AU - Solopova, Veronika AU - Benzmüller, Christoph AU - Landgraf, Tim PY - 2023 SP - 40-48 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/90475 LA - eng AB - In the Russo-Ukrainian war, propaganda is produced by Russian state-run news outlets for both international and domestic audiences. Its content and form evolve and change with time as the war continues. This constitutes a challenge to content moderation tools based on machine learning when the data used for training and the current news start to differ significantly. In this follow-up study, we evaluate our previous BERT and SVM models that classify Pro-Kremlin propaganda from a Pro-Western stance, trained on the data from news articles and telegram posts at the start of 2022, on the new 2023 subset. We examine both classifiers’ errors and perform a comparative analysis of these subsets to investigate which changes in narratives provoke drops in performance. KW - Propaganda ER - TY - CPAPER TI - Theorem Proving in Dependently-Typed Higher-Order Logic AU - Rothgang, Colin AU - Rabe, Florian AU - Benzmüller, Christoph PY - 2023 T2 - Automated Deduction – CADE 29 : 29th International Conference on Automated Deduction, Rome, Italy, July 1–4, 2023, Proceedings SP - 438-455 PB - Springer Nature Switzerland CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-031-38498-1 DO - 10.1007/978-3-031-38499-8_25 UR - https://fis.uni-bamberg.de/handle/uniba/90500 LA - eng AB - Higher-order logic HOL offers a very simple syntax and semantics for representing and reasoning about typed data structures. But its type system lacks advanced features where types may depend on terms. Dependent type theory offers such a rich type system, but has rather substantial conceptual differences to HOL, as well as comparatively poor proof automation support. We introduce a dependently-typed extension DHOL of HOL that retains the style and conceptual framework of HOL. Moreover, we build a translation from DHOL to HOL and implement it as a preprocessor to a HOL theorem prover, thereby obtaining a theorem prover for DHOL. KW - Dependently-Typed Higher-Order Logic ER - TY - CPAPER TI - Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation AU - Bayer, Jonas AU - Gonus, Alexey AU - Benzmüller, Christoph AU - Scott, Dana S. PY - 2023 T2 - Intelligent Computer Mathematics : 16th International Conference, CICM 2023, Cambridge, UK, , September 5–8, 2023 Proceedings SP - 69-83 PB - Springer Nature Switzerland CY - Cham T3 - Lecture Notes in Artificial Intelligence SN - 9783031427527 DO - 10.1007/978-3-031-42753-4_5 UR - https://fis.uni-bamberg.de/handle/uniba/90343 LA - eng ER - TY - JOUR TI - Semantical investigations on non-classical logics with recovery operators: negation AU - Fuenmayor, David PY - 2023 JO - Logic Journal of the IGPL IS - Online-First SP - 1-42 PB - Oxford University Press CY - Oxford SN - 1367-0751 DO - 10.1093/jigpal/jzad013 UR - https://fis.uni-bamberg.de/handle/uniba/90304 LA - eng ER - TY - BOOK TI - On Gödel and the Nonexistence of Time : Gödel und die Nichtexistenz der Zeit ; Kurt Gödel essay competition 2021 : Kurt-Gödel-Preis 2021 ED - Passon, Oliver ED - Benzmüller, Christoph ED - Falkenburg, Brigitte PY - 2023 PB - Springer Spektrum Berlin CY - Heidelberg ET - 1 SN - 978-3-662-67044-6 DO - 10.1007/978-3-662-67045-3 UR - https://fis.uni-bamberg.de/handle/uniba/90223 LA - eng ER - TY - CHAP TI - Solving Modal Logic Problems by Translation to Higher-Order Logic AU - Steen, Alexander AU - Sutcliffe, Geoff AU - Scholl, Tobias AU - Benzmüller, Christoph PY - 2023 T2 - Logic and Argumentation : 5th International Conference, CLAR 2023, Hangzhou, China, September 10-12, 2023 ; Proceedings SP - 25-43 PB - Springer Nature Switzerland CY - Cham SN - 978-3-031-40874-8 DO - 10.1007/978-3-031-40875-5_3 UR - https://fis.uni-bamberg.de/handle/uniba/90114 LA - eng ER - TY - GEN TI - Normative Conditional Reasoning as a Fragment of HOL AU - Parent, Xavier AU - Benzmüller, Christoph PY - 2023 SP - 1-22 PB - arXiv CY - Online DO - 10.48550/arxiv.2308.10686 UR - https://fis.uni-bamberg.de/handle/uniba/90106 LA - eng AB - We report some results regarding the mechanization of normative (preference-based) conditional reasoning. Our focus is on Aqvist's system E for conditional obligation (and its extensions). Our mechanization is achieved via a shallow semantical embedding in Isabelle/HOL. We consider two possible uses of the framework. The first one is as a tool for meta-reasoning about the considered logic. We employ it for the automated verification of deontic correspondences (broadly conceived) and related matters, analogous to what has been previously achieved for the modal logic cube. The second use is as a tool for assessing ethical arguments. We provide a computer encoding of a well-known paradox in population ethics, Parfit's repugnant conclusion. Whether the presented encoding increases or decreases the attractiveness and persuasiveness of the repugnant conclusion is a question we would like to pass on to philosophy and ethics. KW - Conditional obligation KW - betterness KW - Isabelle/HOL KW - automated theorem proving KW - population ethics KW - mere addition/repugnant conclusion paradox ER - TY - CPAPER TI - The Evolution of Pro-Kremlin Propaganda From a Machine Learning and Linguistics Perspective AU - Solopova, Veronika AU - Benzmüller, Christoph AU - Landgraf, Tim PY - 2023 T2 - Proceedings of the Second Ukrainian Natural Language Processing Workshop (UNLP 2023) SP - 40-48 CY - Dubrovnik SN - 978-1-959429-52-4 DO - 10.18653/v1/2023.unlp-1.5 UR - https://fis.uni-bamberg.de/handle/uniba/59601 LA - eng AB - In the Russo-Ukrainian war, propaganda is produced by Russian state-run news outlets for both international and domestic audiences. Its content and form evolve and change with time as the war continues. This constitutes a challenge to content moderation tools based on machine learning when the data used for training and the current news start to differ significantly. In this follow-up study, we evaluate our previous BERT and SVM models that classify Pro-Kremlin propaganda from a Pro-Western stance, trained on the data from news articles and telegram posts at the start of 2022, on the new 2023 subset. We examine both classifiers’ errors and perform a comparative analysis of these subsets to investigate which changes in narratives provoke drops in performance. KW - Propaganda ER - TY - CPAPER TI - Formally Verified EVM Block-Optimizations AU - Kirchner, Daniel AU - Genaim, Samir AU - Albert, Elvira AU - Martin-Martin, Enrique PY - 2023 T2 - Computer Aided Verification : 35th International Conference, CAV 2023, Paris, France, July 17–22, 2023, Proceedings, Part III SP - 176-189 PB - Springer Nature Switzerland CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-031-37709-9 DO - 10.1007/978-3-031-37709-9_9 UR - https://fis.uni-bamberg.de/handle/uniba/89789 LA - eng AB - The efficiency and the security of smart contracts are their two fundamental properties, but might come at odds: the use of optimizers to enhance efficiency may introduce bugs and compromise security. Our focus is on EVM (Ethereum Virtual Machine) block-optimizations, which enhance the efficiency of jump-free blocks of opcodes by eliminating, reordering and even changing the original opcodes. We reconcile efficiency and security by providing the verification technology to formally prove the correctness of EVM block-optimizations on smart contracts using the Coq proof assistant. This amounts to the challenging problem of proving semantic equivalence of two blocks of EVM instructions, which is realized by means of three novel Coq components: a symbolic execution engine which can execute an EVM block and produce a symbolic state; a number of simplification lemmas which transform a symbolic state into an equivalent one; and a checker of symbolic states to compare the symbolic states produced for the two EVM blocks under comparison. KW - Coq KW - Ethereum Virtual Machine KW - Smart Contracts KW - Optimization KW - Theorem Proving ER - TY - GEN TI - PapagAI : Automated Feedback for Reflective Essays AU - Solopova, Veronika AU - Gruszczynski, Adrian AU - Rostom, Eiad AU - Cremer, Fritz AU - Witte, Sascha AU - Zhang, Chengming AU - López, Fernando Ramos AU - Plößl, Lea AU - Hofmann, Florian AU - Romeike, Ralf AU - Gläser-Zikuda, Michaela AU - Benzmüller, Christoph AU - Landgraf, Tim PY - 2023 SP - 1-12 PB - arXiv DO - 10.48550/arxiv.2307.07523 UR - https://fis.uni-bamberg.de/handle/uniba/89646 LA - eng AB - Written reflective practice is a regular exercise pre-service teachers perform during their higher education. Usually, their lecturers are expected to provide individual feedback, which can be a challenging task to perform on a regular basis. In this paper, we present the first open-source automated feedback tool based on didactic theory and implemented as a hybrid AI system. We describe the components and discuss the advantages and disadvantages of our system compared to the state-of-art generative large language models. The main objective of our work is to enable better learning outcomes for students and to complement the teaching activities of lecturers. KW - Automated feedback KW - Dialogue KW - Hybrid AI KW - NLP ER - TY - CPAPER TI - Mathematical Proof Assistants for Teaching Logic : the LogiKEy Methodology AU - Benzmüller, Christoph AU - Fuenmayor, David PY - 2023 T2 - Book of Abstracts : International Congress Tools for Teaching Logic V SP - 1-3 CY - Madrid DO - 10.20378/irb-59552 UR - https://fis.uni-bamberg.de/handle/uniba/59552 LA - eng AB - - KW - AI KW - LogiKEy ER - TY - GEN TI - Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation AU - Benzmüller, Christoph AU - Bayer, Jonas AU - Gonus, Aleksey AU - Scott, Dana S. PY - 2023 SP - 1-16 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/59850 LA - eng AB - This paper presents meta-logical investigations based on category theory using the proof assistant Isabelle/HOL. We demonstrate the potential of a free logic based shallow semantic embedding of category theory by providing a formalization of the notion of elementary topoi. Additionally, we formalize symmetrical monoidal closed categories expressing the denotational semantic model of intuitionistic multiplicative linear logic. Next to these meta-logical-investigations, we contribute to building an Isabelle category theory library, with a focus on ease of use in the formalization beyond category theory itself. This work paves the way for future formalizations based on category theory and demonstrates the power of automated reasoning in investigating meta-logical questions. KW - Formalization of mathematics KW - Category theory KW - Proof assistants KW - Formal methods KW - Shallow embeddings ER - TY - GEN TI - Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation AU - Benzmüller, Christoph AU - Bayer, Jonas AU - Gonus, Aleksey AU - Scott, Dana S. PY - 2023 SP - 1-16 PB - arXiv DO - 10.48550/ARXIV.2306.09074 UR - https://fis.uni-bamberg.de/handle/uniba/59804 LA - eng AB - This paper presents meta-logical investigations based on category theory using the proof assistant Isabelle/HOL. We demonstrate the potential of a free logic based shallow semantic embedding of category theory by providing a formalization of the notion of elementary topoi. Additionally, we formalize symmetrical monoidal closed categories expressing the denotational semantic model of intuitionistic multiplicative linear logic. Next to these meta-logical-investigations, we contribute to building an Isabelle category theory library, with a focus on ease of use in the formalization beyond category theory itself. This work paves the way for future formalizations based on category theory and demonstrates the power of automated reasoning in investigating meta-logical questions. KW - Formalization of mathematics KW - Category theory KW - Proof assistants KW - Formal methods KW - Shallow embeddings ER - TY - CPAPER TI - Reasonable, Trusted AI through Symbolic Ethico-legal Control and Reflection? (Keynote Abstract) AU - Benzmüller, Christoph PY - 2023 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/59671 LA - eng AB - - KW - artificial intelligence KW - AI ER - TY - JOUR TI - Automated Multilingual Detection of Pro-Kremlin Propaganda in Newspapers and Telegram Posts AU - Benzmüller, Christoph AU - Solopova, Veronika AU - Popescu, Oana-Iuliana AU - Landgraf, Tim PY - 2023 SP - 5-14 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/59658 LA - eng AB - The full-scale conflict between the Russian Federation and Ukraine generated an unprecedented amount of news articles and social media data reflecting opposing ideologies and narratives. These polarized campaigns have led to mutual accusations of misinformation and fake news, shaping an atmosphere of confusion and mistrust for readers worldwide. This study analyses how the media affected and mirrored public opinion during the first month of the war using news articles and Telegram news channels in Ukrainian, Russian, Romanian, French and English. We propose and compare two methods of multilingual automated pro-Kremlin propaganda identification, based on Transformers and linguistic features. We analyse the advantages and disadvantages of both methods, their adaptability to new genres and languages, and ethical considerations of their usage for content moderation. With this work, we aim to lay the foundation for further development of moderation tools tailored to the current conflict. KW - Propaganda KW - Fake news KW - NLP KW - Kremlin KW - Ukraine KW - Automated Content Moderation ER - TY - CPAPER TI - Reasonable, Trusted AI through Symbolic Ethico-legal Control and Reflection? (Keynote Abstract) AU - Benzmüller, Christoph PY - 2023 T2 - Proceedings of FLAIRS-36, May 14-17, 2023, Clearwater Beach, FL VL - 2023 IS - 36 PB - LibraryPress@UF CY - Florida T3 - The Florida Artificial Interlligence Research Society DO - 10.32473/flairs.36 UR - https://fis.uni-bamberg.de/handle/uniba/59598 LA - eng AB - - KW - artificial intelligence KW - AI ER - TY - GEN TI - Theorem Proving in Dependently-Typed Higher-Order Logic : Extended Preprint AU - Rothgang, Colin AU - Rabe, Florian AU - Benzmüller, Christoph PY - 2023 IS - arXiv:2305.15382 PB - arXiv DO - 10.48550/ARXIV.2305.15382 UR - https://fis.uni-bamberg.de/handle/uniba/59544 LA - eng ER - TY - GEN TI - Journal of logic and computation ED - Baroni, Pietro ED - Benzmüller, Christoph ED - Wáng, Yì PY - 2023 VL - 33 IS - 2, Special Issue: Logic and Argumentation PB - Oxford University Press CY - Eynsham, Oxford SN - 0955-792X UR - https://fis.uni-bamberg.de/handle/uniba/58579 LA - eng ER - TY - JOUR TI - Automated Multilingual Detection of Pro-Kremlin Propaganda in Newspapers and Telegram Posts AU - Benzmüller, Christoph AU - Solopova, Veronika AU - Landgraf, Tim AU - Popescu, Oana-Iuliana PY - 2023 JO - Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie VL - 25 IS - 1 PB - Springer CY - Berlin SN - 1610-1995 DO - 10.1007/s13222-023-00437-2 UR - https://fis.uni-bamberg.de/handle/uniba/58575 LA - eng AB - The full-scale conflict between the Russian Federation and Ukraine generated an unprecedented amount of news articles and social media data reflecting opposing ideologies and narratives. These polarized campaigns have led to mutual accusations of misinformation and fake news, shaping an atmosphere of confusion and mistrust for readers worldwide. This study analyses how the media affected and mirrored public opinion during the first month of the war using news articles and Telegram news channels in Ukrainian, Russian, Romanian, French and English. We propose and compare two methods of multilingual automated pro-Kremlin propaganda identification, based on Transformers and linguistic features. We analyse the advantages and disadvantages of both methods, their adaptability to new genres and languages, and ethical considerations of their usage for content moderation. With this work, we aim to lay the foundation for further development of moderation tools tailored to the current conflict. KW - Propaganda KW - Fake news KW - NLP KW - Kremlin KW - Ukraine KW - Automated Content Moderation ER - TY - GEN TI - Automated multilingual detection of Pro-Kremlin propaganda in newspapers and Telegram posts AU - Solopova, Veronika AU - Popescu, Oana-Iuliana AU - Benzmüller, Christoph AU - Landgraf, Tim PY - 2023 PB - arXiv DO - 10.48550/ARXIV.2301.10604 UR - https://fis.uni-bamberg.de/handle/uniba/57979 LA - eng ER - TY - JOUR TI - Preface: Special Issue on Logic and Argumentation AU - Baroni, Pietro AU - Benzmüller, Christoph AU - N Wáng, Yì PY - 2023 JO - Journal of logic and computation VL - 33 IS - 2 SP - 189–191 PB - Oxford Univ. Press CY - Eynsham, Oxford SN - 1465-363X DO - 10.1093/logcom/exac091 UR - https://fis.uni-bamberg.de/handle/uniba/57756 LA - eng ER - TY - GEN TI - CEUR Workshop Proceedings ED - Benzmüller, Christoph ED - Otten, Jens PY - 2023 IS - 3326, ARQNL 2022 Automated Reasoning in Quantified Non-Classical Logics 2022 : 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) PB - RWTH Aachen CY - Aachen SN - 1613-0073 UR - https://fis.uni-bamberg.de/handle/uniba/57614 LA - eng ER - TY - CPAPER TI - Automated Verification of Deontic Correspondences in Isabelle/HOL : First Results AU - Parent, Xavier AU - Benzmüller, Christoph PY - 2023 IS - 3326, 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) SP - 92-108 PB - RWTH Aachen CY - Aachen, Germany SN - 1613-0073 UR - https://fis.uni-bamberg.de/handle/uniba/57613 LA - eng ER - TY - JOUR TI - Artificial Intelligence and God´s Existence : Connecting Philosophy of Religion and Computation AU - Vestrucci, Andrea PY - 2023 SP - 1000-1018 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/57530 LA - eng AB - The exploration of metaphysical arguments in the symbolic AI environment provides clarification and raises unexpected questions about notions in philosophy of religion and theology. Recent attempts to apply automatic theorem prover technology to Anselm's ontological argument have led to a simplification of the argument. This computationally discovered simplification has given rise to logical observations. The article assesses one of these observations: the application of the diagonal method (in Cantor's version) to Anselm's argument. The evaluation of the applications of theorem provers to metaphysical and theological arguments contributes to the following topics in philosophy of religion: the limits of natural theology, the relationship between religion and STEM, and theology's scientificity. KW - artificial intelligence and religion KW - artificial intelligence and theology KW - computational metaphysics KW - diagonal argument KW - formal theology KW - ontological argument KW - theology as science KW - religion and technology ER - TY - JOUR TI - Introduction: Five steps toward a religion-AI dialogue AU - Vestrucci, Andrea PY - 2023 SP - 933-937 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/57528 LA - eng AB - This introduction to the thematic section of Zygon: Journal of Religion and Science on “Artificial Intelligence and Religion: Recent Advances and Future Directions” outlines the five articles by dividing them into two groups: the three that analyze the impact of recent advances in subsymbolic artificial intelligence (AI) on religion and theology, and the two that explore theological concepts in symbolic AI environments. These five articles are five steps toward a strong, deep, and interdisciplinary dialogue between the research in religion and the research in AI. KW - artificial intelligence KW - artificial intelligence and religion KW - artificial intelligence and theology KW - imago Dei KW - subsymbolic artificial KW - intelligence; symbolic artificial intelligence KW - technology and religion ER - TY - JOUR TI - Automating public announcement logic with relativized common knowledge as a fragment of HOL in LogiKEy AU - Benzmüller, Christoph AU - Reiche, Sebastian PY - 2023 JO - Journal of Logic and Computation VL - 33 IS - 6 SP - 1243–1269 PB - Oxford Univ. Press CY - Eynsham, Oxford SN - 1465-363X DO - 10.1093/logcom/exac029 UR - https://fis.uni-bamberg.de/handle/uniba/54497 LA - eng AB - A shallow semantical embedding for public announcement logic with relativized common knowledge is presented. This embedding enables the first-time automation of this logic with off-the-shelf theorem provers for classical higher-order logic. It is demonstrated (i) how meta-theoretical studies can be automated this way, and (ii) how non-trivial reasoning in the target logic (public announcement logic), required e.g. to obtain a convincing encoding and automation of the wise men puzzle, can be realized. Key to the presented semantical embedding is that evaluation domains are mod- eled explicitly and treated as an additional parameter in the encodings of the con- stituents of the embedded target logic; in previous related works, e.g. on the em- bedding of normal modal logics, evaluation domains were implicitly shared between meta-logic and target logic. The work presented in this article constitutes an important addition to the pluralist LogiKEy knowledge engineering methodology, which enables experimen- tation with logics and their combinations, with general and domain knowledge, and with concrete use cases — all at the same time. KW - Public announcement logic; Relativized common knowledge; Semantical embedding; Higher-order logic; Proof automation ER - TY - BOOK TI - Philosophical Schools after 1950 : International Conference: Warsaw, May 9-10, 2022 AU - Vestrucci, Andrea AU - Łukomska, Agata AU - Łapiński, Filip AU - Rujević, Goran AU - Trepczyński, Marcin PY - 2022 PB - Wydział Filozofii Uniwersytetu Warszawskiego CY - Warsaw UR - https://fis.uni-bamberg.de/handle/uniba/96321 LA - eng ER - TY - CPAPER TI - Bridging Between LegalRuleML and TPTP for Automated Normative Reasoning AU - Steen, Alexander AU - Fuenmayor, David PY - 2022 SP - 244-260 PB - Springer International Publishing CY - Berlin SN - 978-3-031-21540-7 DO - 10.1007/978-3-031-21541-4_16 UR - https://fis.uni-bamberg.de/handle/uniba/91146 LA - eng ER - TY - JOUR TI - Abstract Object Theory AU - Kirchner, Daniel PY - 2022 JO - Archive of Formal Proofs SP - 392 SN - 2150-914x UR - https://fis.uni-bamberg.de/handle/uniba/57615 LA - eng ER - TY - JOUR TI - Automation of Boolos' Curious Inference in Isabelle/HOL AU - Benzmüller, Christoph AU - Fuenmayor, David AU - Steen, Alexander AU - Sutcliffe, Geoff PY - 2022 JO - Archive of Formal Proofs SN - 2150-914x UR - https://fis.uni-bamberg.de/handle/uniba/57579 LA - eng ER - TY - THES TI - Computer-Verified Foundations of Metaphysics and an Ontology of Natural Numbers in Isabelle/HOL AU - Kirchner, Daniel PY - 2022 PB - Refubium - Repositorium der Freien Universität Berlin CY - Berlin DO - 10.17169/refubium-35141 UR - https://fis.uni-bamberg.de/handle/uniba/57511 LA - eng ER - TY - GEN TI - Solving QMLTP Problems by Translation to Higher-order Logic AU - Steen, Alexander AU - Sutcliffe, Geoff AU - Gleißner, Tobias AU - Benzmüller, Christoph PY - 2022 PB - arXiv DO - 10.48550/ARXIV.2212.09570 UR - https://fis.uni-bamberg.de/handle/uniba/57440 LA - eng ER - TY - CHAP TI - Studies in Computational Metaphysics : Results of an Interdisciplinary Research Project AU - Benzmüller, Christoph PY - 2022 T2 - Tópicos em História e Filosofia da Computação SP - 129-160 PB - University of Campinas (UNICAMP) CY - Campinas, Brasilien SN - 978-65-88097-04-5 UR - https://fis.uni-bamberg.de/handle/uniba/57398 LA - eng ER - TY - JOUR TI - Editor's Note AU - Vestrucci, Andrea AU - Burgos, Daniel AU - Oviedo, Lluis AU - Griffiths, Dai PY - 2022 SP - 4-5 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/57411 LA - eng AB - Nicht verfügbar Not available KW - artificial intelligence (AI) KW - spirituality KW - machines KW - automation ER - TY - JOUR TI - Deontic-doxastic belief revision and linear system model AU - Vestrucci, Andrea PY - 2022 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/57349 LA - eng AB - Nicht verfügbar Not available KW - belief revision KW - Dynamic Epistemic Logic KW - AGM theory KW - doxastic voluntarism KW - deontic KW - logic KW - doxastic logic KW - belief models KW - logic of belief revision ER - TY - GEN TI - Semantical Investigations on Non-classical Logics with Recovery Operators: Negation AU - Fuenmayor, David PY - 2022 SP - 1-44 PB - arXiv DO - 10.48550/ARXIV.2104.04284 UR - https://fis.uni-bamberg.de/handle/uniba/57243 LA - eng ER - TY - JOUR TI - Deontic-doxastic belief revision and linear system model AU - Vestrucci, Andrea PY - 2022 JO - Frontiers in Psychology VL - 13 SP - 1-5 SN - 1664-1078 DO - 10.3389/fpsyg.2022.948330 UR - https://fis.uni-bamberg.de/handle/uniba/56867 LA - eng AB - Nicht verfügbar Not available KW - belief revision KW - Dynamic Epistemic Logic KW - AGM theory KW - doxastic voluntarism KW - deontic KW - logic KW - doxastic logic KW - belief models KW - logic of belief revision ER - TY - JOUR TI - Artificial Intelligence and God´s Existence : Connecting Philosophy of Religion and Computation AU - Vestrucci, Andrea PY - 2022 JO - Zygon : journal of religion & science VL - 57 IS - 4 SP - 1000-1018 PB - Wiley-Blackwell CY - Oxford SN - 1467-9744 DO - 10.1111/zygo.12829 UR - https://fis.uni-bamberg.de/handle/uniba/56866 LA - eng AB - The exploration of metaphysical arguments in the symbolic AI environment provides clarification and raises unexpected questions about notions in philosophy of religion and theology. Recent attempts to apply automatic theorem prover technology to Anselm's ontological argument have led to a simplification of the argument. This computationally discovered simplification has given rise to logical observations. The article assesses one of these observations: the application of the diagonal method (in Cantor's version) to Anselm's argument. The evaluation of the applications of theorem provers to metaphysical and theological arguments contributes to the following topics in philosophy of religion: the limits of natural theology, the relationship between religion and STEM, and theology's scientificity. KW - artificial intelligence and religion KW - artificial intelligence and theology KW - computational metaphysics KW - diagonal argument KW - formal theology KW - ontological argument KW - theology as science KW - religion and technology ER - TY - JOUR TI - Introduction: Five steps toward a religion-AI dialogue AU - Vestrucci, Andrea PY - 2022 JO - Zygon : journal of religion & science VL - 57 IS - 4 SP - 933-937 PB - Wiley-Blackwell CY - Oxford SN - 1467-9744 DO - 10.1111/zygo.12828 UR - https://fis.uni-bamberg.de/handle/uniba/56865 LA - eng AB - This introduction to the thematic section of Zygon: Journal of Religion and Science on “Artificial Intelligence and Religion: Recent Advances and Future Directions” outlines the five articles by dividing them into two groups: the three that analyze the impact of recent advances in subsymbolic artificial intelligence (AI) on religion and theology, and the two that explore theological concepts in symbolic AI environments. These five articles are five steps toward a strong, deep, and interdisciplinary dialogue between the research in religion and the research in AI. KW - artificial intelligence KW - artificial intelligence and religion KW - artificial intelligence and theology KW - imago Dei KW - subsymbolic artificial KW - intelligence; symbolic artificial intelligence KW - technology and religion ER - TY - JOUR TI - On Thought Experiments, Theology, and Mathematical Platonism AU - Fehige, Yiftach AU - Vestrucci, Andrea PY - 2022 JO - Axiomathes : an international journal in ontology and cognitive systems VL - 32 IS - S1 SP - 1-12 PB - Springer Science + Business Media B.V CY - Dordrecht [u.a.] SN - 1572-8390 DO - 10.1007/s10516-022-09627-1 UR - https://fis.uni-bamberg.de/handle/uniba/54512 LA - eng ER - TY - JOUR TI - Symbolic AI and Gödel's Ontological Argument AU - Benzmüller, Christoph PY - 2022 SP - 1-10 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/54793 LA - eng AB - Over the past decade, variants of Gödel's ontological arguments have been critically examined using modern symbolic AI technology. Computers have unearthed new insights about them and even contributed to the exploration of new, simplified variants of the argument, which now need to be further investigated by theologians and philosophers. In this article, I provide a brief, informal overview of these contributions and engage in a discussion of the possible future role of AI technology for the rigorous assessment of arguments in theology and philosophy. KW - artificial intelligence KW - metaphysics KW - ontology KW - information KW - interdisciplinarity ER - TY - GEN TI - Mathematical Proof Between Generations AU - Bayer, Jonas AU - Benzmüller, Christoph AU - Buzzard, Kevin AU - David, Marco AU - Lamport, Leslie AU - Matiyasevich, Yuri AU - Paulson, Lawrence AU - Schleicher, Dierk AU - Stock, Benedikt AU - Zelmanov, Efim PY - 2022 SP - 1-17 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/54593 LA - eng AB - A proof is one of the most important concepts of mathematics. However, there is a striking difference between how a proof is defined in theory and how it is used in practice. This puts the unique status of mathematics as exact science into peril. Now may be the time to reconcile theory and practice, i.e. precision and intuition, through the advent of computer proof assistants. For the most time this has been a topic for experts in specialized communities. However, mathematical proofs have become increasingly sophisticated, stretching the boundaries of what is humanly comprehensible, so that leading mathematicians have asked for formal verification of their proofs. At the same time, major theorems in mathematics have recently been computer-verified by people from outside of these communities, even by beginning students. This article investigates the gap between the different definitions of a proof and possibilities to build bridges. It is written as a polemic or a collage by different members of the communities in mathematics and computer science at different stages of their careers, challenging well-known preconceptions and exploring new perspectives. KW - mathematical proof ER - TY - CPAPER TI - Formalising Basic Topology for Computational Logic in Simple Type Theory AU - Fuenmayor, David AU - Serrano Suárez, Fabián Fernando PY - 2022 T2 - Intelligent Computer Mathematics : 15th International Conference, CICM 2022, Tbilisi, Georgia, September 19–23, 2022, Proceedings SP - 56-74 PB - Springer CY - Cham T3 - Lecture Notes in Computer Science SN - 978-3-031-16681-5 DO - 10.1007/978-3-031-16681-5_4 UR - https://fis.uni-bamberg.de/handle/uniba/55968 LA - eng ER - TY - GEN TI - Automating Public Announcement Logic with Relativized Common Knowledge as a Fragment of HOL in LogiKEy AU - Benzmüller, Christoph AU - Reiche, Sebastian PY - 2022 SP - 1-28 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/55559 LA - eng AB - A shallow semantical embedding for public announcement logic with relativized common knowledge is presented. This embedding enables the first-time automation of this logic with off-the-shelf theorem provers for classical higher-order logic. It is demonstrated (i) how meta-theoretical studies can be automated this way, and (ii) how non-trivial reasoning in the target logic (public announcement logic), required e.g. to obtain a convincing encoding and automation of the wise men puzzle, can be realized. Key to the presented semantical embedding is that evaluation domains are mod- eled explicitly and treated as an additional parameter in the encodings of the con- stituents of the embedded target logic; in previous related works, e.g. on the em- bedding of normal modal logics, evaluation domains were implicitly shared between meta-logic and target logic. The work presented in this article constitutes an important addition to the pluralist LogiKEy knowledge engineering methodology, which enables experimen- tation with logics and their combinations, with general and domain knowledge, and with concrete use cases — all at the same time. KW - Public announcement logic; Relativized common knowledge; Semantical embedding; Higher-order logic; Proof automation ER - TY - GEN TI - Who Finds the Short Proof? : an Exploration of Variants of Boolos' Curious Inference using Higher-order Automated Theorem Provers AU - Benzmüller, Christoph AU - Fuenmayor, David AU - Steen, Alexander AU - Sutcliffe, Geoff PY - 2022 PB - arXiv DO - 10.48550/ARXIV.2208.06879 UR - https://fis.uni-bamberg.de/handle/uniba/55558 LA - eng ER - TY - CPAPER TI - Automated Reasoning in Non-classical Logics in the TPTP World AU - Steen, Alexander AU - Fuenmayor, David AU - Gleißner, Tobias AU - Sutcliffe, Geoff AU - Benzmüller, Christoph PY - 2022 T2 - 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 PB - CEUR Workshop Proceedings UR - https://fis.uni-bamberg.de/handle/uniba/55555 LA - eng ER - TY - JOUR TI - Symbolic AI and Gödel's Ontological Argument AU - Benzmüller, Christoph PY - 2022 JO - Zygon : Journal of Religion and Science VL - 57 IS - 4 PB - John Wiley & Sons, Inc SN - 1467-9744 DO - 10.1111/zygo.12830 UR - https://fis.uni-bamberg.de/handle/uniba/55552 LA - eng AB - Over the past decade, variants of Gödel's ontological arguments have been critically examined using modern symbolic AI technology. Computers have unearthed new insights about them and even contributed to the exploration of new, simplified variants of the argument, which now need to be further investigated by theologians and philosophers. In this article, I provide a brief, informal overview of these contributions and engage in a discussion of the possible future role of AI technology for the rigorous assessment of arguments in theology and philosophy. KW - artificial intelligence KW - metaphysics KW - ontology KW - information KW - interdisciplinarity ER - TY - CPAPER TI - Higher-order Logic as a Lingua Franca for Logico-Pluralist Argumentation AU - Fuenmayor, David AU - Benzmüller, Christoph PY - 2022 T2 - Logics for New-Generation AI : Second International Workshop. 10-12 June 2022, Zhuhai SP - 83-94 PB - College Publications CY - London SN - 978-1-84890-406-4 UR - https://fis.uni-bamberg.de/handle/uniba/54851 LA - eng ER - TY - JOUR TI - Collaborative Speculations on Future Themes for Participatory Design in Germany AU - Mucha, Henrik AU - Correia de Barros, Ana AU - Benjamin, Jesse Josua AU - Benzmüller, Christoph AU - Bischof, Andreas AU - Buchmüller, Sandra AU - de Carvalho, Alexandra AU - Dhungel, Anna-Katharina AU - Draude, Claude AU - Fleck, Marc-Julian AU - Jarke, Juliane AU - Klein, Stefanie AU - Kortekaas, Caroline AU - Kurze, Albrecht AU - Linke, Diane AU - Maas, Franzisca AU - Marsden, Nicola AU - Melo, Ricardo AU - Michel, Susanne AU - Müller-Birn, Claudia AU - Pröbster, Monika AU - Rießenberger, Katja Antonia AU - Schäfer, Mirko Tobias AU - Sörries, Peter AU - Stilke, Julia AU - Volkmann, Torben AU - Weibert, Anne AU - Weinhold, Wilhelm AU - Wolf, Sara AU - Zorn, Isabel AU - Heidt, Michael AU - Berger, Arne PY - 2022 JO - i-com : journal of interactive media VL - 21 IS - 2 SP - 283-298 PB - De Gruyter CY - Berlin SN - 2196-6826 DO - 10.1515/icom-2021-0030 UR - https://fis.uni-bamberg.de/handle/uniba/54850 LA - eng ER - TY - CHAP TI - Dyadic Deontic Logic in HOL : Faithful Embedding and Meta-Theoretical Experiments AU - Benzmüller, Christoph AU - Farjami, Ali AU - Parent, Xavier PY - 2022 T2 - New developments in legal reasoning and logic : from ancient law to modern legal systems SP - 353–377 PB - Springer CY - Cham UR - https://fis.uni-bamberg.de/handle/uniba/54546 LA - eng AB - A shallow semantical embedding of a dyadic deontic logic by Carmo and Jones in classical higher-order logic is presented. The embedding is proven sound and complete, that is, faithful. This result provides the theoretical foundation for the implementation and automation of dyadic deontic logic within off-the-shelf higher-order theorem provers and proof assistants. To demonstrate the practical relevance of our contribution, the embedding has been encoded in the Isabelle/HOL proof assistant. As a result a sound and complete (interactive and automated) theorem prover for the dyadic deontic logic of Carmo and Jones has been obtained. Experiments have been conducted which illustrate how the exploration and assessment of meta-theoretical properties of the embedded logic can be supported with automated reasoning tools integrated with Isabelle/HOL. KW - Dyadic deontic logic KW - Classical higher-order logic KW - Semantic embedding KW - Faithfulness ER - TY - JOUR TI - Automating public announcement logic with relativized common knowledge as a fragment of HOL in LogiKEy AU - Benzmüller, Christoph AU - Reiche, Sebastian PY - 2022 JO - Journal of Logic and Computation SP - 1-28 PB - Otto-Friedrich-Universität CY - Bamberg UR - https://fis.uni-bamberg.de/handle/uniba/54431 LA - eng AB - A shallow semantical embedding for public announcement logic with relativized common knowledge is presented. This embedding enables the first-time automation of this logic with off-the-shelf theorem provers for classical higher-order logic. It is demonstrated (i) how meta-theoretical studies can be automated this way, and (ii) how non-trivial reasoning in the target logic (public announcement logic), required e.g. to obtain a convincing encoding and automation of the wise men puzzle, can be realized. Key to the presented semantical embedding is that evaluation domains are mod- eled explicitly and treated as an additional parameter in the encodings of the con- stituents of the embedded target logic; in previous related works, e.g. on the em- bedding of normal modal logics, evaluation domains were implicitly shared between meta-logic and target logic. The work presented in this article constitutes an important addition to the pluralist LogiKEy knowledge engineering methodology, which enables experimen- tation with logics and their combinations, with general and domain knowledge, and with concrete use cases — all at the same time. KW - Public announcement logic; Relativized common knowledge; Semantical embedding; Higher-order logic; Proof automation ER - TY - GEN TI - Automated Reasoning in Non-classical Logics in the TPTP World AU - Steen, Alexander AU - Fuenmayor, David AU - Gleißner, Tobias AU - Sutcliffe, Geoff AU - Benzmüller, Christoph PY - 2022 PB - arXiv DO - 10.48550/ARXIV.2202.09836 UR - https://fis.uni-bamberg.de/handle/uniba/54664 LA - eng ER - TY - GEN TI - Mathematical Proof Between Generations AU - Bayer, Jonas AU - Benzmüller, Christoph AU - Buzzard, Kevin AU - David, Marco AU - Lamport, Leslie AU - Matiyasevich, Yuri AU - Paulson, Lawrence AU - Schleicher, Dierk AU - Stock, Benedikt AU - Zelmanov, Efim PY - 2022 SP - 1-17 PB - arXiv DO - 10.48550/ARXIV.2207.04779 UR - https://fis.uni-bamberg.de/handle/uniba/54601 LA - eng AB - A proof is one of the most important concepts of mathematics. However, there is a striking difference between how a proof is defined in theory and how it is used in practice. This puts the unique status of mathematics as exact science into peril. Now may be the time to reconcile theory and practice, i.e. precision and intuition, through the advent of computer proof assistants. For the most time this has been a topic for experts in specialized communities. However, mathematical proofs have become increasingly sophisticated, stretching the boundaries of what is humanly comprehensible, so that leading mathematicians have asked for formal verification of their proofs. At the same time, major theorems in mathematics have recently been computer-verified by people from outside of these communities, even by beginning students. This article investigates the gap between the different definitions of a proof and possibilities to build bridges. It is written as a polemic or a collage by different members of the communities in mathematics and computer science at different stages of their careers, challenging well-known preconceptions and exploring new perspectives. KW - mathematical proof ER - TY - CHAP TI - Dyadic Deontic Logic in HOL : Faithful Embedding and Meta-Theoretical Experiments AU - Benzmüller, Christoph AU - Farjami, Ali AU - Parent, Xavier PY - 2022 T2 - New developments in legal reasoning and logic : from ancient law to modern legal systems SP - 353-377 PB - Springer CY - Cham SN - 978-3-030-70084-3 DO - 10.1007/978-3-030-70084-3_14 UR - https://fis.uni-bamberg.de/handle/uniba/54432 LA - eng AB - A shallow semantical embedding of a dyadic deontic logic by Carmo and Jones in classical higher-order logic is presented. The embedding is proven sound and complete, that is, faithful. This result provides the theoretical foundation for the implementation and automation of dyadic deontic logic within off-the-shelf higher-order theorem provers and proof assistants. To demonstrate the practical relevance of our contribution, the embedding has been encoded in the Isabelle/HOL proof assistant. As a result a sound and complete (interactive and automated) theorem prover for the dyadic deontic logic of Carmo and Jones has been obtained. Experiments have been conducted which illustrate how the exploration and assessment of meta-theoretical properties of the embedded logic can be supported with automated reasoning tools integrated with Isabelle/HOL. KW - Dyadic deontic logic KW - Classical higher-order logic KW - Semantic embedding KW - Faithfulness ER - TY - GEN TI - Automating Public Announcement Logic with Relativized Common Knowledge as a Fragment of HOL in LogiKEy AU - Benzmüller, Christoph AU - Reiche, Sebastian PY - 2021 SP - 1-28 PB - arXiv CY - Online DO - 10.48550/ARXIV.2111.01654 UR - https://fis.uni-bamberg.de/handle/uniba/55605 LA - eng AB - A shallow semantical embedding for public announcement logic with relativized common knowledge is presented. This embedding enables the first-time automation of this logic with off-the-shelf theorem provers for classical higher-order logic. It is demonstrated (i) how meta-theoretical studies can be automated this way, and (ii) how non-trivial reasoning in the target logic (public announcement logic), required e.g. to obtain a convincing encoding and automation of the wise men puzzle, can be realized. Key to the presented semantical embedding is that evaluation domains are mod- eled explicitly and treated as an additional parameter in the encodings of the con- stituents of the embedded target logic; in previous related works, e.g. on the em- bedding of normal modal logics, evaluation domains were implicitly shared between meta-logic and target logic. The work presented in this article constitutes an important addition to the pluralist LogiKEy knowledge engineering methodology, which enables experimen- tation with logics and their combinations, with general and domain knowledge, and with concrete use cases — all at the same time. KW - Public announcement logic; Relativized common knowledge; Semantical embedding; Higher-order logic; Proof automation ER - TY - CPAPER TI - A (simplified) supreme being necessarily exists, says the computer : Computationally explored variants of Gödel's ontological argument AU - Benzmüller, Christoph PY - 2020 T2 - Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020) SP - 779-789 SN - 9780999241172 UR - https://fis.uni-bamberg.de/handle/uniba/117505 LA - eng ER - TY - CHAP TI - Träumen vernünftige Maschinen von Gründen? : Eine reale Utopie AU - Benzmüller, Christoph AU - Lomfeld, Bertram PY - 2020 T2 - KI als Laboratorium? Ethik als Aufgabe! SP - 29-36 CY - Berlin SN - 978-3-939818-93-9 UR - https://fis.uni-bamberg.de/handle/uniba/117506 LA - deu ER - TY - GEN TI - Higher-order Logic as Lingua Franca -- Integrating Argumentative Discourse and Deep Logical Analysis AU - Fuenmayor, David AU - Benzmüller, Christoph PY - 2020 PB - arXiv DO - 10.48550/arxiv.2007.01019 UR - https://fis.uni-bamberg.de/handle/uniba/95347 LA - eng ER -