@inproceedings{schuster2026_117803,
  title = {Elixir meets TPTP : Bringing Automated Reasoning to the BEAM Ecosystem},
  author = {Schuster, Johannes and Fuenmayor, David and Benzmüller, Christoph},
  year = {2026},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-117803x},
  url = {https://fis.uni-bamberg.de/handle/uniba/117803},
  language = {eng},
  abstract = {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.},
  keywords = {Automated Theorem Proving, Elixir, Livebook, SystemOnTPTP, Isabelle/HOL, Model Context Protocol}
}

@inproceedings{schuster2026_117777,
  title = {Building Blocks for Reasoning on the BEAM},
  author = {Schuster, Johannes and Benzmüller, Christoph},
  year = {2026},
  booktitle = {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)},
  pages = {98-111},
  publisher = {Kalpa Publications in Computing},
  doi = {10.29007/z6j1},
  url = {https://fis.uni-bamberg.de/handle/uniba/117777},
  language = {eng}
}

@article{benzmuller2026_117778,
  title = {HOL in HOL over a set-theoretic universe : consistency of NK with infinity and choice},
  author = {Benzmüller, Christoph and Kirchner, Daniel},
  year = {2026},
  journal = {Archive of Formal Proofs},
  publisher = {SourceForge},
  address = {San Diego, CA},
  issn = {2150-914x},
  url = {https://fis.uni-bamberg.de/handle/uniba/117778},
  language = {eng}
}

@misc{benzmuller2026_117577,
  title = {Mathematical Proof Assistants for Teaching Logic : The LogiKEy Methodology},
  author = {Benzmüller, Christoph and Fuenmayor, David and Pasetto, Luca},
  year = {2026},
  pages = {1-29},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2610.08214},
  url = {https://fis.uni-bamberg.de/handle/uniba/117577},
  language = {eng}
}

@article{vestrucci2026_117550,
  title = {Diagonalization as computation : Gödel sentence construction and a type-disciplined blueprint},
  author = {Vestrucci, Andrea},
  year = {2026},
  pages = {761-799},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-117550x},
  url = {https://fis.uni-bamberg.de/handle/uniba/117550},
  language = {eng},
  abstract = {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.},
  keywords = {Gödel’s first incompleteness theorem, Diagonalization, Gödel numbering, Primitive recursive functions, Lawvere fixed-point theorem, Diagonal arguments}
}

@article{vestrucci2026_117549,
  title = {Diagonalization as computation : Gödel sentence construction and a type-disciplined blueprint},
  author = {Vestrucci, Andrea},
  year = {2026},
  journal = {Archive for mathematical logic},
  volume = {65},
  number = {6},
  pages = {761-799},
  publisher = {Springer},
  address = {Berlin ; Heidelberg},
  issn = {1432-0665},
  doi = {10.1007/s00153-026-01021-7},
  url = {https://fis.uni-bamberg.de/handle/uniba/117549},
  language = {eng},
  abstract = {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.},
  keywords = {Gödel’s first incompleteness theorem, Diagonalization, Gödel numbering, Primitive recursive functions, Lawvere fixed-point theorem, Diagonal arguments}
}

@misc{benzmuller2026_117502,
  title = {Gödel's and Scott's Variants of the Ontological Argument in Lean 4 and TPTP THF},
  author = {Benzmüller, Christoph},
  year = {2026},
  number = {Online first},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2609.26806},
  url = {https://fis.uni-bamberg.de/handle/uniba/117502},
  language = {eng}
}

@misc{benzmuller2026_117503,
  title = {Proofs Without Nominals : Gödel's Ontological Argument, its Shallow Embedding, and the Open Questions of the Monatshefte Notes},
  author = {Benzmüller, Christoph},
  year = {2026},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2609.36279},
  url = {https://fis.uni-bamberg.de/handle/uniba/117503},
  language = {eng}
}

@inproceedings{sigloch2026_117504,
  title = {Neuro-Symbolic Verification of LLM Outputs for Data-Sensitive Domains},
  author = {Sigloch, Paul and Benzmüller, Christoph},
  year = {2026},
  booktitle = {KI 2026: Advances in Artificial Intelligence : 49th German Conference on AI, KI 2026, Bremen, Germany, August 11–14, 2026, Proceedings},
  pages = {324-331},
  publisher = {Springer Nature Switzerland},
  address = {Cham},
  isbn = {9783032323347},
  doi = {10.1007/978-3-032-32335-4\_30},
  url = {https://fis.uni-bamberg.de/handle/uniba/117504},
  language = {eng}
}

@inproceedings{pasetto2026_117139,
  title = {The Fatio Protocol for Formal Dialogue in Isabelle/HOL},
  author = {Pasetto, Luca and Benzmüller, Christoph},
  year = {2026},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  doi = {10.20378/irb-117139},
  urn = {urn:nbn:de:bvb:473-irb-117139x},
  url = {https://fis.uni-bamberg.de/handle/uniba/117139},
  language = {eng},
  abstract = {-},
  keywords = {Fatio Protocol for Formal Dialogue}
}

@incollection{muhlenbeck2026_117154,
  title = {On Absolute Infinity and Modal Collapse in Gödel’s Ontological Proof},
  author = {Mühlenbeck, Cordelia and Benzmüller, Christoph},
  year = {2026},
  booktitle = {Logic, Knowledge, and Tradition : Essays in Honor of Srećko Kovač},
  pages = {72–82},
  publisher = {Brill},
  address = {Leiden ; Boston},
  isbn = {978-90-04-75635-9},
  doi = {10.1163/9789004756359-005},
  url = {https://fis.uni-bamberg.de/handle/uniba/117154},
  language = {eng}
}

@article{benzmuller2026_117132,
  title = {A Deep Embedding of HOL in HOL : Soundness, Completeness, Consistency (Isabelle/HOL dataset)},
  author = {Benzmüller, Christoph and Kirchner, Daniel},
  year = {2026},
  journal = {Archive of Formal Proofs},
  publisher = {SourceForge},
  address = {San Diego, CA},
  issn = {2150-914x},
  url = {https://fis.uni-bamberg.de/handle/uniba/117132},
  language = {eng}
}

@article{benzmuller2026_117133,
  title = {Monadic Second-Order Logic in HOL : Deep and Shallow Embeddings with Automated Faithfulness (Isabelle/HOL dataset)},
  author = {Benzmüller, Christoph and Kirchner, Daniel},
  year = {2026},
  journal = {Archive of Formal Proofs},
  publisher = {SourceForge},
  address = {San Diego, CA},
  issn = {2150-914x},
  url = {https://fis.uni-bamberg.de/handle/uniba/117133},
  language = {eng}
}

@inproceedings{schuster2026_117137,
  title = {Elixir meets TPTP : Bringing Automated Reasoning to the BEAM Ecosystem},
  author = {Schuster, Johannes and Fuenmayor, David and Benzmüller, Christoph},
  year = {2026},
  booktitle = {Proceedings of the 10th Workshop on Practical Aspects of Automated Reasoning (PAAR 2026), co-located with FLoC 2026, July 25, 2026, Lisbon, Portugal},
  publisher = {RWTH Aachen},
  address = {Aachen, Germany},
  series = {CEUR workshop proceedings},
  issn = {1613-0073},
  url = {https://fis.uni-bamberg.de/handle/uniba/117137},
  language = {eng},
  abstract = {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.},
  keywords = {Automated Theorem Proving, Elixir, Livebook, SystemOnTPTP, Isabelle/HOL, Model Context Protocol}
}

@misc{benzmuller2026_117136,
  title = {First-Order Modal Logic in HOL : Deep and Shallow Embeddings with Automated Faithfulness (Extended Preprint)},
  author = {Benzmüller, Christoph and Kirchner, Daniel},
  year = {2026},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2607.10880},
  url = {https://fis.uni-bamberg.de/handle/uniba/117136},
  language = {eng}
}

@misc{benzmuller2026_117135,
  title = {A Comment on Modal Collapse and Ultrafilters in Gödel's Ontological Argument},
  author = {Benzmüller, Christoph},
  year = {2026},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2608.07578},
  url = {https://fis.uni-bamberg.de/handle/uniba/117135},
  language = {eng}
}

@misc{benzmuller2026_117134,
  title = {Monadic Second-Order Logic in HOL : Deep and Shallow with Automated Faithfulness (Extended Preprint)},
  author = {Benzmüller, Christoph and Kirchner, Daniel},
  year = {2026},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2609.07345},
  url = {https://fis.uni-bamberg.de/handle/uniba/117134},
  language = {eng}
}

@inproceedings{benzmuller2026_116614,
  title = {Faithful Logic Embeddings in HOL : Deep and Shallow},
  author = {Benzmüller, Christoph},
  year = {2026},
  pages = {280-301},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-116614x},
  url = {https://fis.uni-bamberg.de/handle/uniba/116614},
  language = {eng},
  abstract = {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.},
  keywords = {Logic embeddings, Faithfulness, Automated Reasoning}
}

@article{steen2026_116610,
  title = {Solving quantified modal logic problems by translation to classical logics},
  author = {Steen, Alexander and Sutcliffe, Geoff and Benzmüller, Christoph},
  year = {2026},
  pages = {1-27},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-116610x},
  url = {https://fis.uni-bamberg.de/handle/uniba/116610},
  language = {eng},
  abstract = {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.},
  keywords = {Non-classical logics, Quantified modal logics, Higher-order logic, First-order logic, Automated theorem proving}
}

@misc{sigloch2026_115590,
  title = {Neuro-Symbolic Verification of LLM Outputs for Data-Sensitive Domains (extended preprint)},
  author = {Sigloch, Paul and Benzmüller, Christoph},
  year = {2026},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-115590x},
  url = {https://fis.uni-bamberg.de/handle/uniba/115590},
  language = {eng},
  abstract = {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.},
  keywords = {Neuro-symbolic AI, LLM verification, Formal verification, Trustworthy AI, Hybrid AI, Actor model, AI system architecture}
}

@misc{benzmuller2026_115589,
  title = {Many Logics, One Methodology : A Plea for Logical Pluralism in Formalised Reasoning (preprint)},
  author = {Benzmüller, Christoph and Kirchner, Daniel and Pasetto, Luca},
  year = {2026},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-115589x},
  url = {https://fis.uni-bamberg.de/handle/uniba/115589},
  language = {eng},
  abstract = {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.},
  keywords = {Logical Pluralism, Meta-Logical Reasoning, Proof Assistants, Higher-Order Logic, Classical and Non-Classical Logics}
}

@inproceedings{pasetto2026_115582,
  title = {Formalizing Mental Privacy in LogiKEy},
  author = {Pasetto, Luca and Benzmüller, Christoph and Markovich, Réka},
  year = {2026},
  pages = {3643-3645},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-115582x},
  url = {https://fis.uni-bamberg.de/handle/uniba/115582},
  language = {eng},
  abstract = {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.},
  keywords = {Normative Multiagent Systems, Legal Knowledge Representation, Automated Reasoning, Modal Logic, Higher-Order Logic, LogiKEy, Mental Privacy, Freedom of Thought, Normative Positions}
}

@misc{sigloch2026_115305,
  title = {Neuro-Symbolic Verification of LLM Outputs for Data-Sensitive Domains (extended preprint)},
  author = {Sigloch, Paul and Benzmüller, Christoph},
  year = {2026},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2605.26942},
  url = {https://fis.uni-bamberg.de/handle/uniba/115305},
  language = {eng},
  abstract = {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.},
  keywords = {Neuro-symbolic AI, LLM verification, Formal verification, Trustworthy AI, Hybrid AI, Actor model, AI system architecture}
}

@misc{benzmuller2026_115304,
  title = {Many Logics, One Methodology : A Plea for Logical Pluralism in Formalised Reasoning (preprint)},
  author = {Benzmüller, Christoph and Kirchner, Daniel and Pasetto, Luca},
  year = {2026},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2605.27246},
  url = {https://fis.uni-bamberg.de/handle/uniba/115304},
  language = {eng},
  abstract = {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.},
  keywords = {Logical Pluralism, Meta-Logical Reasoning, Proof Assistants, Higher-Order Logic, Classical and Non-Classical Logics}
}

@inproceedings{pasetto2026_115278,
  title = {Formalizing Mental Privacy in LogiKEy},
  author = {Pasetto, Luca and Benzmüller, Christoph and Markovich, Réka},
  year = {2026},
  booktitle = {AAMAS 2026: Proc. of the 25th International Conference on Autonomous Agents and Multiagent Systems},
  pages = {3643-3645},
  doi = {10.65109/ptsf2244},
  url = {https://fis.uni-bamberg.de/handle/uniba/115278},
  language = {eng},
  abstract = {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.},
  keywords = {Normative Multiagent Systems, Legal Knowledge Representation, Automated Reasoning, Modal Logic, Higher-Order Logic, LogiKEy, Mental Privacy, Freedom of Thought, Normative Positions}
}

@article{muhlenbeck2026_114345,
  title = {On the Maximality of Positive Properties and Modal Collapse in Variants of Gödel’s Ontological Proof for the Existence of God},
  author = {Mühlenbeck, Cordelia and Benzmüller, Christoph},
  year = {2026},
  journal = {Logic and logical philosophy : LLP},
  number = {Online First},
  pages = {1-21},
  publisher = {Nicholas Copernicus Univ. Press},
  address = {Toruń},
  issn = {1425-3305},
  doi = {10.12775/llp.2026.007},
  url = {https://fis.uni-bamberg.de/handle/uniba/114345},
  language = {eng}
}

@article{aguiar2026_113119,
  title = {Neural-guided superoptimization in ethereum},
  author = {Aguiar, Matheus Araújo and Albert, Elvira and Genaim, Samir and Gordillo, Pablo and Hernández-Cerezo, Alejandro and Kirchner, Daniel and Rubio, Albert},
  year = {2026},
  pages = {1-15},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-113119x},
  url = {https://fis.uni-bamberg.de/handle/uniba/113119},
  language = {eng},
  abstract = {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.},
  keywords = {Smart contracts, Ethereum, Optimization, Machine learning}
}

@incollection{benzmuller2026_113190,
  title = {Symbolische Kontrolle für subsymbolische Künstliche Intelligenz?},
  author = {Benzmüller, Christoph},
  year = {2026},
  pages = {211–226},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-113190x},
  url = {https://fis.uni-bamberg.de/handle/uniba/113190},
  language = {deu},
  abstract = {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.},
  keywords = {-}
}

@article{lumbreras2026_113194,
  title = {AI Ethics Beyond Compliance : Governance, Power, and Human Flourishing},
  author = {Lumbreras, Sara and Vestrucci, Andrea and Weir, Ralph Stefan},
  year = {2026},
  pages = {5-9},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-113194x},
  url = {https://fis.uni-bamberg.de/handle/uniba/113194},
  language = {eng},
  abstract = {-},
  keywords = {AI Ethics}
}

@inproceedings{passeto2026_113026,
  title = {Visualizing Kripke Models in LogiKEy : the Case of SDL},
  author = {Passeto, Luca and Benzmüller, Christoph},
  year = {2026},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {CEUR workshop proceedings},
  urn = {urn:nbn:de:bvb:473-irb-113026x},
  url = {https://fis.uni-bamberg.de/handle/uniba/113026},
  language = {eng},
  abstract = {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).},
  keywords = {Proof assistants, Model finders, Isabelle/HOL, Automated theorem proving, Semantical embedding, Higher-order logic}
}

@inproceedings{lawniczak2026_112989,
  title = {Logical Modalities within the European AI Act : An Analysis},
  author = {Lawniczak, Lara and Benzmüller, Christoph},
  year = {2026},
  pages = {348-353},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-112989x},
  url = {https://fis.uni-bamberg.de/handle/uniba/112989},
  language = {eng},
  abstract = {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.},
  keywords = {European AI Act, Modalities, Non-classical logics, Higher-order Logic, Proof Assistants, Automated Reasoning}
}

@article{benzmuller2026_112503,
  title = {Notes on Gödel’s and Scott’s variants of the ontological argument},
  author = {Benzmüller, Christoph and Scott, Dana},
  year = {2026},
  pages = {569-611},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-112503x},
  url = {https://fis.uni-bamberg.de/handle/uniba/112503},
  language = {eng},
  abstract = {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.},
  keywords = {Gödel’s ontological argument, Interactive and automated theorem proving, Higher-order modal logic}
}

@article{rothgang2026_110822,
  title = {Dependently-Typed Higher-Order Logic},
  author = {Rothgang, Colin and Rabe, Florian and Benzmüller, Christoph},
  year = {2026},
  journal = {ACM transactions on computational logic : TOCL},
  volume = {27},
  number = {1},
  pages = {1-54},
  publisher = {Association for Computing Machinery (ACM)},
  address = {New York, NY},
  issn = {1529-3785},
  doi = {10.1145/3771725},
  url = {https://fis.uni-bamberg.de/handle/uniba/110822},
  language = {eng}
}

@incollection{vestrucci2025_117360,
  title = {Belief Complexities and Modeling : An Interplay},
  author = {Vestrucci, Andrea},
  year = {2025},
  booktitle = {Neuroscience of religion : integrating brain, mind and beliefs},
  pages = {197-228},
  publisher = {Springer},
  address = {Cham, Switzerland},
  series = {New approaches to the scientific study of religion},
  isbn = {978-3-032-02444-2},
  doi = {10.1007/978-3-032-02444-2\_12},
  url = {https://fis.uni-bamberg.de/handle/uniba/117360},
  language = {eng}
}

@inproceedings{fuenmayor2025_117138,
  title = {HOL as a Lingua Franca for Argumentative Reasoning Agents},
  author = {Fuenmayor, David and Benzmüller, Christoph},
  year = {2025},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  doi = {10.20378/irb-117138},
  urn = {urn:nbn:de:bvb:473-irb-117138x},
  url = {https://fis.uni-bamberg.de/handle/uniba/117138},
  language = {eng},
  abstract = {-},
  keywords = {HOL}
}

@inproceedings{benzmuller2025_116345,
  title = {Faithful Logic Embeddings in HOL : Deep and Shallow},
  author = {Benzmüller, Christoph},
  year = {2025},
  booktitle = {Automated Deduction – CADE 30 : 30th International Conference on Automated Deduction, Stuttgart, Germany, July 28-31, 2025, Proceedings},
  pages = {280-301},
  publisher = {Springer Nature Switzerland},
  address = {Cham},
  isbn = {9783031999833},
  doi = {10.1007/978-3-031-99984-0\_16},
  url = {https://fis.uni-bamberg.de/handle/uniba/116345},
  language = {eng},
  abstract = {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.},
  keywords = {Logic embeddings, Faithfulness, Automated Reasoning}
}

@incollection{jonas2025_115069,
  title = {Language and Religion},
  author = {Jonas, Silvia and Vestrucci, Andrea},
  year = {2025},
  booktitle = {Encyclopedia of Language and Linguistics},
  publisher = {Elsevier},
  address = {Burlington},
  edition = {2},
  isbn = {978-0-08-054784-8},
  doi = {10.1016/b978-0-323-95504-1.00657-8},
  url = {https://fis.uni-bamberg.de/handle/uniba/115069},
  language = {eng}
}

@techreport{romeike2025_114485,
  title = {PetraKIP - Persönliches transparentes KI-basiertes Portfolio für die Lehrerbildung; Teilvorhaben: Lehr-Lernmethoden, Erforschung und Anwendung(sentwicklung) eines KI-basierten Portfolios (LeaKIP) : Schlussbericht},
  author = {Romeike, Ralf and Benzmüller, Christoph and Landgraf, Tim},
  year = {2025},
  publisher = {Technische Informationsbibliothek},
  address = {Hannover},
  doi = {10.34657/31447},
  url = {https://fis.uni-bamberg.de/handle/uniba/114485},
  language = {deu}
}

@phdthesis{fuenmayor2025_114460,
  title = {A Universal Mathematical Language for Argumentative Reasoning Agents},
  author = {Fuenmayor, David},
  year = {2025},
  publisher = {Freie Universität Berlin},
  address = {Berlin},
  doi = {10.17169/refubium-48234},
  urn = {urn:nbn:de:kobv:188-refubium-48512-1},
  url = {https://fis.uni-bamberg.de/handle/uniba/114460},
  language = {eng},
  school = {Otto-Friedrich-Universität Bamberg}
}

@misc{vestrucci2025_112618,
  title = {AI Ethics Beyond Compliance : Governance, Power, and Human Flourishing},
  editor = {Vestrucci, Andrea and Lumbreras, Sara and Weir, Ralph Stefan},
  year = {2025},
  number = {79},
  publisher = {Wydawn. Naukowe Scholar},
  address = {Warszawa},
  issn = {0860-3839},
  url = {https://fis.uni-bamberg.de/handle/uniba/112618},
  language = {eng}
}

@article{lumbreras2025_112617,
  title = {AI Ethics Beyond Compliance : Governance, Power, and Human Flourishing},
  author = {Lumbreras, Sara and Vestrucci, Andrea and Weir, Ralph Stefan},
  year = {2025},
  journal = {Edukacja Filozoficzna},
  number = {79},
  pages = {5-9},
  publisher = {Wydawn. Naukowe Scholar},
  address = {Warszawa},
  issn = {0860-3839},
  url = {https://fis.uni-bamberg.de/handle/uniba/112617},
  language = {eng},
  abstract = {-},
  keywords = {AI Ethics}
}

@article{vestrucci2025_112616,
  title = {La « liberté royale » du langage : paradoxes et révélation divine dans le De servo arbitrio de Luther},
  author = {Vestrucci, Andrea},
  year = {2025},
  journal = {Revue d'histoire du protestantisme},
  volume = {10},
  number = {4},
  pages = {423-445},
  publisher = {Droz},
  address = {Genève},
  issn = {2297-6167},
  doi = {10.47421/RHP\_10.4\_423-445},
  url = {https://fis.uni-bamberg.de/handle/uniba/112616},
  language = {fra}
}

@article{vestrucci2025_112615,
  title = {Forms of Paradox in Erasmus and Luther},
  author = {Vestrucci, Andrea},
  year = {2025},
  journal = {Lutherjahrbuch : Organ der internationalen Lutherforschung},
  volume = {92},
  pages = {186-217},
  publisher = {Vandenhoeck \& Ruprecht},
  address = {Göttingen},
  issn = {0342-0914},
  doi = {10.13109/9783666874987.186},
  url = {https://fis.uni-bamberg.de/handle/uniba/112615},
  language = {eng}
}

@inproceedings{lawniczak2025_112576,
  title = {Logical Modalities within the European AI Act : An Analysis},
  author = {Lawniczak, Lara and Benzmüller, Christoph},
  year = {2025},
  booktitle = {ICAIL '25: Proceedings of the Twentieth International Conference on Artificial Intelligence and Law},
  pages = {348-353},
  publisher = {ACM},
  isbn = {979-8-4007-1939-4},
  doi = {10.1145/3769126.3769202},
  url = {https://fis.uni-bamberg.de/handle/uniba/112576},
  language = {eng},
  abstract = {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.},
  keywords = {European AI Act, Modalities, Non-classical logics, Higher-order Logic, Proof Assistants, Automated Reasoning}
}

@mastersthesis{stoel2025_110690,
  title = {Symbolic AI in Critical Healthcare Setting : Towards Automated Governance of Spontaneous Breathing Trials for Streamlined Extubation},
  author = {Stößel, Patrick Salvatore},
  year = {2025},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  doi = {10.20378/irb-110690},
  urn = {urn:nbn:de:bvb:473-irb-110690x},
  url = {https://fis.uni-bamberg.de/handle/uniba/110690},
  language = {eng},
  abstract = {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.},
  keywords = {Symbolische Künstliche Intelligenz, Erklärbarkeit, Verifizierbarkeit, Höherstufige Logik, Medizinanwendung},
  school = {Otto-Friedrich-Universität Bamberg}
}

@misc{lawniczak2025_112312,
  title = {Logical Modalities within the European AI Act : An Analysis},
  author = {Lawniczak, Lara and Benzmüller, Christoph},
  year = {2025},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-112312x},
  url = {https://fis.uni-bamberg.de/handle/uniba/112312},
  language = {eng},
  abstract = {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.},
  keywords = {European AI Act, Modalities, Non-classical logics, Higher-order Logic, Proof Assistants, Automated Reasoning}
}

@misc{wasenmuller2025_112110,
  title = {Script-Based Dialog Policy Planning for LLM-Powered Conversational Agents : A Basic Architecture for an "AI Therapist"},
  author = {Wasenmüller, Robert and Hilbert, Kevin and Benzmüller, Christoph},
  year = {2025},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-112110x},
  url = {https://fis.uni-bamberg.de/handle/uniba/112110},
  language = {eng},
  abstract = {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.},
  keywords = {Large Language Model (LLM)}
}

@inproceedings{passeto2025_112064,
  title = {Visualizing Kripke Models in LogiKEy : the Case of SDL},
  author = {Passeto, Luca and Benzmüller, Christoph},
  year = {2025},
  booktitle = {Joint Proceedings of the Workshops and Doctoral Consortium of the 41st International Conference on Logic Programming (ICLP-WS-DC 2025)},
  publisher = {RWTH Aachen},
  address = {Aachen, Germany},
  series = {CEUR workshop proceedings},
  issn = {1613-0073},
  url = {https://fis.uni-bamberg.de/handle/uniba/112064},
  language = {eng},
  abstract = {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).},
  keywords = {Proof assistants, Model finders, Isabelle/HOL, Automated theorem proving, Semantical embedding, Higher-order logic}
}

@article{steen2025_112065,
  title = {On Reductions of Hintikka Sets for Higher-Order Logic},
  author = {Steen, Alexander and Benzmüller, Christoph},
  year = {2025},
  journal = {Journal of applied logics - IfCoLoG journal of logics and their applications},
  volume = {12},
  number = {7},
  pages = {1813-1834},
  publisher = {College Publications},
  address = {London},
  issn = {2631-9810},
  url = {https://fis.uni-bamberg.de/handle/uniba/112065},
  language = {eng}
}

@inproceedings{vestrucci2025_111633,
  title = {Symbolic Approach to Trustworthy AI : Exploration and Healthcare Case Study},
  author = {Vestrucci, Andrea and Benzmüller, Christoph and Evangelatos, Nikolaos},
  year = {2025},
  booktitle = {Information System Design : Intelligent Healthcare Informatics : Proceedings of Ninth International Conference on Information System Design and Intelligent Applications (ISDIA 2025)},
  pages = {367-379},
  publisher = {Springer Nature},
  address = {Singapore},
  isbn = {978-981-96-9241-5},
  doi = {10.1007/978-981-96-9242-2\_27},
  url = {https://fis.uni-bamberg.de/handle/uniba/111633},
  language = {eng}
}

@inproceedings{tenne2025_111634,
  title = {XAI in Healthcare : Analysis and Evaluation of XAI Tools and Legal Liability for Neural Networks : A Case Study on Tumor Image Classification},
  author = {Tenne, Alina and Vestrucci, Andrea and Benzmüller, Christoph},
  year = {2025},
  booktitle = {Information System Design : Intelligent Healthcare Informatics : Proceedings of Ninth International Conference on Information System Design and Intelligent Applications (ISDIA 2025)},
  pages = {423-434},
  publisher = {Springer Nature},
  address = {Singapore},
  isbn = {978-981-96-9241-5},
  doi = {10.1007/978-981-96-9242-2\_31},
  url = {https://fis.uni-bamberg.de/handle/uniba/111634},
  language = {eng}
}

@article{steen2025_110814,
  title = {Challenges for Non-Classical Reasoning in Contemporary AI Applications},
  author = {Steen, Alexander and Benzmüller, Christoph},
  year = {2025},
  pages = {7-16},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-110814x},
  url = {https://fis.uni-bamberg.de/handle/uniba/110814},
  language = {eng},
  abstract = {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.},
  keywords = {AI Applications}
}

@article{steen2025_110813,
  title = {Non-Classical Reasoning for Contemporary AI Applications},
  author = {Steen, Alexander and Benzmüller, Christoph},
  year = {2025},
  pages = {3-5},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-110813x},
  url = {https://fis.uni-bamberg.de/handle/uniba/110813},
  language = {eng},
  abstract = {-},
  keywords = {AI Applications}
}

@article{lawniczak2025_110980,
  title = {Reasoning with Epistemic Rights and Duties : Automating a Dynamic Logic of the Right to Know in LogiKEy},
  author = {Lawniczak, Lara and Pasetto, Luca and Benzmüller, Christoph and Li, Xu and Markovich, Réka},
  year = {2025},
  journal = {Frontiers in Artificial Intelligence and Applications},
  number = {413, ECAI 2025},
  pages = {1623-1630},
  publisher = {IOS Press},
  address = {Amsterdam [u.a.]},
  issn = {0922-6389},
  doi = {10.3233/faia250988},
  url = {https://fis.uni-bamberg.de/handle/uniba/110980},
  language = {eng}
}

@incollection{benzmuller2025_110724,
  title = {Symbolische Kontrolle für subsymbolische Künstliche Intelligenz?},
  author = {Benzmüller, Christoph},
  year = {2025},
  booktitle = {Künstliche Intelligenz und Wir : Stand, Nutzung und Herausforderungen der KI},
  pages = {211-226},
  publisher = {Springer Vieweg},
  address = {Berlin},
  isbn = {9783662715666},
  doi = {10.1007/978-3-662-71567-3\_11},
  url = {https://fis.uni-bamberg.de/handle/uniba/110724},
  language = {deu},
  abstract = {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.},
  keywords = {-}
}

@incollection{aggarwal2025_110663,
  title = {Automatic Reasoning-Code Generation Using NLP-Based Entity Relations Identification},
  author = {Aggarwal, Radhya and Kataria, Swastika and Urolagin, Siddhaling and Benzmüller, Christoph},
  year = {2025},
  booktitle = {Information System Design: Big Data Analytics and Data Science},
  pages = {169-183},
  publisher = {Springer Nature Singapore},
  address = {Singapore},
  isbn = {9789819692477},
  doi = {10.1007/978-981-96-9248-4\_13},
  url = {https://fis.uni-bamberg.de/handle/uniba/110663},
  language = {eng}
}

@article{albert2025_110286,
  title = {Secure Optimizations on Ethereum Bytecode Jump-Free Sequences},
  author = {Albert, Elvira and Genaim, Samir and Kirchner, Daniel and Martin-Martin, Enrique},
  year = {2025},
  journal = {IEEE Transactions on Dependable and Secure Computing},
  volume = {22},
  number = {4},
  pages = {3676-3691},
  publisher = {IEEE},
  address = {New York, NY},
  issn = {1941-0018},
  doi = {10.1109/tdsc.2025.3536803},
  url = {https://fis.uni-bamberg.de/handle/uniba/110286},
  language = {eng}
}

@article{aguiar2025_110288,
  title = {Neural-guided superoptimization in ethereum},
  author = {Aguiar, Matheus Araújo and Albert, Elvira and Genaim, Samir and Gordillo, Pablo and Hernández-Cerezo, Alejandro and Kirchner, Daniel and Rubio, Albert},
  year = {2025},
  journal = {Information and Software Technology},
  volume = {186},
  number = {October 2025, 107800},
  pages = {1-15},
  publisher = {Elsevier Science},
  address = {Amsterdam [u.a.]},
  issn = {0950-5849},
  doi = {10.1016/j.infsof.2025.107800},
  url = {https://fis.uni-bamberg.de/handle/uniba/110288},
  language = {eng},
  abstract = {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.},
  keywords = {Smart contracts, Ethereum, Optimization, Machine learning}
}

@incollection{vestrucci2025_109909,
  title = {KI, Überzeugungen und Freiheit},
  author = {Vestrucci, Andrea},
  year = {2025},
  booktitle = {Braucht Demokratie Religion? : Auseinandersetzungen mit Hartmut Rosa},
  pages = {277-293},
  publisher = {University of Bamberg Press},
  address = {Bamberg},
  isbn = {978-3-98989-060-2},
  doi = {10.20378/irb-109909},
  url = {https://fis.uni-bamberg.de/handle/uniba/109909},
  language = {deu},
  abstract = {-},
  keywords = {-}
}

@book{bracheschyrek2025_108272,
  title = {Braucht Demokratie Religion? : Auseinandersetzungen mit Hartmut Rosa},
  author = {Braches-Chyrek, Rita and Bründl, Jürgen and Fischer, Pascal and Freitag, Sabine and Gerten, Michael and Gies, Kathrin and Grell, Frithjof Roland Gerhard and Hoffjann, Olaf and Huber, Stefan and Jäger, Gabriel and Kügler, Joachim and Laubach, Thomas and Lochner, Carolin and Rau, Caroline and Reheis, Fritz and Rüb, Paula Maria and Schmitt, Alexander and Steinberger, Simon and Vestrucci, Andrea and Zintl, Reinhard},
  editor = {Laubach, Thomas and Huber, Stefan},
  year = {2025},
  publisher = {University of Bamberg Press},
  address = {Bamberg},
  series = {Bamberger Theologische Studien},
  isbn = {978-3-98989-060-2},
  doi = {10.20378/irb-108272},
  urn = {urn:nbn:de:bvb:473-irb-1082729},
  url = {https://fis.uni-bamberg.de/handle/uniba/108272},
  language = {deu},
  abstract = {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.},
  keywords = {Demokratie, Religion, Politik, Hartmut Rosa, Resonanz, Gesellschaft, Democracy, Politics, Resonance, Society}
}

@article{benzmuller2025_108582,
  title = {Faithful Logic Embeddings in HOL : Deep and Shallow (Isabelle/HOL dataset)},
  author = {Benzmüller, Christoph},
  year = {2025},
  journal = {Archive of Formal Proofs},
  issn = {2150-914x},
  url = {https://fis.uni-bamberg.de/handle/uniba/108582},
  language = {eng}
}

@misc{benzmuller2025_108501,
  title = {Faithful Logic Embeddings in HOL : Deep and Shallow},
  author = {Benzmüller, Christoph},
  year = {2025},
  pages = {1-24},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2502.19311},
  url = {https://fis.uni-bamberg.de/handle/uniba/108501},
  language = {eng}
}

@article{benzmuller2025_108279,
  title = {Modelling Value-Oriented Legal Reasoning in LogiKEy},
  author = {Benzmüller, Christoph and Fuenmayor, David and Lomfeld, Bertram},
  year = {2025},
  pages = {31–78},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1082798},
  url = {https://fis.uni-bamberg.de/handle/uniba/108279},
  language = {eng},
  abstract = {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.},
  keywords = {legal balancing; value-oriented reasoning, automated theorem proving, logical pluralism, proof assistants, Isabelle/HOL}
}

@inproceedings{solopova2025_108391,
  title = {Check News in One Click : NLP-Empowered Pro-Kremlin Propaganda Detection},
  author = {Solopova, Veronika and Herman, Viktoriia and Benzmüller, Christoph and Landgraf, Tim},
  year = {2025},
  pages = {44-51},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1083913},
  url = {https://fis.uni-bamberg.de/handle/uniba/108391},
  language = {eng},
  abstract = {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.},
  keywords = {Propaganda}
}

@article{benzmuller2025_108389,
  title = {Who finds the short proof? : Searching for Wormholes in Proof-Space},
  author = {Benzmüller, Christoph},
  year = {2025},
  pages = {6},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1083893},
  url = {https://fis.uni-bamberg.de/handle/uniba/108389},
  language = {eng},
  abstract = {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},
  keywords = {short proof}
}

@article{benzmuller2025_107698,
  title = {Notes on Gödel’s and Scott’s variants of the ontological argument},
  author = {Benzmüller, Christoph and Scott, Dana},
  year = {2025},
  journal = {Monatshefte für Mathematik},
  volume = {208},
  number = {4},
  pages = {569-611},
  publisher = {Springer},
  address = {Wien [u.a.]},
  issn = {1436-5081},
  doi = {10.1007/s00605-025-02078-x},
  url = {https://fis.uni-bamberg.de/handle/uniba/107698},
  language = {eng},
  abstract = {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.},
  keywords = {Gödel’s ontological argument, Interactive and automated theorem proving, Higher-order modal logic}
}

@inproceedings{fuenmayor2025_107566,
  title = {Towards StarExec in the Cloud},
  author = {Fuenmayor, David and McKeown, Jack and Sutcliffe, Geoff},
  year = {2025},
  volume = {21},
  pages = {45-60},
  publisher = {EasyChair},
  issn = {2515-1762},
  doi = {10.29007/nsxs},
  url = {https://fis.uni-bamberg.de/handle/uniba/107566},
  language = {eng}
}

@inproceedings{fuenmayor2025_107401,
  title = {Searching for Wormholes in Proof-Space},
  author = {Fuenmayor, David and Benzmüller, Christoph},
  year = {2025},
  booktitle = {Proceedings of the 14th and 15th International Workshops on the Implementation of Logics},
  number = {21},
  pages = {15-17},
  issn = {2515-1762},
  doi = {10.29007/fc89},
  url = {https://fis.uni-bamberg.de/handle/uniba/107401},
  language = {eng}
}

@article{benzmuller2025_106964,
  title = {Notes on Gödel's and Scott's Variants of the Ontological Argument (Isabelle/HOL dataset)},
  author = {Benzmüller, Christoph and Scott, Dana S.},
  year = {2025},
  journal = {Archive of Formal Proofs},
  issn = {2150-914x},
  url = {https://fis.uni-bamberg.de/handle/uniba/106964},
  language = {eng}
}

@misc{lawniczak2025_106261,
  title = {Logical Modalities within the European AI Act : An Analysis},
  author = {Lawniczak, Lara and Benzmüller, Christoph},
  year = {2025},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2501.19112},
  url = {https://fis.uni-bamberg.de/handle/uniba/106261},
  language = {eng},
  abstract = {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.},
  keywords = {European AI Act, Modalities, Non-classical logics, Higher-order Logic, Proof Assistants, Automated Reasoning}
}

@article{steen2025_106288,
  title = {Solving quantified modal logic problems by translation to classical logics},
  author = {Steen, Alexander and Sutcliffe, Geoff and Benzmüller, Christoph},
  year = {2025},
  journal = {Journal of logic and computation},
  volume = {35},
  number = {4, exaf006},
  pages = {1-23},
  publisher = {Oxford Univ. Press},
  address = {Eynsham, Oxford},
  issn = {1465-363X},
  doi = {10.1093/logcom/exaf006},
  url = {https://fis.uni-bamberg.de/handle/uniba/106288},
  language = {eng},
  abstract = {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.},
  keywords = {Non-classical logics, Quantified modal logics, Higher-order logic, First-order logic, Automated theorem proving}
}

@article{kirchner2025_106098,
  title = {Computer-Verified Foundations of Metaphysics},
  author = {Kirchner, Daniel},
  year = {2025},
  pages = {95-98},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-1060980},
  url = {https://fis.uni-bamberg.de/handle/uniba/106098},
  language = {eng},
  abstract = {-},
  keywords = {Metaphysics}
}

@article{parent2024_111089,
  title = {Conditional normative reasoning as a fragment of HOL},
  author = {Parent, Xavier and Benzmüller, Christoph},
  year = {2024},
  pages = {561-592},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-111089x},
  url = {https://fis.uni-bamberg.de/handle/uniba/111089},
  language = {eng},
  abstract = {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.},
  keywords = {Conditional obligation, correspondence, population ethics, mere addition/repugnant conclusion paradox, weakenings of transitivity}
}

@book{benzmuller2024_105539,
  title = {Proceedings of the 5th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2024), Nancy, France, July 1, 2024},
  editor = {Benzmüller, Christoph and Otten, Jens and Ramanayake, Revantha},
  year = {2024},
  url = {https://fis.uni-bamberg.de/handle/uniba/105539},
  language = {eng}
}

@inproceedings{passeto2024_105540,
  title = {Implementing the Fatio Protocol for Multi-Agent Argumentation in LogiKEy},
  author = {Passeto, Luca and Benzmüller, Christoph},
  year = {2024},
  booktitle = {Proceedings of the 5th International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2024), Nancy, France, July 1, 2024},
  pages = {38-47},
  urn = {urn:nbn:de:0074-3875-4},
  url = {https://fis.uni-bamberg.de/handle/uniba/105540},
  language = {eng}
}

@misc{wasenmuller2024_105541,
  title = {Script-Based Dialog Policy Planning for LLM-Powered Conversational Agents : A Basic Architecture for an "AI Therapist"},
  author = {Wasenmüller, Robert and Hilbert, Kevin and Benzmüller, Christoph},
  year = {2024},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2412.15242},
  url = {https://fis.uni-bamberg.de/handle/uniba/105541},
  language = {eng},
  abstract = {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.},
  keywords = {Large Language Model (LLM)}
}

@incollection{vestrucci2024_105272,
  title = {Kurt Gödel and the Logical Existence of God},
  author = {Vestrucci, Andrea and Benzmüller, Christoph},
  year = {2024},
  booktitle = {Divined explanations : the theological and philosophical context for the development of the sciences (1600-2000).},
  pages = {255-285},
  publisher = {Brill},
  address = {Leiden},
  isbn = {978-90-04-70188-5},
  doi = {10.1163/9789004701908\_013},
  url = {https://fis.uni-bamberg.de/handle/uniba/105272},
  language = {eng}
}

@phdthesis{martinpena2024_104711,
  title = {Responsible decision-making in trustworthy human-AI interaction : linking counterfactual explanations and regret},
  author = {Martin Pena, Rosa},
  year = {2024},
  publisher = {Universidad de Valladolid},
  address = {Valladolid},
  doi = {10.35376/10324/71450},
  url = {https://fis.uni-bamberg.de/handle/uniba/104711},
  language = {eng},
  school = {Otto-Friedrich-Universität Bamberg}
}

@misc{steen2024_104325,
  title = {Künstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen},
  editor = {Steen, Alexander and Benzmüller, Christoph},
  year = {2024},
  volume = {38},
  number = {1-2, Non-Classical Reasoning},
  publisher = {Springer},
  address = {Berlin},
  issn = {0933-1875},
  url = {https://fis.uni-bamberg.de/handle/uniba/104325},
  language = {eng}
}

@article{kirchner2024_104324,
  title = {Computer-Verified Foundations of Metaphysics},
  author = {Kirchner, Daniel},
  year = {2024},
  journal = {Künstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen},
  volume = {38},
  number = {1-2},
  pages = {95-98},
  publisher = {Springer},
  address = {Berlin},
  issn = {1610-1987},
  doi = {10.1007/s13218-024-00834-z},
  url = {https://fis.uni-bamberg.de/handle/uniba/104324},
  language = {eng},
  abstract = {-},
  keywords = {Metaphysics}
}

@article{parent2024_98211,
  title = {Conditional normative reasoning as a fragment of HOL},
  author = {Parent, Xavier and Benzmüller, Christoph},
  year = {2024},
  journal = {Journal of Applied Non-Classical Logics},
  volume = {34},
  number = {4},
  pages = {561-592},
  publisher = {Taylor \& Francis},
  address = {London},
  issn = {1166-3081},
  doi = {10.1080/11663081.2024.2386917},
  url = {https://fis.uni-bamberg.de/handle/uniba/98211},
  language = {eng},
  abstract = {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.},
  keywords = {Conditional obligation, correspondence, population ethics, mere addition/repugnant conclusion paradox, weakenings of transitivity}
}

@incollection{benzmuller2024_98158,
  title = {Logikbasierte Wissensverarbeitung},
  author = {Benzmüller, Christoph},
  year = {2024},
  booktitle = {Künstliche Intelligenz für Lehrkräfte : Eine fachliche Einführung mit didaktischen Hinweisen},
  pages = {139-162},
  publisher = {Springer Vieweg},
  address = {Wiesbaden},
  isbn = {978-3-658-44247-7},
  doi = {10.1007/978-3-658-44248-4\_11},
  url = {https://fis.uni-bamberg.de/handle/uniba/98158},
  language = {deu}
}

@incollection{furbach2024_98159,
  title = {Schließen aus Wissen},
  author = {Furbach, Ulrich and Benzmüller, Christoph},
  year = {2024},
  booktitle = {Künstliche Intelligenz für Lehrkräfte : Eine fachliche Einführung mit didaktischen Hinweisen},
  pages = {39-50},
  publisher = {Springer Vieweg},
  address = {Wiesbaden},
  isbn = {978-3-658-44247-7},
  doi = {10.1007/978-3-658-44248-4\_4},
  url = {https://fis.uni-bamberg.de/handle/uniba/98159},
  language = {deu}
}

@incollection{hoper2024_98067,
  title = {Verantwortung},
  author = {Höper, Lukas and Schulte, Carsten and Benzmüller, Christoph},
  year = {2024},
  booktitle = {Künstliche Intelligenz für Lehrkräfte : Eine fachliche Einführung mit didaktischen Hinweisen},
  pages = {219-242},
  publisher = {Springer Vieweg},
  address = {Wiesbaden},
  isbn = {978-3-658-44247-7},
  doi = {10.1007/978-3-658-44248-4\_16},
  url = {https://fis.uni-bamberg.de/handle/uniba/98067},
  language = {deu}
}

@misc{solopova2024_95775,
  title = {Check News in One Click : NLP-Empowered Pro-Kremlin Propaganda Detection},
  author = {Solopova, Veronika and Herman, Viktoriia and Benzmüller, Christoph and Landgraf, Tim},
  year = {2024},
  pages = {1-8},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-957750},
  url = {https://fis.uni-bamberg.de/handle/uniba/95775},
  language = {eng},
  abstract = {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.},
  keywords = {News}
}

@inproceedings{solopova2024_95237,
  title = {AI-powered automatic feedback on reflective writing},
  author = {Solopova, Veronika and Romeike, Ralf and Gläser-Zikuda, Michaela and Benzmüller, Christoph and Landgraf, Tim and Hofmann, Florian and Schießl, Jessica and Zhang, Chengming and Plößl, Lea and Witte, Sascha},
  year = {2024},
  booktitle = {Annual Conference of the European Teacher Education Network (ETEN) “Teacher Education – Connecting Glocal”},
  pages = {1-13},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  doi = {10.20378/irb-95237},
  urn = {urn:nbn:de:bvb:473-irb-952379},
  url = {https://fis.uni-bamberg.de/handle/uniba/95237},
  language = {eng},
  abstract = {-},
  keywords = {AI, reflective writing, automatic feedback}
}

@inproceedings{benzmuller2024_96832,
  title = {The LogiKEy Methodology : Applications in AI Ethics and Prospects in Logic Teaching},
  author = {Benzmüller, Christoph and Fuenmayor, David},
  year = {2024},
  booktitle = {Formal Methods and Science in Philosophy V, International Conference, Book of AbstractS},
  pages = {9-10},
  address = {Zagreb},
  url = {https://fis.uni-bamberg.de/handle/uniba/96832},
  language = {eng}
}

@inproceedings{muhlenbeck2024_96833,
  title = {On the Maximum of Positive Properties and Modal Collapse in Gödel’s Ontological Argument Compared to its Variants},
  author = {Mühlenbeck, Cordelia and Benzmüller, Christoph},
  year = {2024},
  booktitle = {Formal Methods and Science in Philosophy V, International Conference, Book of Abstracts},
  pages = {31-32},
  address = {Zagreb},
  url = {https://fis.uni-bamberg.de/handle/uniba/96833},
  language = {eng}
}

@article{steen2024_96576,
  title = {Challenges for Non-Classical Reasoning in Contemporary AI Applications},
  author = {Steen, Alexander and Benzmüller, Christoph},
  year = {2024},
  journal = {Künstliche Intelligenz : KI},
  volume = {38},
  number = {1-2},
  pages = {7-16},
  publisher = {Springer Nature},
  address = {Berlin},
  issn = {1610-1987},
  doi = {10.1007/s13218-024-00855-8},
  url = {https://fis.uni-bamberg.de/handle/uniba/96576},
  language = {eng},
  abstract = {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.},
  keywords = {AI Applications}
}

@article{steen2024_96577,
  title = {Non-Classical Reasoning for Contemporary AI Applications},
  author = {Steen, Alexander and Benzmüller, Christoph},
  year = {2024},
  journal = {Künstliche Intelligenz : KI},
  volume = {38},
  number = {1-2},
  pages = {3-5},
  publisher = {Springer Science and Business Media LLC},
  address = {Berlin},
  issn = {1610-1987},
  doi = {10.1007/s13218-024-00857-6},
  url = {https://fis.uni-bamberg.de/handle/uniba/96577},
  language = {eng},
  abstract = {-},
  keywords = {AI Applications}
}

@book{benzmuller2024_96328,
  title = {Automated Reasoning : 12th International Joint Conference : IJCAR 2024 ; Nancy, France, July 3–6, 2024;  Proceedings},
  editor = {Benzmüller, Christoph and Heule, Marijn J.H. and Schmidt, Renate A.},
  year = {2024},
  publisher = {Springer Nature Switzerland},
  address = {Cham},
  isbn = {978-3-031-63498-7},
  doi = {10.1007/978-3-031-63501-4},
  url = {https://fis.uni-bamberg.de/handle/uniba/96328},
  language = {eng}
}

@book{benzmuller2024_96329,
  title = {Automated Reasoning : 12th International Joint Conference : IJCAR 2024 ; Nancy, France, July 3–6, 2024 ; Proceedings},
  editor = {Benzmüller, Christoph and Schmidt, Renate A. and Heule, Marijn J.H.},
  year = {2024},
  publisher = {Springer Nature Switzerland},
  address = {Cham},
  isbn = {978-3-031-63498-7},
  doi = {10.1007/978-3-031-63498-7},
  url = {https://fis.uni-bamberg.de/handle/uniba/96329},
  language = {eng}
}

@book{vestrucci2024_96318,
  title = {Digital Sapiens : Decidere con l'intelligenza artificiale},
  author = {Vestrucci, Andrea and Lattanzi, Nicola},
  year = {2024},
  publisher = {Castelvecchi},
  address = {Rom},
  isbn = {979-1-256-14051-0},
  url = {https://fis.uni-bamberg.de/handle/uniba/96318},
  language = {ita}
}

@incollection{vestrucci2024_96322,
  title = {Prefazione},
  author = {Vestrucci, Andrea},
  year = {2024},
  booktitle = {Oltre la giustizia. La difesa di una prospettiva pluralistica della vita buona},
  pages = {5-16},
  publisher = {Castelvecchi},
  address = {Rom},
  isbn = {978-88-6826-507-6},
  url = {https://fis.uni-bamberg.de/handle/uniba/96322},
  language = {ita}
}

@misc{steen2024_95350,
  title = {Solving Quantified Modal Logic Problems by Translation to Classical Logics},
  author = {Steen, Alexander and Sutcliffe, Geoff and Benzmüller, Christoph},
  year = {2024},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2212.09570},
  url = {https://fis.uni-bamberg.de/handle/uniba/95350},
  language = {eng}
}

@article{parent2024_94698,
  title = {Conditional normative reasoning as a fragment of HOL (Isabelle/HOL dataset)},
  author = {Parent, Xavier and Benzmüller, Christoph},
  year = {2024},
  journal = {Archive of Formal Proofs},
  issn = {2150-914X},
  url = {https://fis.uni-bamberg.de/handle/uniba/94698},
  language = {eng}
}

@inproceedings{solopova2024_94661,
  title = {Check News in One Click : NLP-Empowered Pro-Kremlin Propaganda Detection},
  author = {Solopova, Veronika and Herman, Viktoriia and Benzmüller, Christoph and Landgraf, Tim},
  year = {2024},
  booktitle = {Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics : System Demonstrations},
  pages = {44-51},
  publisher = {Association for Computational Linguistics},
  address = {St. Julians, Malta},
  url = {https://fis.uni-bamberg.de/handle/uniba/94661},
  language = {eng},
  abstract = {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.},
  keywords = {Propaganda}
}

@article{benzmuller2024_94634,
  title = {Who finds the short proof? : Searching for Wormholes in Proof-Space},
  author = {Benzmüller, Christoph},
  year = {2024},
  journal = {Dagstuhl Reports : Dokumentationen zu Dagstuhl-Seminaren und Dagstuhl-Perspektiven-Workshops},
  volume = {13},
  number = {10},
  pages = {6},
  publisher = {Schloss Dagstuhl},
  address = {Wadern},
  issn = {2192-5283},
  doi = {10.4230/DagRep.13.10.1},
  url = {https://fis.uni-bamberg.de/handle/uniba/94634},
  language = {eng},
  abstract = {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},
  keywords = {short proof}
}

@article{benzmuller2024_94348,
  title = {Modelling Value-Oriented Legal Reasoning in LogiKEy},
  author = {Benzmüller, Christoph and Fuenmayor, David and Lomfeld, Bertram},
  year = {2024},
  journal = {Logics},
  volume = {2},
  number = {1},
  pages = {31-78},
  publisher = {MDPI AG},
  address = {Basel, Switzerland},
  issn = {2813-0405},
  doi = {10.3390/logics2010003},
  url = {https://fis.uni-bamberg.de/handle/uniba/94348},
  language = {eng},
  abstract = {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.},
  keywords = {legal balancing; value-oriented reasoning, automated theorem proving, logical pluralism, proof assistants, Isabelle/HOL}
}

@misc{solopova2024_93777,
  title = {Check News in One Click : NLP-Empowered Pro-Kremlin Propaganda Detection},
  author = {Solopova, Veronika and Herman, Viktoriia and Benzmüller, Christoph and Landgraf, Tim},
  year = {2024},
  pages = {1-8},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2401.15717},
  url = {https://fis.uni-bamberg.de/handle/uniba/93777},
  language = {eng},
  abstract = {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.},
  keywords = {News}
}

@inproceedings{benzmuller2024_93108,
  title = {Is HOL (as a metalogic) all we need for flexible normative reasoning?},
  author = {Benzmüller, Christoph},
  year = {2024},
  pages = {22},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-931087},
  url = {https://fis.uni-bamberg.de/handle/uniba/93108},
  language = {eng},
  abstract = {-},
  keywords = {HOL}
}

@misc{solopova2024_93073,
  title = {PapagAI : Automated Feedback for Reflective Essays},
  author = {Solopova, Veronika and Gruszczynski, Adrian and Rostom, Eiad and Cremer, Fritz and Witte, Sascha and Zhang, Chengming and López, Fernando Ramos and Plößl, Lea and Hofmann, Florian and Romeike, Ralf and Gläser-Zikuda, Michaela and Benzmüller, Christoph and Landgraf, Tim},
  year = {2024},
  pages = {1-12},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-930730},
  url = {https://fis.uni-bamberg.de/handle/uniba/93073},
  language = {eng},
  abstract = {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.},
  keywords = {Automated feedback, Dialogue, Hybrid AI, NLP}
}

@article{benzmuller2024_93057,
  title = {Church’s Type Theory},
  author = {Benzmüller, Christoph and Andrews, Peter},
  year = {2024},
  journal = {Stanford encyclopedia of philosophy},
  address = {Stanford, Calif.},
  issn = {1095-5054},
  url = {https://fis.uni-bamberg.de/handle/uniba/93057},
  language = {eng}
}

@article{steen2024_92592,
  title = {What are Non-classical Logics and Why Do We Need Them? : An Extended Interview with Dov Gabbay and Leon van der Torre},
  author = {Steen, Alexander and Benzmüller, Christoph},
  year = {2024},
  journal = {Künstliche Intelligenz : KI ; Forschung, Entwicklung, Erfahrungen},
  number = {Online-First},
  publisher = {Springer},
  address = {Berlin},
  issn = {0933-1875},
  doi = {10.1007/s13218-023-00824-7},
  url = {https://fis.uni-bamberg.de/handle/uniba/92592},
  language = {eng}
}

@article{bayer2024_92522,
  title = {Mathematical Proof Between Generations},
  author = {Bayer, Jonas and Benzmüller, Christoph and Buzzard, Kevin and David, Marco and Lamport, Leslie and Matiyasevich, Yuri and Paulson, Lawrence and Schleicher, Dierk and Stock, Benedikt and Zelmanov, Efim},
  year = {2024},
  journal = {Notices of the American Mathematical Society},
  volume = {71},
  number = {1},
  pages = {79-92},
  issn = {0002-9920},
  doi = {10.1090/noti2860},
  url = {https://fis.uni-bamberg.de/handle/uniba/92522},
  language = {eng}
}

@article{steen2024_91044,
  title = {A formalization of abstract argumentation in higher-order logic},
  author = {Steen, Alexander and Fuenmayor, David},
  year = {2024},
  journal = {Journal of Logic and Computation},
  volume = {34},
  number = {2},
  pages = {229-260},
  publisher = {Oxford University Press (OUP)},
  address = {Eynsham},
  issn = {0955-792X},
  doi = {10.1093/logcom/exac027},
  url = {https://fis.uni-bamberg.de/handle/uniba/91044},
  language = {eng}
}

@article{benzmuller2024_57954,
  title = {Who Finds the Short Proof?},
  author = {Benzmüller, Christoph and Fuenmayor, David and Steen, Alexander and Sutcliffe, Geoff},
  year = {2024},
  journal = {Logic journal of the IGPL},
  volume = {32},
  number = {3},
  pages = {442-464},
  publisher = {Oxford University Press},
  address = {Oxford [u.a.]},
  issn = {1368-9894},
  doi = {10.1093/jigpal/jzac082},
  url = {https://fis.uni-bamberg.de/handle/uniba/57954},
  language = {eng}
}

@inproceedings{benzmuller2023_117507,
  title = {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},
  editor = {Benzmüller, Christoph and Otten, Jens},
  year = {2023},
  series = {CEUR-WS},
  urn = {urn:nbn:de:0074-3326-4},
  url = {https://fis.uni-bamberg.de/handle/uniba/117507},
  language = {eng}
}

@misc{albert2023_110285,
  title = {Artifact of the Paper "Formally Verified EVM Block-Optimizations"},
  author = {Albert, Elvira and Genaim, Samir and Kirchner, Daniel and Martin-Martin, Enrique},
  year = {2023},
  number = {Published April 24, 2023},
  publisher = {Zenodo},
  doi = {10.5281/zenodo.7858277},
  url = {https://fis.uni-bamberg.de/handle/uniba/110285},
  language = {eng}
}

@incollection{vestrucci2023_96320,
  title = {A Journey Beyond Babel},
  author = {Vestrucci, Andrea},
  year = {2023},
  booktitle = {Beyond Babel: Religion and Linguistic Pluralism},
  pages = {1-12},
  publisher = {Springer International Publishing},
  address = {Cham},
  isbn = {978-3-031-42126-6},
  doi = {10.1007/978-3-031-42127-3\_1},
  url = {https://fis.uni-bamberg.de/handle/uniba/96320},
  language = {eng}
}

@book{vestrucci2023_96319,
  title = {Beyond Babel : Religion and Linguistic Pluralism},
  editor = {Vestrucci, Andrea},
  year = {2023},
  publisher = {Springer International Publishing},
  address = {Cham},
  series = {Sophia Studies in Cross-cultural Philosophy of Traditions and Cultures},
  isbn = {978-3-031-42127-3},
  doi = {10.1007/978-3-031-42127-3},
  url = {https://fis.uni-bamberg.de/handle/uniba/96319},
  language = {eng}
}

@inproceedings{benzmuller2023_91647,
  title = {Is HOL (as a metalogic) all we need for flexible normative reasoning?},
  author = {Benzmüller, Christoph},
  year = {2023},
  volume = {13},
  number = {4},
  pages = {22},
  publisher = {Schloss Dagstuhl},
  address = {Wadern},
  issn = {2192-5283},
  doi = {10.4230/dagrep.13.4.1},
  urn = {urn:nbn:de:0030-drops-192367},
  url = {https://fis.uni-bamberg.de/handle/uniba/91647},
  language = {eng},
  abstract = {-},
  keywords = {HOL}
}

@incollection{benzmuller2023_91648,
  title = {A Simplified Variant of Gödel’s Ontological Argument},
  author = {Benzmüller, Christoph},
  year = {2023},
  booktitle = {Beyond Babel : Religion and Linguistic Pluralism},
  pages = {271-286},
  publisher = {Springer International Publishing},
  address = {Cham},
  edition = {1},
  isbn = {978-3-031-42126-6},
  doi = {10.1007/978-3-031-42127-3\_19},
  url = {https://fis.uni-bamberg.de/handle/uniba/91648},
  language = {eng}
}

@inproceedings{kirchner2023_90216,
  title = {Formally Verified EVM Block-Optimizations},
  author = {Kirchner, Daniel and Genaim, Samir and Albert, Elvira and Martin-Martin, Enrique},
  year = {2023},
  pages = {176-189},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-902169},
  url = {https://fis.uni-bamberg.de/handle/uniba/90216},
  language = {eng},
  abstract = {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.},
  keywords = {Coq, Ethereum Virtual Machine, Smart Contracts, Optimization, Theorem Proving}
}

@inproceedings{rothgang2023_91274,
  title = {Theorem Proving in Dependently-Typed Higher-Order Logic},
  author = {Rothgang, Colin and Rabe, Florian and Benzmüller, Christoph},
  year = {2023},
  pages = {438-455},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  series = {Lecture Notes in Computer Science},
  urn = {urn:nbn:de:bvb:473-irb-912744},
  url = {https://fis.uni-bamberg.de/handle/uniba/91274},
  language = {eng},
  abstract = {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.},
  keywords = {Dependently-Typed Higher-Order Logic}
}

@misc{parent2023_91043,
  title = {Normative Conditional Reasoning as a Fragment of HOL},
  author = {Parent, Xavier and Benzmüller, Christoph},
  year = {2023},
  pages = {1-22},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-910431},
  url = {https://fis.uni-bamberg.de/handle/uniba/91043},
  language = {eng},
  abstract = {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.},
  keywords = {Conditional obligation, betterness, Isabelle/HOL, automated theorem proving, population ethics, mere addition/repugnant conclusion paradox}
}

@inproceedings{solopova2023_90982,
  title = {PapagAI : Automated Feedback for Reflective Essays},
  author = {Solopova, Veronika and Rostom, Eiad and Cremer, Fritz and Gruszczynski, Adrian and Witte, Sascha and Zhang, Chengming and López, Fernando Ramos and Plößl. Lea and Romeike, Ralf and Gläser-Zikuda, Michaela and Hofmann, Florian and Landgraf, Tim and Benzmüller, Christoph},
  year = {2023},
  booktitle = {KI 2023: Advances in Artificial Intelligence : 46th German Conference on AI, Berlin, Germany, September 26–29, 2023 ; Proceedings},
  pages = {198-206},
  publisher = {Springer},
  address = {Cham},
  isbn = {978-3-031-42607-0},
  doi = {10.1007/978-3-031-42608-7\_16},
  url = {https://fis.uni-bamberg.de/handle/uniba/90982},
  language = {eng}
}

@inproceedings{solopova2023_90475,
  title = {The Evolution of Pro-Kremlin Propaganda From a Machine Learning and Linguistics Perspective},
  author = {Solopova, Veronika and Benzmüller, Christoph and Landgraf, Tim},
  year = {2023},
  pages = {40-48},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-904758},
  url = {https://fis.uni-bamberg.de/handle/uniba/90475},
  language = {eng},
  abstract = {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.},
  keywords = {Propaganda}
}

@inproceedings{rothgang2023_90500,
  title = {Theorem Proving in Dependently-Typed Higher-Order Logic},
  author = {Rothgang, Colin and Rabe, Florian and Benzmüller, Christoph},
  year = {2023},
  booktitle = {Automated Deduction – CADE 29 : 29th International Conference on Automated Deduction, Rome, Italy, July 1–4, 2023, Proceedings},
  pages = {438-455},
  publisher = {Springer Nature Switzerland},
  address = {Cham},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-031-38498-1},
  doi = {10.1007/978-3-031-38499-8\_25},
  url = {https://fis.uni-bamberg.de/handle/uniba/90500},
  language = {eng},
  abstract = {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.},
  keywords = {Dependently-Typed Higher-Order Logic}
}

@inproceedings{bayer2023_90343,
  title = {Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation},
  author = {Bayer, Jonas and Gonus, Alexey and Benzmüller, Christoph and Scott, Dana S.},
  year = {2023},
  booktitle = {Intelligent Computer Mathematics : 16th International Conference, CICM 2023, Cambridge, UK, , September 5–8, 2023 Proceedings},
  pages = {69-83},
  publisher = {Springer Nature Switzerland},
  address = {Cham},
  series = {Lecture Notes in Artificial Intelligence},
  isbn = {9783031427527},
  doi = {10.1007/978-3-031-42753-4\_5},
  url = {https://fis.uni-bamberg.de/handle/uniba/90343},
  language = {eng}
}

@article{fuenmayor2023_90304,
  title = {Semantical investigations on non-classical logics with recovery operators: negation},
  author = {Fuenmayor, David},
  year = {2023},
  journal = {Logic Journal of the IGPL},
  number = {Online-First},
  pages = {1-42},
  publisher = {Oxford University Press},
  address = {Oxford},
  issn = {1367-0751},
  doi = {10.1093/jigpal/jzad013},
  url = {https://fis.uni-bamberg.de/handle/uniba/90304},
  language = {eng}
}

@book{passon2023_90223,
  title = {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},
  editor = {Passon, Oliver and Benzmüller, Christoph and Falkenburg, Brigitte},
  year = {2023},
  publisher = {Springer Spektrum Berlin},
  address = {Heidelberg},
  edition = {1},
  isbn = {978-3-662-67044-6},
  doi = {10.1007/978-3-662-67045-3},
  url = {https://fis.uni-bamberg.de/handle/uniba/90223},
  language = {eng}
}

@incollection{steen2023_90114,
  title = {Solving Modal Logic Problems by Translation to Higher-Order Logic},
  author = {Steen, Alexander and Sutcliffe, Geoff and Scholl, Tobias and Benzmüller, Christoph},
  year = {2023},
  booktitle = {Logic and Argumentation : 5th International Conference, CLAR 2023, Hangzhou, China, September 10-12, 2023 ; Proceedings},
  pages = {25-43},
  publisher = {Springer Nature Switzerland},
  address = {Cham},
  isbn = {978-3-031-40874-8},
  doi = {10.1007/978-3-031-40875-5\_3},
  url = {https://fis.uni-bamberg.de/handle/uniba/90114},
  language = {eng}
}

@misc{parent2023_90106,
  title = {Normative Conditional Reasoning as a Fragment of HOL},
  author = {Parent, Xavier and Benzmüller, Christoph},
  year = {2023},
  pages = {1-22},
  publisher = {arXiv},
  address = {Online},
  doi = {10.48550/arxiv.2308.10686},
  url = {https://fis.uni-bamberg.de/handle/uniba/90106},
  language = {eng},
  abstract = {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.},
  keywords = {Conditional obligation, betterness, Isabelle/HOL, automated theorem proving, population ethics, mere addition/repugnant conclusion paradox}
}

@inproceedings{solopova2023_59601,
  title = {The Evolution of Pro-Kremlin Propaganda From a Machine Learning and Linguistics Perspective},
  author = {Solopova, Veronika and Benzmüller, Christoph and Landgraf, Tim},
  year = {2023},
  booktitle = {Proceedings of the Second Ukrainian Natural Language Processing Workshop (UNLP 2023)},
  pages = {40-48},
  address = {Dubrovnik},
  isbn = {978-1-959429-52-4},
  doi = {10.18653/v1/2023.unlp-1.5},
  url = {https://fis.uni-bamberg.de/handle/uniba/59601},
  language = {eng},
  abstract = {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.},
  keywords = {Propaganda}
}

@inproceedings{kirchner2023_89789,
  title = {Formally Verified EVM Block-Optimizations},
  author = {Kirchner, Daniel and Genaim, Samir and Albert, Elvira and Martin-Martin, Enrique},
  year = {2023},
  booktitle = {Computer Aided Verification : 35th International Conference, CAV 2023, Paris, France, July 17–22, 2023, Proceedings, Part III},
  pages = {176-189},
  publisher = {Springer Nature Switzerland},
  address = {Cham},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-031-37709-9},
  doi = {10.1007/978-3-031-37709-9\_9},
  url = {https://fis.uni-bamberg.de/handle/uniba/89789},
  language = {eng},
  abstract = {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.},
  keywords = {Coq, Ethereum Virtual Machine, Smart Contracts, Optimization, Theorem Proving}
}

@misc{solopova2023_89646,
  title = {PapagAI : Automated Feedback for Reflective Essays},
  author = {Solopova, Veronika and Gruszczynski, Adrian and Rostom, Eiad and Cremer, Fritz and Witte, Sascha and Zhang, Chengming and López, Fernando Ramos and Plößl, Lea and Hofmann, Florian and Romeike, Ralf and Gläser-Zikuda, Michaela and Benzmüller, Christoph and Landgraf, Tim},
  year = {2023},
  pages = {1-12},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2307.07523},
  url = {https://fis.uni-bamberg.de/handle/uniba/89646},
  language = {eng},
  abstract = {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.},
  keywords = {Automated feedback, Dialogue, Hybrid AI, NLP}
}

@inproceedings{benzmuller2023_59552,
  title = {Mathematical Proof Assistants for Teaching Logic : the LogiKEy Methodology},
  author = {Benzmüller, Christoph and Fuenmayor, David},
  year = {2023},
  booktitle = {Book of Abstracts : International Congress Tools for Teaching Logic V},
  pages = {1-3},
  address = {Madrid},
  doi = {10.20378/irb-59552},
  urn = {urn:nbn:de:bvb:473-irb-595525},
  url = {https://fis.uni-bamberg.de/handle/uniba/59552},
  language = {eng},
  abstract = {-},
  keywords = {AI, LogiKEy}
}

@misc{benzmuller2023_59850,
  title = {Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation},
  author = {Benzmüller, Christoph and Bayer, Jonas and Gonus, Aleksey and Scott, Dana S.},
  year = {2023},
  pages = {1-16},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-598500},
  url = {https://fis.uni-bamberg.de/handle/uniba/59850},
  language = {eng},
  abstract = {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.},
  keywords = {Formalization of mathematics, Category theory, Proof assistants, Formal methods, Shallow embeddings}
}

@misc{benzmuller2023_59804,
  title = {Category Theory in Isabelle/HOL as a Basis for Meta-logical Investigation},
  author = {Benzmüller, Christoph and Bayer, Jonas and Gonus, Aleksey and Scott, Dana S.},
  year = {2023},
  pages = {1-16},
  publisher = {arXiv},
  doi = {10.48550/ARXIV.2306.09074},
  url = {https://fis.uni-bamberg.de/handle/uniba/59804},
  language = {eng},
  abstract = {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.},
  keywords = {Formalization of mathematics, Category theory, Proof assistants, Formal methods, Shallow embeddings}
}

@inproceedings{benzmuller2023_59671,
  title = {Reasonable, Trusted AI through Symbolic Ethico-legal Control and Reflection? (Keynote Abstract)},
  author = {Benzmüller, Christoph},
  year = {2023},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-596715},
  url = {https://fis.uni-bamberg.de/handle/uniba/59671},
  language = {eng},
  abstract = {-},
  keywords = {artificial intelligence, AI}
}

@article{benzmuller2023_59658,
  title = {Automated Multilingual Detection of Pro-Kremlin Propaganda in Newspapers and Telegram Posts},
  author = {Benzmüller, Christoph and Solopova, Veronika and Popescu, Oana-Iuliana and Landgraf, Tim},
  year = {2023},
  pages = {5-14},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-596589},
  url = {https://fis.uni-bamberg.de/handle/uniba/59658},
  language = {eng},
  abstract = {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.},
  keywords = {Propaganda, Fake news, NLP, Kremlin, Ukraine, Automated Content Moderation}
}

@inproceedings{benzmuller2023_59598,
  title = {Reasonable, Trusted AI through Symbolic Ethico-legal Control and Reflection? (Keynote Abstract)},
  author = {Benzmüller, Christoph},
  year = {2023},
  booktitle = {Proceedings of FLAIRS-36, May 14-17, 2023, Clearwater Beach, FL},
  volume = {2023},
  number = {36},
  publisher = {LibraryPress@UF},
  address = {Florida},
  series = {The Florida Artificial Interlligence Research Society},
  doi = {10.32473/flairs.36},
  url = {https://fis.uni-bamberg.de/handle/uniba/59598},
  language = {eng},
  abstract = {-},
  keywords = {artificial intelligence, AI}
}

@misc{rothgang2023_59544,
  title = {Theorem Proving in Dependently-Typed Higher-Order Logic : Extended Preprint},
  author = {Rothgang, Colin and Rabe, Florian and Benzmüller, Christoph},
  year = {2023},
  number = {arXiv:2305.15382},
  publisher = {arXiv},
  doi = {10.48550/ARXIV.2305.15382},
  url = {https://fis.uni-bamberg.de/handle/uniba/59544},
  language = {eng}
}

@misc{baroni2023_58579,
  title = {Journal of logic and computation},
  editor = {Baroni, Pietro and Benzmüller, Christoph and Wáng, Yì},
  year = {2023},
  volume = {33},
  number = {2, Special Issue: Logic and Argumentation},
  publisher = {Oxford University Press},
  address = {Eynsham, Oxford},
  issn = {0955-792X},
  url = {https://fis.uni-bamberg.de/handle/uniba/58579},
  language = {eng}
}

@article{benzmuller2023_58575,
  title = {Automated Multilingual Detection of Pro-Kremlin Propaganda in Newspapers and Telegram Posts},
  author = {Benzmüller, Christoph and Solopova, Veronika and Landgraf, Tim and Popescu, Oana-Iuliana},
  year = {2023},
  journal = {Datenbank-Spektrum : Zeitschrift für Datenbanktechnologie},
  volume = {25},
  number = {1},
  publisher = {Springer},
  address = {Berlin},
  issn = {1610-1995},
  doi = {10.1007/s13222-023-00437-2},
  url = {https://fis.uni-bamberg.de/handle/uniba/58575},
  language = {eng},
  abstract = {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.},
  keywords = {Propaganda, Fake news, NLP, Kremlin, Ukraine, Automated Content Moderation}
}

@misc{solopova2023_57979,
  title = {Automated multilingual detection of Pro-Kremlin propaganda in newspapers and Telegram posts},
  author = {Solopova, Veronika and Popescu, Oana-Iuliana and Benzmüller, Christoph and Landgraf, Tim},
  year = {2023},
  publisher = {arXiv},
  doi = {10.48550/ARXIV.2301.10604},
  url = {https://fis.uni-bamberg.de/handle/uniba/57979},
  language = {eng}
}

@article{baroni2023_57756,
  title = {Preface: Special Issue on Logic and Argumentation},
  author = {Baroni, Pietro and Benzmüller, Christoph and N Wáng, Yì},
  year = {2023},
  journal = {Journal of logic and computation},
  volume = {33},
  number = {2},
  pages = {189–191},
  publisher = {Oxford Univ. Press},
  address = {Eynsham, Oxford},
  issn = {1465-363X},
  doi = {10.1093/logcom/exac091},
  url = {https://fis.uni-bamberg.de/handle/uniba/57756},
  language = {eng}
}

@misc{benzmuller2023_57614,
  title = {CEUR Workshop Proceedings},
  editor = {Benzmüller, Christoph and Otten, Jens},
  year = {2023},
  number = {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)},
  publisher = {RWTH Aachen},
  address = {Aachen},
  issn = {1613-0073},
  urn = {urn:nbn:de:0074-3326-4},
  url = {https://fis.uni-bamberg.de/handle/uniba/57614},
  language = {eng}
}

@inproceedings{parent2023_57613,
  title = {Automated Verification of Deontic Correspondences in Isabelle/HOL : First Results},
  author = {Parent, Xavier and Benzmüller, Christoph},
  year = {2023},
  number = {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)},
  pages = {92-108},
  publisher = {RWTH Aachen},
  address = {Aachen, Germany},
  issn = {1613-0073},
  urn = {urn:nbn:de:0074-3326-4},
  url = {https://fis.uni-bamberg.de/handle/uniba/57613},
  language = {eng}
}

@article{vestrucci2023_57530,
  title = {Artificial Intelligence and God´s Existence : Connecting Philosophy of Religion and Computation},
  author = {Vestrucci, Andrea},
  year = {2023},
  pages = {1000-1018},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-575306},
  url = {https://fis.uni-bamberg.de/handle/uniba/57530},
  language = {eng},
  abstract = {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.},
  keywords = {artificial intelligence and religion, artificial intelligence and theology, computational metaphysics, diagonal argument, formal theology, ontological argument, theology as science, religion and technology}
}

@article{vestrucci2023_57528,
  title = {Introduction: Five steps toward a religion-AI dialogue},
  author = {Vestrucci, Andrea},
  year = {2023},
  pages = {933-937},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-575281},
  url = {https://fis.uni-bamberg.de/handle/uniba/57528},
  language = {eng},
  abstract = {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.},
  keywords = {artificial intelligence, artificial intelligence and religion, artificial intelligence and theology, imago Dei, subsymbolic artificial, intelligence; symbolic artificial intelligence, technology and religion}
}

@article{benzmuller2023_54497,
  title = {Automating public announcement logic with relativized common knowledge as a fragment of HOL in LogiKEy},
  author = {Benzmüller, Christoph and Reiche, Sebastian},
  year = {2023},
  journal = {Journal of Logic and Computation},
  volume = {33},
  number = {6},
  pages = {1243–1269},
  publisher = {Oxford Univ. Press},
  address = {Eynsham, Oxford},
  issn = {1465-363X},
  doi = {10.1093/logcom/exac029},
  url = {https://fis.uni-bamberg.de/handle/uniba/54497},
  language = {eng},
  abstract = {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.},
  keywords = {Public announcement logic; Relativized common knowledge; Semantical embedding; Higher-order logic; Proof automation}
}

@book{vestrucci2022_96321,
  title = {Philosophical Schools after 1950 : International Conference: Warsaw, May 9-10, 2022},
  author = {Vestrucci, Andrea and Łukomska, Agata and Łapiński, Filip and Rujević, Goran and Trepczyński, Marcin},
  year = {2022},
  publisher = {Wydział Filozofii Uniwersytetu Warszawskiego},
  address = {Warsaw},
  url = {https://fis.uni-bamberg.de/handle/uniba/96321},
  language = {eng}
}

@inproceedings{steen2022_91146,
  title = {Bridging Between LegalRuleML and TPTP for Automated Normative Reasoning},
  author = {Steen, Alexander and Fuenmayor, David},
  year = {2022},
  pages = {244-260},
  publisher = {Springer International Publishing},
  address = {Berlin},
  isbn = {978-3-031-21540-7},
  issn = {0302-9743},
  doi = {10.1007/978-3-031-21541-4\_16},
  url = {https://fis.uni-bamberg.de/handle/uniba/91146},
  language = {eng}
}

@article{kirchner2022_57615,
  title = {Abstract Object Theory},
  author = {Kirchner, Daniel},
  year = {2022},
  journal = {Archive of Formal Proofs},
  pages = {392},
  issn = {2150-914x},
  url = {https://fis.uni-bamberg.de/handle/uniba/57615},
  language = {eng}
}

@article{benzmuller2022_57579,
  title = {Automation of Boolos' Curious Inference in Isabelle/HOL},
  author = {Benzmüller, Christoph and Fuenmayor, David and Steen, Alexander and Sutcliffe, Geoff},
  year = {2022},
  journal = {Archive of Formal Proofs},
  issn = {2150-914x},
  url = {https://fis.uni-bamberg.de/handle/uniba/57579},
  language = {eng}
}

@phdthesis{kirchner2022_57511,
  title = {Computer-Verified Foundations of Metaphysics and an Ontology of Natural Numbers in Isabelle/HOL},
  author = {Kirchner, Daniel},
  year = {2022},
  publisher = {Refubium - Repositorium der Freien Universität Berlin},
  address = {Berlin},
  doi = {10.17169/refubium-35141},
  urn = {urn:nbn:de:kobv:188-refubium-35426-3},
  url = {https://fis.uni-bamberg.de/handle/uniba/57511},
  language = {eng},
  school = {Otto-Friedrich-Universität Bamberg}
}

@misc{steen2022_57440,
  title = {Solving QMLTP Problems by Translation to Higher-order Logic},
  author = {Steen, Alexander and Sutcliffe, Geoff and Gleißner, Tobias and Benzmüller, Christoph},
  year = {2022},
  publisher = {arXiv},
  doi = {10.48550/ARXIV.2212.09570},
  url = {https://fis.uni-bamberg.de/handle/uniba/57440},
  language = {eng}
}

@incollection{benzmuller2022_57398,
  title = {Studies in Computational Metaphysics : Results of an Interdisciplinary Research Project},
  author = {Benzmüller, Christoph},
  year = {2022},
  booktitle = {Tópicos em História e Filosofia da Computação},
  pages = {129-160},
  publisher = {University of Campinas (UNICAMP)},
  address = {Campinas, Brasilien},
  isbn = {978-65-88097-04-5},
  url = {https://fis.uni-bamberg.de/handle/uniba/57398},
  language = {eng}
}

@article{vestrucci2022_57411,
  title = {Editor's Note},
  author = {Vestrucci, Andrea and Burgos, Daniel and Oviedo, Lluis and Griffiths, Dai},
  year = {2022},
  pages = {4-5},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-574117},
  url = {https://fis.uni-bamberg.de/handle/uniba/57411},
  language = {eng},
  abstract = {Nicht verfügbar
Not available},
  keywords = {artificial intelligence (AI), spirituality, machines, automation}
}

@article{vestrucci2022_57349,
  title = {Deontic-doxastic belief revision and linear system model},
  author = {Vestrucci, Andrea},
  year = {2022},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-573494},
  url = {https://fis.uni-bamberg.de/handle/uniba/57349},
  language = {eng},
  abstract = {Nicht verfügbar
Not available},
  keywords = {belief revision, Dynamic Epistemic Logic, AGM theory, doxastic voluntarism, deontic, logic, doxastic logic, belief models, logic of belief revision}
}

@misc{fuenmayor2022_57243,
  title = {Semantical Investigations on Non-classical Logics with Recovery Operators: Negation},
  author = {Fuenmayor, David},
  year = {2022},
  pages = {1-44},
  publisher = {arXiv},
  doi = {10.48550/ARXIV.2104.04284},
  url = {https://fis.uni-bamberg.de/handle/uniba/57243},
  language = {eng}
}

@article{vestrucci2022_56867,
  title = {Deontic-doxastic belief revision and linear system model},
  author = {Vestrucci, Andrea},
  year = {2022},
  journal = {Frontiers in Psychology},
  volume = {13},
  pages = {1-5},
  issn = {1664-1078},
  doi = {10.3389/fpsyg.2022.948330},
  url = {https://fis.uni-bamberg.de/handle/uniba/56867},
  language = {eng},
  abstract = {Nicht verfügbar
Not available},
  keywords = {belief revision, Dynamic Epistemic Logic, AGM theory, doxastic voluntarism, deontic, logic, doxastic logic, belief models, logic of belief revision}
}

@article{vestrucci2022_56866,
  title = {Artificial Intelligence and God´s Existence : Connecting Philosophy of Religion and Computation},
  author = {Vestrucci, Andrea},
  year = {2022},
  journal = {Zygon : journal of religion \& science},
  volume = {57},
  number = {4},
  pages = {1000-1018},
  publisher = {Wiley-Blackwell},
  address = {Oxford},
  issn = {1467-9744},
  doi = {10.1111/zygo.12829},
  url = {https://fis.uni-bamberg.de/handle/uniba/56866},
  language = {eng},
  abstract = {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.},
  keywords = {artificial intelligence and religion, artificial intelligence and theology, computational metaphysics, diagonal argument, formal theology, ontological argument, theology as science, religion and technology}
}

@article{vestrucci2022_56865,
  title = {Introduction: Five steps toward a religion-AI dialogue},
  author = {Vestrucci, Andrea},
  year = {2022},
  journal = {Zygon : journal of religion \& science},
  volume = {57},
  number = {4},
  pages = {933-937},
  publisher = {Wiley-Blackwell},
  address = {Oxford},
  issn = {1467-9744},
  doi = {10.1111/zygo.12828},
  url = {https://fis.uni-bamberg.de/handle/uniba/56865},
  language = {eng},
  abstract = {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.},
  keywords = {artificial intelligence, artificial intelligence and religion, artificial intelligence and theology, imago Dei, subsymbolic artificial, intelligence; symbolic artificial intelligence, technology and religion}
}

@article{fehige2022_54512,
  title = {On Thought Experiments, Theology, and Mathematical Platonism},
  author = {Fehige, Yiftach and Vestrucci, Andrea},
  year = {2022},
  journal = {Axiomathes : an international journal in ontology and cognitive systems},
  volume = {32},
  number = {S1},
  pages = {1-12},
  publisher = {Springer Science + Business Media B.V},
  address = {Dordrecht [u.a.]},
  issn = {1572-8390},
  doi = {10.1007/s10516-022-09627-1},
  url = {https://fis.uni-bamberg.de/handle/uniba/54512},
  language = {eng}
}

@article{benzmuller2022_54793,
  title = {Symbolic AI and Gödel's Ontological Argument},
  author = {Benzmüller, Christoph},
  year = {2022},
  pages = {1-10},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-547934},
  url = {https://fis.uni-bamberg.de/handle/uniba/54793},
  language = {eng},
  abstract = {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.},
  keywords = {artificial intelligence, metaphysics, ontology, information, interdisciplinarity}
}

@misc{bayer2022_54593,
  title = {Mathematical Proof Between Generations},
  author = {Bayer, Jonas and Benzmüller, Christoph and Buzzard, Kevin and David, Marco and Lamport, Leslie and Matiyasevich, Yuri and Paulson, Lawrence and Schleicher, Dierk and Stock, Benedikt and Zelmanov, Efim},
  year = {2022},
  pages = {1-17},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-545931},
  url = {https://fis.uni-bamberg.de/handle/uniba/54593},
  language = {eng},
  abstract = {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.},
  keywords = {mathematical proof}
}

@inproceedings{fuenmayor2022_55968,
  title = {Formalising Basic Topology for Computational Logic in Simple Type Theory},
  author = {Fuenmayor, David and Serrano Suárez, Fabián Fernando},
  year = {2022},
  booktitle = {Intelligent Computer Mathematics : 15th International Conference, CICM 2022, Tbilisi, Georgia, September 19–23, 2022, Proceedings},
  pages = {56-74},
  publisher = {Springer},
  address = {Cham},
  series = {Lecture Notes in Computer Science},
  isbn = {978-3-031-16681-5},
  doi = {10.1007/978-3-031-16681-5\_4},
  url = {https://fis.uni-bamberg.de/handle/uniba/55968},
  language = {eng}
}

@misc{benzmuller2022_55559,
  title = {Automating Public Announcement Logic with Relativized Common Knowledge as a Fragment of HOL in LogiKEy},
  author = {Benzmüller, Christoph and Reiche, Sebastian},
  year = {2022},
  pages = {1-28},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-555593},
  url = {https://fis.uni-bamberg.de/handle/uniba/55559},
  language = {eng},
  abstract = {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.},
  keywords = {Public announcement logic; Relativized common knowledge; Semantical embedding; Higher-order logic; Proof automation}
}

@misc{benzmuller2022_55558,
  title = {Who Finds the Short Proof? : an Exploration of Variants of Boolos' Curious Inference using Higher-order Automated Theorem Provers},
  author = {Benzmüller, Christoph and Fuenmayor, David and Steen, Alexander and Sutcliffe, Geoff},
  year = {2022},
  publisher = {arXiv},
  doi = {10.48550/ARXIV.2208.06879},
  url = {https://fis.uni-bamberg.de/handle/uniba/55558},
  language = {eng}
}

@inproceedings{steen2022_55555,
  title = {Automated Reasoning in Non-classical Logics in the TPTP World},
  author = {Steen, Alexander and Fuenmayor, David and Gleißner, Tobias and Sutcliffe, Geoff and Benzmüller, Christoph},
  year = {2022},
  booktitle = {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},
  publisher = {CEUR Workshop Proceedings},
  url = {https://fis.uni-bamberg.de/handle/uniba/55555},
  language = {eng}
}

@article{benzmuller2022_55552,
  title = {Symbolic AI and Gödel's Ontological Argument},
  author = {Benzmüller, Christoph},
  year = {2022},
  journal = {Zygon : Journal of Religion and Science},
  volume = {57},
  number = {4},
  publisher = {John Wiley \& Sons, Inc},
  issn = {1467-9744},
  doi = {10.1111/zygo.12830},
  url = {https://fis.uni-bamberg.de/handle/uniba/55552},
  language = {eng},
  abstract = {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.},
  keywords = {artificial intelligence, metaphysics, ontology, information, interdisciplinarity}
}

@inproceedings{fuenmayor2022_54851,
  title = {Higher-order Logic as a Lingua Franca for Logico-Pluralist Argumentation},
  author = {Fuenmayor, David and Benzmüller, Christoph},
  year = {2022},
  booktitle = {Logics for New-Generation AI : Second International Workshop. 10-12 June 2022, Zhuhai},
  pages = {83-94},
  publisher = {College Publications},
  address = {London},
  isbn = {978-1-84890-406-4},
  url = {https://fis.uni-bamberg.de/handle/uniba/54851},
  language = {eng}
}

@article{mucha2022_54850,
  title = {Collaborative Speculations on Future Themes for Participatory Design in Germany},
  author = {Mucha, Henrik and Correia de Barros, Ana and Benjamin, Jesse Josua and Benzmüller, Christoph and Bischof, Andreas and Buchmüller, Sandra and de Carvalho, Alexandra and Dhungel, Anna-Katharina and Draude, Claude and Fleck, Marc-Julian and Jarke, Juliane and Klein, Stefanie and Kortekaas, Caroline and Kurze, Albrecht and Linke, Diane and Maas, Franzisca and Marsden, Nicola and Melo, Ricardo and Michel, Susanne and Müller-Birn, Claudia and Pröbster, Monika and Rießenberger, Katja Antonia and Schäfer, Mirko Tobias and Sörries, Peter and Stilke, Julia and Volkmann, Torben and Weibert, Anne and Weinhold, Wilhelm and Wolf, Sara and Zorn, Isabel and Heidt, Michael and Berger, Arne},
  year = {2022},
  journal = {i-com : journal of interactive media},
  volume = {21},
  number = {2},
  pages = {283-298},
  publisher = {De Gruyter},
  address = {Berlin},
  issn = {2196-6826},
  doi = {10.1515/icom-2021-0030},
  url = {https://fis.uni-bamberg.de/handle/uniba/54850},
  language = {eng}
}

@incollection{benzmuller2022_54546,
  title = {Dyadic Deontic Logic in HOL : Faithful Embedding and Meta-Theoretical Experiments},
  author = {Benzmüller, Christoph and Farjami, Ali and Parent, Xavier},
  year = {2022},
  booktitle = {New developments in legal reasoning and logic : from ancient law to modern legal systems},
  pages = {353–377},
  publisher = {Springer},
  address = {Cham},
  urn = {urn:nbn:de:bvb:473-irb-545469},
  url = {https://fis.uni-bamberg.de/handle/uniba/54546},
  language = {eng},
  abstract = {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.},
  keywords = {Dyadic deontic logic, Classical higher-order logic, Semantic embedding, Faithfulness}
}

@article{benzmuller2022_54431,
  title = {Automating public announcement logic with relativized common knowledge as a fragment of HOL in LogiKEy},
  author = {Benzmüller, Christoph and Reiche, Sebastian},
  year = {2022},
  journal = {Journal of Logic and Computation},
  pages = {1-28},
  publisher = {Otto-Friedrich-Universität},
  address = {Bamberg},
  urn = {urn:nbn:de:bvb:473-irb-544316},
  url = {https://fis.uni-bamberg.de/handle/uniba/54431},
  language = {eng},
  abstract = {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.},
  keywords = {Public announcement logic; Relativized common knowledge; Semantical embedding; Higher-order logic; Proof automation}
}

@misc{steen2022_54664,
  title = {Automated Reasoning in Non-classical Logics in the TPTP World},
  author = {Steen, Alexander and Fuenmayor, David and Gleißner, Tobias and Sutcliffe, Geoff and Benzmüller, Christoph},
  year = {2022},
  publisher = {arXiv},
  doi = {10.48550/ARXIV.2202.09836},
  url = {https://fis.uni-bamberg.de/handle/uniba/54664},
  language = {eng}
}

@misc{bayer2022_54601,
  title = {Mathematical Proof Between Generations},
  author = {Bayer, Jonas and Benzmüller, Christoph and Buzzard, Kevin and David, Marco and Lamport, Leslie and Matiyasevich, Yuri and Paulson, Lawrence and Schleicher, Dierk and Stock, Benedikt and Zelmanov, Efim},
  year = {2022},
  pages = {1-17},
  publisher = {arXiv},
  doi = {10.48550/ARXIV.2207.04779},
  url = {https://fis.uni-bamberg.de/handle/uniba/54601},
  language = {eng},
  abstract = {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.},
  keywords = {mathematical proof}
}

@incollection{benzmuller2022_54432,
  title = {Dyadic Deontic Logic in HOL : Faithful Embedding and Meta-Theoretical Experiments},
  author = {Benzmüller, Christoph and Farjami, Ali and Parent, Xavier},
  year = {2022},
  booktitle = {New developments in legal reasoning and logic : from ancient law to modern legal systems},
  pages = {353-377},
  publisher = {Springer},
  address = {Cham},
  isbn = {978-3-030-70084-3},
  doi = {10.1007/978-3-030-70084-3\_14},
  url = {https://fis.uni-bamberg.de/handle/uniba/54432},
  language = {eng},
  abstract = {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.},
  keywords = {Dyadic deontic logic, Classical higher-order logic, Semantic embedding, Faithfulness}
}

@misc{benzmuller2021_55605,
  title = {Automating Public Announcement Logic with Relativized Common Knowledge as a Fragment of HOL in LogiKEy},
  author = {Benzmüller, Christoph and Reiche, Sebastian},
  year = {2021},
  pages = {1-28},
  publisher = {arXiv},
  address = {Online},
  doi = {10.48550/ARXIV.2111.01654},
  url = {https://fis.uni-bamberg.de/handle/uniba/55605},
  language = {eng},
  abstract = {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.},
  keywords = {Public announcement logic; Relativized common knowledge; Semantical embedding; Higher-order logic; Proof automation}
}

@inproceedings{benzmuller2020_117505,
  title = {A (simplified) supreme being necessarily exists, says the computer : Computationally explored variants of Gödel's ontological argument},
  author = {Benzmüller, Christoph},
  year = {2020},
  booktitle = {Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020)},
  pages = {779-789},
  isbn = {9780999241172},
  url = {https://fis.uni-bamberg.de/handle/uniba/117505},
  language = {eng}
}

@incollection{benzmuller2020_117506,
  title = {Träumen vernünftige Maschinen von Gründen? : Eine reale Utopie},
  author = {Benzmüller, Christoph and Lomfeld, Bertram},
  year = {2020},
  booktitle = {KI als Laboratorium? Ethik als Aufgabe!},
  pages = {29-36},
  address = {Berlin},
  isbn = {978-3-939818-93-9},
  url = {https://fis.uni-bamberg.de/handle/uniba/117506},
  language = {deu}
}

@misc{fuenmayor2020_95347,
  title = {Higher-order Logic as Lingua Franca -- Integrating Argumentative Discourse and Deep Logical Analysis},
  author = {Fuenmayor, David and Benzmüller, Christoph},
  year = {2020},
  publisher = {arXiv},
  doi = {10.48550/arxiv.2007.01019},
  url = {https://fis.uni-bamberg.de/handle/uniba/95347},
  language = {eng}
}

