Related papers: Domain closure conditions and definability preserv…
In any given collaboration, information needs to flow from one participant to another. While participants may be interested in sharing information with one another, it is often necessary for them to establish the impact of sharing certain…
The coverage depth problem in DNA data storage is about minimizing the expected number of reads until all data is recovered. When they exist, MDS codes offer the best performance in this context. This paper focuses on the scenario where the…
The paper proposes a theoretical approach of the debugging of constraint programs based on a notion of explanation tree. The proposed approach is an attempt to adapt algorithmic debugging to constraint programming. In this theoretical…
In this paper, we consider the helicity conservation of weak solutions for the compressible Euler equations in a bounded domain with general pressure law and vacuum. We deduce a sufficient condition for a weak solution conserving the…
In case of incomplete database tables, a possible world is obtained by replacing any missing value by a value from the corresponding attribute's domain that can be infinite. A possible key or possible functional dependency constraint is…
In this paper we show that reversible analysis of logic languages by abstract interpretation can be performed without loss of precision by systematically refining abstract domains. The idea is to include semantic structures into abstract…
The Domain Name System (DNS) is one of the most fundamental components of the Internet. While glue is widely used and heavily relied on in DNS operations, there is little thinking about the necessity, complexity, and venerability of such…
Sufficient conditions for the controllability of a conservative reduced system are given. Several examples illustrating the theory are also presented.
Hellaby & Dray (gr-qc/9404001) have recently claimed that matter conservation fails under a change of signature, compounding earlier claims that the standard junction conditions for signature change are unnecessary. In fact, if the field…
Deep learning models suffer from the problem of semantic discontinuity: small perturbations in the input space tend to cause semantic-level interference to the model output. We argue that the semantic discontinuity results from these…
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, constraint solving amounts to domain reduction. A computation…
We study the transmission problem in bounded domains with dissipative boundary conditions. Under some natural assumptions, we prove uniform bounds of the corresponding resolvents on the real axis at high frequency, and as a consequence, we…
We present a CLP(FD)-based constraint solver able to deal with unbounded domains. It is based on constraint propagation, resorting to enumeration if all other methods fail. An important aspect is detecting when enumeration was complete and…
In this paper we report our investigations on visibility with respect to the Kobayashi distance and its applications, with a special focus on planar domains. We prove that totally disconnected subsets of the boundary are removable in the…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
A sufficient condition for $\bar{\partial}$ to have closed range is given for pseudoconvex, possibly unbounded domains in $\mathbb{C}^n$.
We investigate the decidability and complexity status of model-checking problems on unlabelled reachability graphs of Petri nets by considering first-order and modal languages without labels on transitions or atomic propositions on…
DNS is a basic Internet service which almost all other user services depend on. However, what has been perceived in practice are a lot of inconsistencies and errors in the configuration of servers that cause different problems. The majority…
As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance and default rules. Since many applications would benefit from the availability of such features, several…
In this paper, we give some {\L}ojasiewicz-type inequalities and a nonsmooth slope inequality on non-compact domains for continuous definable functions in an o-minimal structure. We also give a necessary and sufficicent condition for which…