In the paper we deal with the problem of modeling and querying information in schemaless databases of partially labeled objects (PLO-DB). Partially labeled objects are used for modeling data within repositories integrating both structured and semistructured data. The proposed PLO (Partially Labeled Objects) data model originates from the OEM data model and extends it by allowing partial labelin...

The realizability problem in requirements engineering is to determine the existence of an implementation that meets the given formal requirements. A step forward after realizability is proven, is to construct such an implementation automatically, and thus solve the problem of program synthesis. In this paper, we propose a novel approach to program synthesis guided by k-inductive proofs of reali...

The chase procedure is an indispensable tool for several database applications, where its termination guarantees decidability of these tasks. Most previous studies have focused on the skolem chase variant and its termination. It is known that the standard chase variant is more powerful in termination analysis provided a database is given. But all-instance termination analysis presents a challen...

In Datalog, missing values are represented by Skolem constants. More generally, in logic programming missing values, or existentially­ quantified variables, are represented by terms built from Skolem functors. In an analogy to probabilistic relational models (PRMs), we wish to represent the joint probability distribution over missing values in a database or logic program us­ ing a Bayesian netw...