Related papers: Domain closure conditions and definability preserv…
The problem of domain aiming control is formulated for controlled stochastic nonlinear systems. This issue involves regularity of the solution to the resulting closed-loop stochastic system. To begin with, an extended existence and…
We introduce the notion of domain-structured chaos and apply it to establish a connection between stochastic dynamics and deterministic chaos.
Constraint Programming (CP) has proved an effective paradigm to model and solve difficult combinatorial satisfaction and optimisation problems from disparate domains. Many such problems arising from the commercial world are permeated by…
It is well known that the classic {\L}o\'s-Tarski preservation theorem fails in the finite: there are first-order definable classes of finite structures closed under extensions which are not definable (in the finite) in the existential…
[Context] Domain knowledge is recognized as a key component for the success of Requirements Engineering (RE), as it provides the conceptual support needed to understand the system context, ensure alignment with stakeholder needs, and reduce…
Authoritative Domain Name System (DNS) response selection defines query-time response selection based on resolver-visible context and per-answer metadata, yielding different observable outcomes for the same query under different conditions.…
It is ``folklore'' that the solution to a set reachability problem for a dynamical system is only noncomputable because of non-robustness reasons. A robustness condition that can be imposed on a dynamical system is the requirement of the…
We consider in the plane the problem of reconstructing a domain from the normal derivative of its Green's function with pole at a fixed point in the domain. By means of the theory of conformal mappings, we obtain existence, uniqueness,…
We consider a constrained optimization problem arising from the study of the Helmholtz equation in unbounded domains. The optimization problem provides an approximation of the solution in a bounded computational domain. In this paper we…
This paper studies the current "identity crisis" caused by the substantial security, privacy and usability shortcomings encountered in existing systems for identity management. Some of these issues are well known, while others are much less…
We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…
We establish the undecidability of conditional affine information inequalities, the undecidability of the conditional independence implication problem with a constraint that one random variable is binary, and the undecidability of the…
Completeness is one of the most important attributes of software requirement specifications. Unfortunately, incompleteness is meanwhile one of the most difficult problems to detect. Some approaches have been proposed to detect missing…
We explore extensions of domain theoretic concepts, replacing transitive relations with general non-symmetric distances. These lead to a generalization of Smyth completeness which we characterize in various ways analogous to our previous…
We present axiomatisations for a number of partial function signatures that include domain restriction, modelled as a right normal band operation. Other operations considered are override and update, difference, minus, intersection,…
We introduce a graded version of dagger closure and prove that it coincides with solid closure for homogeneous ideals in two dimensional $\mathbb{N}$-graded domains of finite type over a field.
We study Serrin's overdetermined boundary value problems in bounded domains on weighted Riemannian manifolds. When the closure of the domain is compact, we establish a rigidity result that characterizes both the solution and the geometry of…
The success of software model checking depends on finding an appropriate abstraction of the subject program. The choice of the abstract domain and the analysis configuration is currently left to the user, who may not be familiar with the…
Specifying an Operational Design Domain (ODD) is crucial for safeguarding automated vehicle systems against conditions that exceed their capabilities. Yet, prior definitions of ODD have relied on ambiguous and unclear terms, resulting in…
We present an optimization problem in infinite dimensions which satisfies the usual second-order sufficient condition but for which perturbed problems fail to possess solutions.