Data exchange is the problem of finding an instance of a target schema, given an instance of a source schema and a specification of a mapping between the source and the target schemas, and answering queries over target instances. A schema mapping is a condition, often expressed in a fragment of first-order logic, that relates instances of source and target schemas. Most commonly it is a conjunc...

We develop first-order logic and some extensions for incomplete information scenarios and consider related complexity issues.

In a programming project, it is easy to lose track of which files need to be reprocessed or recompiled after a change is made in some part of the source. Make provides a simple mechanism for maintaining up-to-date versions of programs that result from many operations on a number of files. It is possible to tell Make the sequence of commands that create certain files, and the list of files that ...

In monitoring, we algorithmically check if a single behavior satisfies a property. Here, we consider monitoring for Multi-Lane Spatial Logic (MLSL). The behavior is given as a finite transition sequence of MLSL and the property is that a spatial MLSL formula should hold at every point in time within the sequence. In our procedure we transform the transition sequence and the formula to the first...

In this paper we analyze k-ary inclusion-exclusion logic, INEX[k], which is obtained by extending first order logic with k-ary inclusion and exclusion atoms. We show that every formula of INEX[k] can be expressed with a formula of k-ary existential second order logic, ESO[k]. Conversely, every formula of ESO[k] with at most k-ary free relation variables can be expressed with a formula of INEX[k...

In Sub-Saharan Africa, 40% of the burden of disease and injury can potentially be addressed by emergency care. Adequate pre-hospital care is vital, but often unavailable in Sub-Saharan Africa. Initial help and emergency transport often depends on basic first responders. The World Bank identified first aid training as cost-effective way to save lives in Sub-Saharan Africa. Although well-intentio...

We study the model-theoretic aspects of a probability logic suited for talking about measure spaces. This nonclassical logic has a model theory rather different from that of classical predicate logic. In general, not every satisfiable set of sentences has a countable model, but we show that one can always build a model on the unit interval. Also, the probability logic under consideration is not...

The control part of many concurrent and distributed programs reduces to a set Π = {p1, . . . , pn} of symmetric processes containing mainly assignments and tests on Boolean variables. However, the assignments, the guards and the program invariants can beΠ-quantified, so the corresponding verification conditions also involve Π-quantifications. We propose a systematic procedure allowing the elimi...

Let 0 < a < b < ∞, and for each edge e of Zd let ωe = a or ωe = b, each with probability 1/2, independently. This induces a random metric distω on the vertices of Z d, called first passage percolation. We prove that for d > 1 the distance distω(0, v) from the origin to a vertex v, |v| > 2, has variance bounded by C |v|/ log |v|, where C = C(a, b, d) is a constant which may only depend on a, b a...