Motivated by constraint complex values which allow us to represent nested finitely representable sets, we study the expressive power of various query languages over constraint complex value databases. The tools we use come in the form of collapse results which are well established results in the context of first-order logic. We show that activegeneric collapse carries over to second-order logic...

Synthetic spin-orbit coupling in ultracold atomic gases can be taken to extremes rarely found in solids. We study a two dimensional Hubbard model of bosons in an optical lattice in the presence of spin-orbit coupling strong enough to drive direct transitions from Mott insulators to superfluids. Here we find phase-modulated superfluids with finite momentum that are generated entirely by spin-orb...

This paper presents a new and alternative method (in the context of urban drainage) for probabilistic hydrodynamical analysis of drainage systems in general and especially prediction of combined sewer overflow. Using a probabilistic shell it is possible to implement both input and parameter uncertainties on an application of the commercial urban drainage model MOUSE combined with the probabilis...

Probabilistic databases store, query and manage large amounts of uncertain information in an efficient way. This paper summarizes my thesis which advances the state-of-the-art in probabilistic databases in three different ways: First, we present a closed and complete data model for temporal probabilistic databases. Queries are posed via temporal deduction rules which induce lineage formulas cap...

Craig interpolation is successfully used in both hardware and software model checking. An important class of state-of-the-art interpolation algorithms is based on recursive procedures that generate interpolants from refutations of unsatisfiable conjunctions of formulas. We analyze this type of algorithms and develop a theoretical framework, called a parametric interpolation framework, for arbit...

We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for these logics L as each ranges over models A, in the spirit of the dichotomy conjecture for the Constraint Satisfaction Problem – which itself may be seen as...

A model-theoretic approach can establish security theorems, which are formulas expressing authentication and non-disclosure properties of protocols. Security theorems have a special form, namely quantified implications ∀~x .(φ ⊃ ∃~y .ψ). Models (interpretations) for these formulas are skeletons, partially ordered structures consisting of a number of local protocol behaviors. Realized skeletons ...

This paper presents CO3L, a compact, expressive and easy to use language for ontology representation. CO3L reflects the O3F model of ontology representation proposed elsewhere. The proposed language enables the representation of basic ontological entities, their relationships, and arbitrary axioms of the domain. Ontological entities include classes, properties, methods, facets and types. Relati...

We show that the expressive power of first-order logic over finite models embedded in a model M is determined by stability-theoretic properties of M . In particular, we show that if M is stable, then every class of finite structures that can be defined by embedding the structures in M , can be defined in pure first-order logic. We also show that if M does not have the independence property, the...

The effects of introducing a workflow system include improved work efficiency, reduced processing time (that is, turnaround time), standardized business processes, and made processing paperless. However, no concrete methodology for quantitatively evaluating these effects has been established. In this paper, by analyzing some examples of introducing workflow systems, we extracted the factors tha...