Search Results for author:
Found 33 papers, 8 papers with code
A German Corpus of Reflective Sentences
Reflection about a learning process is beneficial to students in higher education (Bub-nys, 2019).
Check News in One Click: NLP-Empowered Pro-Kremlin Propaganda Detection
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).
Normative Conditional Reasoning as a Fragment of HOL
We report on the mechanization of (preference-based) conditional normative reasoning.
PapagAI:Automated Feedback for Reflective Essays
Written reflective practice is a regular exercise pre-service teachers perform during their higher education.
Theorem Proving in Dependently-Typed Higher-Order Logic -- Extended Preprint
Higher-order logic HOL offers a very simple syntax and semantics for representing and reasoning about typed data structures.
Automated multilingual detection of Pro-Kremlin propaganda in newspapers and Telegram posts
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.
Solving QMLTP Problems by Translation to Higher-order Logic
The findings are that the embedding process is reliable and successful, the choice of backend ATP system can significantly impact the performance of the embedding approach, native modal logic ATP systems outperform the embedding approach, and the embedding approach can cope with a wider range modal logics than the native modal systems considered.
Who Finds the Short Proof? An Exploration of Variants of Boolos' Curious Inference using Higher-order Automated Theorem Provers
This paper reports on an exploration of Boolos' Curious Inference, using higher-order automated theorem provers (ATPs).
Automated Reasoning in Non-classical Logics in the TPTP World
Non-classical logics are used in a wide spectrum of disciplines, including artificial intelligence, computer science, mathematics, and philosophy.
A Simplified Variant of Gödel's Ontological Argument
A simplified variant of G\"odel's ontological argument is presented.
Automating Public Announcement Logic with Relativized Common Knowledge as a Fragment of HOL in LogiKEy
A shallow semantical embedding for public announcement logic with relativized common knowledge is presented.
Public Announcement Logic in HOL
A shallow semantical embedding for public announcement logic with relativized common knowledge is presented.
Reasonable Machines: A Research Manifesto
Future intelligent autonomous systems (IAS) are inevitably deciding on moral and legal questions, e. g. in self-driving cars, health care or human-machine collaboration.
Computers and Society 68T01 03Bxx 68T27 I.2.0; I.2.3; I.2.4
Higher-order Logic as Lingua Franca -- Integrating Argumentative Discourse and Deep Logical Analysis
We present an approach towards the deep, pluralistic logical analysis of argumentative discourse that benefits from the application of state-of-the-art automated reasoning technology for classical higher-order logic.
Modelling Value-oriented Legal Reasoning in LogiKEy
The logico-pluralist LogiKEy 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.
On Reductions of Hintikka Sets for Higher-Order Logic
Steen's (2018) Hintikka set properties for Church's type theory based on primitive equality are reduced to the Hintikka set properties of Brown (2007).
A (Simplified) Supreme Being Necessarily Exists, says the Computer: Computationally Explored Variants of Gödel's Ontological Argument
An approach to universal (meta-)logical reasoning in classical higher-order logic is employed to explore and study simplifications of Kurt G\"odel's modal ontological argument.
Computer-supported Exploration of a Categorical Axiomatization of Modeloids
A modeloid, a certain set of partial bijections, emerges from the idea to abstract from a structure to the set of its partial automorphisms.
Logic in Computer Science Algebraic Topology Category Theory 68T15, 03B35, 03B80, 03B15, 08A05, 03C10, 03C68, 03C75, 20B05, 54H20 F.4; I.2.3
Computer-supported Analysis of Positive Properties, Ultrafilters and Modal Collapse in Variants of Gödel's Ontological Argument
Three variants of Kurt G\"odel's ontological argument, proposed by Dana Scott, C. Anthony Anderson and Melvin Fitting, are encoded and rigorously assessed on the computer.
Extensional Higher-Order Paramodulation in Leo-III
Leo-III is an automated theorem prover for extensional type theory with Henkin semantics and choice.
A Computational-Hermeneutic Approach for Conceptual Explicitation
At the next layer we select among those correct formalizations the ones which honor the argument's dialectic role, i. e. attacking or supporting other arguments as intended.
Computer Science and Metaphysics: A Cross-Fertilization
Computational philosophy is the use of mechanized computational techniques to unearth philosophical insights that are either difficult or impossible to find using traditional philosophical methods.
Designing Normative Theories for Ethical and Legal Reasoning: LogiKEy Framework, Methodology, and Tool Support
A framework and methodology---termed LogiKEy---for the design and engineering of ethical reasoners, normative theories and deontic logics is presented.
First Experiments with a Flexible Infrastructure for Normative Reasoning
A flexible infrastructure for normative reasoning is outlined.
I/O Logic in HOL --- First Steps
A semantical embedding of input/output logic in classical higher-order logic is presented.
Faithful Semantical Embedding of a Dyadic Deontic Logic in HOL
A shallow semantical embedding of a dyadic deontic logic by Carmo and Jones in classical higher-order logic is presented.
The Higher-Order Prover Leo-III (Extended Version)
The automated theorem prover Leo-III for classical higher-order logic with Henkin semantics and choice is presented.
Universal Reasoning, Rational Argumentation and Human-Machine Interaction
Classical higher-order logic, when utilized as a meta-logic in which various other (classical and non-classical) logics can be shallowly embedded, is well suited for realising a universal logic reasoning approach.
Axiomatizing Category Theory in Free Logic
Starting from a generalization of the standard axioms for a monoid we present a stepwise development of various, mutually equivalent foundational axiom systems for category theory.
Systematic Verification of the Modal Logic Cube in Isabelle/HOL
We present an automated verification of the well-known modal logic cube in Isabelle/HOL, in which we prove the inclusion relations between the cube's logics using automated reasoning tools.
LeoPARD --- A Generic Platform for the Implementation of Higher-Order Reasoners
LeoPARD supports the implementation of knowledge representation and reasoning tools for higher-order logic(s).
Formalization, Mechanization and Automation of Gödel's Proof of God's Existence
Automatic verification of the consistency of the axioms and definitions with Nitpick.
