Related papers: Forcing as a Local Method of Accessing Small Exten…
The interplay between process behaviour and spatial aspects of computation has become more and more relevant in Computer Science, especially in the field of collective adaptive systems, but also, more generally, when dealing with systems…
Optimization is a key task in a number of applications. When the set of feasible solutions under consideration is of combinatorial nature and described in an implicit way as a set of constraints, optimization is typically NP-hard.…
We construct a machine which takes as input a locally small symmetric closed complete multicategory $\mathsf V$. And its output is again a locally small symmetric closed complete multicategory $\mathsf V\text-\mathcal{C}at$, the…
We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.
We present an extension-based approach for computing and verifying preferences in an abstract argumentation system. Although numerous argumentation semantics have been developed previously for identifying acceptable sets of arguments from…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
Given a valued field $(K,v)$ and its completion $(\widehat{K},v)$, we study the set of all possible extensions of $v$ to $\widehat{K}(X)$. We show that any such extension is closely connected with the underlying subextension $(K(X)|K,v)$.…
In this paper we describe "VWhere," a S-Lang guilet which augments the computational power of "where" with the point-click ease of a Gtk-based visual interface. The result is a new mechanism for interacting with datasets, which unifies the…
We present CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. Even for decidable constraint systems, satisfiability and Model Checking problem of such…
Complex structures can only form in a universe that allows for bound states. While this is clearly observed in three-dimensions, added degrees of freedom in a higher-dimensional space preclude the immediate assumption that binding…
We study possibilities for semantic and syntactic rigidity, i.e., the rigidity with respect to automorphism group and with respect to definable closure. Variations of rigidity and their degrees are studied in general case, for special…
Improving the explainability of the results from machine learning methods has become an important research goal. Here, we study the problem of making clusters more interpretable by extending a recent approach of [Davidson et al., NeurIPS…
Local versions of measurability have been around for a long time. Roughly, one splits the notion of $\mu $-completeness into pieces, and asks for a uniform ultrafilter over $\mu $ satisfying just some piece of $\mu $-completeness. Analogue…
It is well-known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalise the notion of the relative end…
A measure for the complexity of a differentiable function f(x) on an interval is introduced. It is based on approximations of the function by piecewise constant functions. The measure takes into account the quality of the approximation and…
This paper introduces a novel eXtended virtual element method, an extension of the conforming virtual element method. The XVEM is formulated by incorporating appropriate enrichment functions in the local spaces. The method is designed to…
A pushdown vector addition system with states (PVASS) extends the model of vector addition systems with a pushdown stack. The algorithmic analysis of PVASS has applications such as static analysis of recursive programs manipulating integer…
Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…
We study the computational complexity of problems that arise in abstract argumentation in the context of dynamic argumentation, minimal change, and aggregation. In particular, we consider the following problems where always an argumentation…
Using forcing with measured creatures we build a universe of set theory in which: (a) every sup-measurable function f:RxR-->R is measurable, and (b) every function f:R-->R is continuous on a non-measurable set. This answers a question of…