Related papers: Locality, Consistency, and the Tractability Fronti…
For each $n\geq 2$, we show that the class of all finite $n$-dimensional partial orders, when expanded with $n$ linear orders which realize the partial order, forms a Fra\"iss\'e class and identify its Fra\"iss\'e limit…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
We study the universal closest refinement problem on measurable bipartite relations over standard Borel spaces. Given prescribed side measures, the feasible class consists of finite refinement plans concentrated on the relation and carrying…
In this note, we consider a Robin-type traction problem for a linearly elastic body occupying an infinite periodically perforated domain. After proving the uniqueness of the solution we use periodic elastic layer potentials to show that the…
In this work we provide a computationally tractable procedure for designing affine control policies, applied to constrained, discrete-time, partially observable, linear systems subject to set bounded disturbances, stochastic noise and…
The constraint satisfaction problem (CSP) is a central generic problem in computer science and artificial intelligence: it provides a common framework for many theoretical problems as well as for many real-life applications. Soft constraint…
We consider nonlinear scalar-input differential control systems in the vicinity of an equilibrium. When the linearized system at the equilibrium is controllable, the nonlinear system is smoothly small-time locally controllable, i.e.,…
Ill-posed linear inverse problems appear frequently in various signal processing applications. It can be very useful to have theoretical characterizations that quantify the level of ill-posedness for a given inverse problem and the degree…
We settle some open problems in the special case of groups in o-minimal structures, such as the equality of G^00 and G^000 and the equivalence of definable amenability and existence of a type with bounded orbit. We prove almost exactness of…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
Existential rules, long known as tuple-generating dependencies in database theory, have been intensively studied in the last decade as a powerful formalism to represent ontological knowledge in the context of ontology-based query answering.…
This paper presents a necessary and sufficient condition on a category with weak finite limits for its exact completion to be (locally) cartesian closed. A paper by Carboni and Rosolini already claimed such a characterisation using a…
We introduce the concept of a class of graphs, or more generally, relational structures, being locally tree-decomposable. There are numerous examples of locally tree-decomposable classes, among them the class of planar graphs and all…
We study the identification of causal effects in the presence of different types of constraints (e.g., logical constraints) in addition to the causal graph. These constraints impose restrictions on the models (parameterizations) induced by…
In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…
This paper proves the NP-completeness of the reachability problem for the class of flat counter machines with difference bounds and, more generally, octagonal relations, labeling the transitions on the loops. The proof is based on the fact…
We use variational convergence to derive a hierarchy of one-dimensional rod theories, starting out from three-dimensional models in nonlinear elasticity subject to local volume-preservation. The densities of the resulting $\Gamma$-limits…
We say that a theory $T$ is intermediate under effective reducibility if the isomorphism problems among its computable models is neither hyperarithmetic nor on top under effective reducibility. We prove that if an infinitary sentence $T$ is…
We introduce a logical framework for the specification and verification of component-based systems, in which finitely many component instances are active, but the bound on their number is not known. Besides specifying and verifying…
We introduce two closure operations on ideals in commutative rings related to the ring operation of root closure. One closure is the result of iterating a root-like operation on ideals infinitely many times, and the other closure arises as…