arXiv subjects

Thomas Meyer

Publications and source records attributed to Thomas Meyer.

At least 19 recordsLinked to original sources

arXiv2026

Standpoint Logics with Defeasible Beliefs

In this paper, we integrate the defeasible logic of Kraus, Lehmann and Magidor (KLM) with the standpoint logic framework of G\'omez \'Alvarez and Rudolph. This is done with the goal of formally expressing knowledge taking into account multiple (possibly contradicting) viewpoints, which in turn may hold defeasible beliefs. In doing so, we utilise Defeasible Restricted Standpoint Logics (DRSL), introduced by Leisegang et al. Our work expands on previous work by providing a foundational representation result for DRSL semantics and systematically lifting several well-known entailment relations from the propositional case to the standpoint-enhanced setting. In particular, we characterise the semantics for DRSL through a set of KLM-style postulates adapted for the standpoints case. We furthermore provide a means to lift preferential entailment, and the class of entailment relations based on single ranking functions from the purely propositional to the standpoint-enhanced context, including rational and lexicographic closure. We show this can be done equivalently through semantic and algorithmic means. Furthermore, we show that, for each considered form of entailment, the complexity class of entailment checking does not change when moving from propositional KLM to DRSL.

cs.AI↗

arXiv2026

Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic

Recent work in defeasible reasoning has seen notions of preferential semantics and entailment in the style of Kraus et al. applied to modal logics. However, work in this field has focussed primarily on satisfiability checking, and monotonic notions of entailment, which may be inferentially weak. One particular modal logic where this has been introduced is propositional standpoint logics, where modalities can express the views of different viewpoints. This has resulted in the formalisation of propositional defeasible standpoint logic (PDSL). In this paper, we propose a means of lifting the class of (non-monotonic) rational entailment relations from traditional KLM-style reasoning to a fragment of PDSL. In order to do so, we extend the expressivity of PDSL via situated standpoint conditionals, allowing us to talk about a defeasible conditional holding in the context of a given standpoint. This allows us to re-characterise the syntax of PDSL in terms of situated conditionals, and shows that a large fragment of PDSL is expressible as a set of situated conditionals. We then focus on characterising non-monotonic entailment in this fragment, defining a method to transport any ranking-based entailment relation from the propositional case into the PDSL case. This is first described in the general case and then considered in the specific cases of rational and lexicographic closures, providing a faithful translation of each inference into PDSL. We also show that entailment-checking in this fragment of PDSL can be done largely using algorithms from the propositional case, while preserving complexity bounds.

cs.AI↗

arXiv2026

Defeasible Conditionals using Answer Set Programming

Defeasible entailment is concerned with drawing plausible conclusions from incomplete information. A foundational framework for modelling defeasible entailment is the KLM framework. Introduced by Kraus, Lehmann, and Magidor, the KLM framework outlines several key properties for defeasible entailment. One of the most prominent algorithms within this framework is Rational Closure (RC). This paper presents a declarative definition for computing RC using Answer Set Programming (ASP). Our approach enables the automatic construction of the minimal ranked model from a given knowledge base and supports entailment checking for specified queries. We formally prove the correctness of our ASP encoding and conduct empirical evaluations to compare the performance of our implementation with that of existing imperative implementations, specifically the InfOCF solver. The results demonstrate that our ASP-based approach adheres to RC's theoretical foundations and offers improved computational efficiency.

cs.AI↗

arXiv2026

Interplay of Structure and Dynamics in Solid Polymer Electrolytes: a Molecular Dynamics Study of LiPF6/polypropylene carbonate

Solid-state batteries (SSB) are emerging as next-generation electrochemical energy storage devices. Achieving high energy density in SSB relies on solid polymer electrolytes (SPE) that are electrochemically stable against both lithium metal and high-potential positive electrodes, two conditions that are difficult to satisfy without chemical degradation. In this work, molecular dynamics simulations are employed to investigate the relationship between structure and dynamics in carbonate-based SPE composed of polypropylene carbonate and lithium hexafluorophosphate (LiPF$_6$), at salt concentrations ranging from 0.32 to 1.21 mol$/$kg. Structural properties are analyzed under ambient pressure at the experimentally relevant temperature $T = 353$ K. Since the slow dynamical processes governing ion transport in these systems are inaccessible to direct molecular dynamics, transport properties are simulated at elevated temperatures up to 900 K and extrapolated to $T = 353$ K using Arrhenius behavior. The results reveal strong ionic correlations, a limited fraction of free ions, and a predominance of negatively charged clusters, especially at high salt concentration. At high temperature, the self-diffusion coefficient of Li$^+$ exceeds that of PF$_6^-$ due to weaker Li$^+$-carbonate and ion-ion interactions. However, at $T = 353$ K, Li$^+$ mobility becomes lower than that of the anion, consistent with typical experimental observations in SPE. As expected, the ionic conductivity $\sigma$ increases with temperature, while at $T = 353$ K it exhibits a maximum for salt concentrations between 1.0 and 1.1 mol$/$kg. Overall, the estimated physico-chemical parameters highlight the key role of ion correlations in SPE and suggest strategies to optimize electrolyte performance. The Arrhenius extrapolation approach used here provides valuable insight into ion transport mechanisms in solid polymer electrolytes.

cond-mat.soft↗

arXiv2025

Semantic Bridges Between First Order c-Representations and Cost-Based Semantics: An Initial Perspective

Weighted-knowledge bases and cost-based semantics represent a recent formalism introduced by Bienvenu et al. for Ontology Mediated Data Querying in the case where a given knowledge base is inconsistent. This is done by adding a weight to each statement in the knowledge base (KB), and then giving each DL interpretation a cost based on how often it breaks rules in the KB. In this paper we compare this approach with c-representations, a form of non-monotonic reasoning originally introduced by Kern-Isberner. c-Representations describe a means to interpret defeasible concept inclusions in the first-order case. This is done by assigning a numerical ranking to each interpretations via penalties for each violated conditional. We compare these two approaches on a semantic level. In particular, we show that under certain conditions a weighted knowledge base and a set of defeasible conditionals can generate the same ordering on interpretations, and therefore an equivalence of semantic structures up to relative cost. Moreover, we compare entailment described in both cases, where certain notions are equivalently expressible in both formalisms. Our results have the potential to benefit further work on both cost-based semantics and c-representations

cs.AI↗

arXiv2025

Extending Defeasibility for Propositional Standpoint Logics

In this paper, we introduce a new defeasible version of propositional standpoint logic by integrating Kraus et al.'s defeasible conditionals, Britz and Varzinczak's notions of defeasible necessity and distinct possibility, along with Leisegang et al.'s approach to defeasibility into the standpoint logics of G\'omez \'Alvarez and Rudolph. The resulting logical framework allows for the expression of defeasibility on the level of implications, standpoint modal operators, and standpoint-sharpening statements. We provide a preferential semantics for this extended language and propose a tableaux calculus, which is shown to be sound and complete with respect to preferential entailment. We also establish the computational complexity of the tableaux procedure to be in PSpace.

cs.LO↗

arXiv2025

Axiomatics of Restricted Choices by Linear Orders of Sets with Minimum as Fallback

We study how linear orders can be employed to realise choice functions for which the set of potential choices is restricted, i.e., the possible choice is not possible among the full powerset of all alternatives. In such restricted settings, constructing a choice function via a relation on the alternatives is not always possible. However, we show that one can always construct a choice function via a linear order on sets of alternatives, even when a fallback value is encoded as the minimal element in the linear order. The axiomatics of such choice functions are presented for the general case and the case of union-closed input restrictions. Restricted choice structures have applications in knowledge representation and reasoning, and here we discuss their applications for theory change and abstract argumentation.

cs.AI↗

arXiv2025

Rational Inference in Formal Concept Analysis

Defeasible conditionals are a form of non-monotonic inference which enable the expression of statements like "if $\phi$ then normally $\psi$". The KLM framework defines a semantics for the propositional case of defeasible conditionals by construction of a preference ordering over possible worlds. The pattern of reasoning induced by these semantics is characterised by consequence relations satisfying certain desirable properties of non-monotonic reasoning. In FCA, implications are used to describe dependencies between attributes. However, these implications are unsuitable to reason with erroneous data or data prone to exceptions. Until recently, the topic of non-monotonic inference in FCA has remained largely uninvestigated. In this paper, we provide a construction of the KLM framework for defeasible reasoning in FCA and show that this construction remains faithful to the principle of non-monotonic inference described in the original framework. We present an additional argument that, while remaining consistent with the original ideas around non-monotonic reasoning, the defeasible reasoning we propose in FCA offers a more contextual view on inference, providing the ability for more relevant conclusions to be drawn when compared to the propositional case.

cs.AI↗

arXiv2024

Non-monotonic Extensions to Formal Concept Analysis via Object Preferences

Formal Concept Analysis (FCA) is an approach to creating a conceptual hierarchy in which a \textit{concept lattice} is generated from a \textit{formal context}. That is, a triple consisting of a set of objects, $G$, a set of attributes, $M$, and an incidence relation $I$ on $G \times M$. A \textit{concept} is then modelled as a pair consisting of a set of objects (the \textit{extent}), and a set of shared attributes (the \textit{intent}). Implications in FCA describe how one set of attributes follows from another. The semantics of these implications closely resemble that of logical consequence in classical logic. In that sense, it describes a monotonic conditional. The contributions of this paper are two-fold. First, we introduce a non-monotonic conditional between sets of attributes, which assumes a preference over the set of objects. We show that this conditional gives rise to a consequence relation that is consistent with the postulates for non-monotonicty proposed by Kraus, Lehmann, and Magidor (commonly referred to as the KLM postulates). We argue that our contribution establishes a strong characterisation of non-monotonicity in FCA. Typical concepts represent concepts where the intent aligns with expectations from the extent, allowing for an exception-tolerant view of concepts. To this end, we show that the set of all typical concepts is a meet semi-lattice of the original concept lattice. This notion of typical concepts is a further introduction of KLM-style typicality into FCA, and is foundational towards developing an algebraic structure representing a concept lattice of prototypical concepts.

cs.LO↗

arXiv2024

Towards Propositional KLM-Style Defeasible Standpoint Logics

The KLM approach to defeasible reasoning introduces a weakened form of implication into classical logic. This allows one to incorporate exceptions to general rules into a logical system, and for old conclusions to be withdrawn upon learning new contradictory information. Standpoint logics are a group of logics, introduced to the field of Knowledge Representation in the last 5 years, which allow for multiple viewpoints to be integrated into the same ontology, even when certain viewpoints may hold contradicting beliefs. In this paper, we aim to integrate standpoints into KLM propositional logic in a restricted setting. We introduce the logical system of Defeasible Restricted Standpoint Logic (DRSL) and define its syntax and semantics. Specifically, we integrate ranked interpretations and standpoint structures, which provide the semantics for propositional KLM and propositional standpoint logic respectively, in order to introduce ranked standpoint structures for DRSL. Moreover, we extend the non-monotonic entailment relation of rational closure from the propositional KLM case to the DRSL case. The main contribution of this paper is to characterize rational closure for DRSL both algorithmically and semantically, showing that rational closure can be characterized through a single representative ranked standpoint structure. Finally, we conclude that the semantic and algorithmic characterizations of rational closure are equivalent, and that entailment-checking for DRSL under rational closure is in the same complexity class as entailment-checking for propositional KLM.

cs.AI↗

arXiv2023

Current and Future Challenges in Knowledge Representation and Reasoning

Knowledge Representation and Reasoning is a central, longstanding, and active area of Artificial Intelligence. Over the years it has evolved significantly; more recently it has been challenged and complemented by research in areas such as machine learning and reasoning under uncertainty. In July 2022 a Dagstuhl Perspectives workshop was held on Knowledge Representation and Reasoning. The goal of the workshop was to describe the state of the art in the field, including its relation with other areas, its shortcomings and strengths, together with recommendations for future progress. We developed this manifesto based on the presentations, panels, working groups, and discussions that took place at the Dagstuhl Workshop. It is a declaration of our views on Knowledge Representation: its origins, goals, milestones, and current foci; its relation to other disciplines, especially to Artificial Intelligence; and on its challenges, along with key priorities for the next decade.

cs.AI↗

arXiv2023

Graded contractions of g2

Graded contractions of the fine $\mathbb{Z}_2^3$-grading on the complex exceptional Lie algebra $\mathfrak{g}_2$ are classified up to equivalence and up to strongly equivalence. In particular, a large family of 14-dimensional Lie algebras arise, most of them solvable.

math.RA↗

arXiv2023

Situated Conditional Reasoning

Conditionals are useful for modelling, but are not always sufficiently expressive for capturing information accurately. In this paper we make the case for a form of conditional that is situation-based. These conditionals are more expressive than classical conditionals, are general enough to be used in several application domains, and are able to distinguish, for example, between expectations and counterfactuals. Formally, they are shown to generalise the conditional setting in the style of Kraus, Lehmann, and Magidor. We show that situation-based conditionals can be described in terms of a set of rationality postulates. We then propose an intuitive semantics for these conditionals, and present a representation result which shows that our semantic construction corresponds exactly to the description in terms of postulates. With the semantics in place, we proceed to define a form of entailment for situated conditional knowledge bases, which we refer to as minimal closure. It is reminiscent of and, indeed, inspired by, the version of entailment for propositional conditional knowledge bases known as rational closure. Finally, we proceed to show that it is possible to reduce the computation of minimal closure to a series of propositional entailment and satisfiability checks. While this is also the case for rational closure, it is somewhat surprising that the result carries over to minimal closure.

cs.AI↗

arXiv2022

Generalized Alder-Type Partition Inequalities

In 2020, Kang and Park conjectured a "level $2$" Alder-type partition inequality which encompasses the second Rogers-Ramanujan Identity. Duncan, Khunger, the fourth author, and Tamura proved Kang and Park's conjecture for all but finitely many cases utilizing a "shift" inequality and conjectured a further, weaker generalization that would extend both Alder's (now proven) as well as Kang and Park's conjecture to general level. Utilizing a modified shift inequality, Inagaki and Tamura have recently proven that the Kang and Park conjecture holds for level $3$ in all but finitely many cases. They further conjectured a stronger shift inequality which would imply a general level result for all but finitely many cases. Here, we prove their conjecture for large enough $n$, generalize the result for an arbitrary shift, and discuss the implications for Alder-type partition inequalities.

math.NT↗

arXiv2022

Laplace and Dirac Operators on Graphs

Discrete versions of the Laplace and Dirac operators haven been studied in the context of combinatorial models of statistical mechanics and quantum field theory. In this paper we introduce several variations of the Laplace and Dirac operators on graphs, and we investigate graph-theoretic versions of the Schrödinger and Dirac equation. We provide a combinatorial interpretation for solutions of the equations and we prove gluing identities for the Dirac operator on lattice graphs, as well as for graph Clifford algebras.

math-ph↗

arXiv2022

Direct probing of strong magnon-photon coupling in a planar geometry

We demonstrate direct probing of strong magnon-photon coupling using Brillouin light scattering spectroscopy in a planar geometry. The magnonic hybrid system comprises a split-ring resonator loaded with epitaxial yttrium iron garnet thin films of 200 nm and 2.46 $μ$m thickness. The Brillouin light scattering measurements are combined with microwave spectroscopy measurements where both biasing magnetic field and microwave excitation frequency are varied. The cooperativity for the 200 nm-thick YIG films is 4.5, and larger cooperativity of 137.4 is found for the 2.46 $μ$m-thick YIG film. We show that Brillouin light scattering is advantageous for probing the magnonic character of magnon-photon polaritons, while microwave absorption is more sensitive to the photonic character of the hybrid excitation. A miniaturized, planar device design is imperative for the potential integration of magnonic hybrid systems in future coherent information technologies, and our results are a first stepping stone in this regard. Furthermore, successfully detecting the magnonic hybrid excitation by Brillouin light scattering is an essential step for the up-conversion of quantum signals from the optical to the microwave regime in hybrid quantum systems.

cond-mat.mtrl-sci↗

arXiv2020

The Probabilistic Description Logic $\mathcal{BALC}$

Description logics (DLs) are well-known knowledge representation formalisms focused on the representation of terminological knowledge. Due to their first-order semantics, these languages (in their classical form) are not suitable for representing and handling uncertainty. A probabilistic extension of a light-weight DL was recently proposed for dealing with certain knowledge occurring in uncertain contexts. In this paper, we continue that line of research by introducing the Bayesian extension \BALC of the propositionally closed DL \ALC. We present a tableau-based procedure for deciding consistency, and adapt it to solve other probabilistic, contextual, and general inferences in this logic. We also show that all these problems remain \ExpTime-complete, the same as reasoning in the underlying classical \ALC.

cs.LO↗

arXiv2020

Moving-Resting Process with Measurement Error in Animal Movement Modeling

Statistical modeling of animal movement is of critical importance. The continuous trajectory of an animal's movements is only observed at discrete, often irregularly spaced time points. Most existing models cannot handle the unequal sampling interval naturally and/or do not allow inactivity periods such as resting or sleeping. The recently proposed moving-resting (MR) model is a Brownian motion governed by a telegraph process, which allows periods of inactivity in one state of the telegraph process. The MR model shows promise in modeling the movements of predators with long inactive periods such as many felids, but the lack of accommodation of measurement errors seriously prohibits its application in practice. Here we incorporate measurement errors in the MR model and derive basic properties of the model. Inferences are based on a composite likelihood using the Markov property of the chain composed by every other observed increments. The performance of the method is validated in finite sample simulation studies. Application to the movement data of a mountain lion in Wyoming illustrates the utility of the method.

stat.ME↗