Related papers: Non-Numerical Weakly Relational Domains
The (prefix-free) Kolmogorov complexity of a finite binary string is the length of the shortest description of the string. This gives rise to some `standard' lowness notions for reals: A is K-trivial if its initial segments have the lowest…
In conventional domain adaptation, a critical assumption is that there exists a fully labeled domain (source) that contains the same label space as another unlabeled or scarcely labeled domain (target). However, in the real world, there…
In this paper, we introduce the notion of the weak majority dimension of a digraph which is well-defined for any digraph. We first study properties shared by the weak dimension of a digraph and show that a weak majority dimension of a…
Non-normal modal logics, interpreted on neighbourhood models which generalise the usual relational semantics, have found application in several areas, such as epistemic, deontic, and coalitional reasoning. We present here preliminary…
We show weak* in measures on $\bar\O$/ weak-$L^1$ sequential continuity of $u\mapsto f(x,\nabla u):W^{1,p}(\O;\R^m)\to L^1(\O)$, where $f(x,\cdot)$ is a null Lagrangian for $x\in\O$, it is a null Lagrangian at the boundary for…
We study actions of discrete subgroups $\Gamma$ of semi-simple Lie groups $G$ on associated oriented flag manifolds. These are quotients $G/P$, where the subgroup $P$ lies between a parabolic subgroup and its identity component. For Anosov…
An adjoint-based procedure to determine weaknesses, or, more generally the material properties of structures is developed and tested. Given a series of force and deformation/strain measurements, the material properties are obtained by…
In this paper, we study the existence of the random approximations and fixed points for random almost lower semicontinuous operators defined on finite dimensional Banach spaces, which in addition, are condensing or 1-set-contractive. Our…
In this article, we present explicit estimates of the size of the domain on which the Implicit Function Theorem and the Inverse Function Theorem are valid. For maps that are twice continuously differentiable, these estimates depend upon the…
We consider the problem of predicting plausible missing facts in relational data, given a set of imperfect logical rules. In particular, our aim is to provide bounds on the (expected) number of incorrect inferences that are made in this…
We propose an algorithm for answering conjunctive queries with negation, where the negated relations have bounded degree. Its data complexity matches that of the best known algorithms for the positive subquery of the input query and is…
We introduce and study weak o-minimality in the context of complete types in an arbitrary first-order theory. A type $p\in S(A)$ is weakly o-minimal if for some relatively $A$-definable linear order, $<$, on $p(\mathfrak{C})$ every…
From the complex motions of robots to the oxygen binding of hemoglobin, the function of many mechanical systems depends on large, coordinated movements of their components. Such movements arise from a network of physical interactions in the…
We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are…
Complex systems are high-dimensional nonlinear dynamical systems with intricate interactions among their constituents. To make interpretable predictions about their large-scale behavior, it is typically assumed, without a clear statement,…
We consider the problem of minimal correction of the training set to make it consistent with monotonic constraints. This problem arises during analysis of data sets via techniques that require monotone data. We show that this problem is…
For a complexity class $C$ and language $L$, a constructive separation of $L \notin C$ gives an efficient algorithm (also called a refuter) to find counterexamples (bad inputs) for every $C$-algorithm attempting to decide $L$. We study the…
In this paper, we present new second-order algorithms for composite convex optimization, called Contracting-domain Newton methods. These algorithms are affine-invariant and based on global second-order lower approximation for the smooth…
Decidability or complexity issues about the consistency problem for description logics with concrete domains have already been analysed with tableaux-based or type elimination methods. Concrete domains in ontologies are essential to…
In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…