Related papers: Do Repeat Yourself: Understanding Sufficient Condi…
We study pullback attractors of non-autonomous non-compact dynamical systems generated by differential equations with non-autonomous deterministic as well as stochastic forcing terms. We first introduce the concepts of pullback attractors…
Query answering under existential rules -- implications with existential quantifiers in the head -- is known to be decidable when imposing restrictions on the rule bodies such as frontier-guardedness [BLM10, BLMS11]. Query answering is also…
We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…
We investigate the structure of discontinuities in clearance (or minimum time) functions for nonlinear control systems with general, closed obstacles (or targets). We establish general results regarding interactions between admissible…
We study pure exploration problems in which the set of correct answers is possibly infinite. For example, such problems arise when regressing a continuous function on the means of the bandit or when learning Nash equilibria by querying…
We study the interaction of views, queries, and background knowledge in the form of existential rules. The motivating questions concern monotonic determinacy of a query using views w.r.t. rules, which refers to the ability to recover the…
Many algorithms have been proposed in prior literature to guarantee resilient multi-agent consensus in the presence of adversarial attacks or faults. The majority of prior work present excellent results that focus on discrete-time or…
Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an…
This Survey provides an overview of techniques in termination analysis for programs with numerical variables and transitions defined by linear constraints. This subarea of program analysis is challenging due to the existence of undecidable…
We propose finitely convergent methods for solving convex feasibility problems defined over a possibly infinite pool of constraints. Following other works in this area, we assume that the interior of the solution set is nonempty and that…
We consider recurrent diffusive random walks on a strip. We present constructive conditions on Green functions of finite sub-domains which imply a Central Limit Theorem with polynomial error bound, a Local Limit Theorem, and mixing of…
A new pattern search method for bound constrained optimization is introduced. The proposed algorithm employs the coordinate directions, in a suitable way, with a nonmonotone line search for accepting the new iterate, without using…
The intractability of any problem and the randomness of its solutions have an obvious intuitive connection. However, the challenge till now has been that there is no practical way to firmly establish if the solution to a problem is actually…
Sufficient conditions for either existence or non-existence of traveling wave solutions for a general quasi-linear reaction-diffusion-convection equation, possibly highly degenerate or singular, with discontinuous coefficients are…
We present an analysis of the adiabatic approximation to understand when it applies, in view of the recent criticisms and studies for the validity of the adiabatic theorem. We point out that this approximation is just the leading order of a…
We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of $n$ conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional…
In an automatic search, we found conjectural recurrences for some sequences in the OEIS that were not previously recognized as being D-finite. In some cases, we are able to prove the conjectured recurrence. In some cases, we are not able to…
We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences). Both algorithms have in common that while they do succeed…
In a classical optimal stopping problem the aim is to maximize the expected value of a functional of a diffusion evaluated at a stopping time. This note considers optimal stopping problems beyond this paradigm. We study problems in which…
The extended Hamilton's Principle and other methods proposed to handle non-holonomic constraints are considered. They dont agree with each other. By looking at its consistency with D'Alembert's principle for linear non-holonomic…