Generating and representing knowledge about heuristics for repair-based scheduling is a key issue in any rescheduling strategy to deal with unforeseen events and disturbances. Resorting to a feature-based propositional representation of schedule states is very inefficient and generalization to unseen states is highly unreliable whereas knowledge transfer to similar scheduling domains is difficu...

Database relations with incomplete information are considered. The no-information interpretation of null values is adopted, due to its characteristics of generality and naturalness. Coherently with the framework and its motivation, two meaningful classes of integrity constraints are studied: (a) functional dependencies, which have been widely investigated in the classical relational theory and ...

or concrete entities. I could also give a similar story-relative account of the issue as to whether fictional characters are individual versus general entities such as universals; here too I can simply reply that it depends on whether or not the relevant characters are represented as individuals or as universals, in the fictional story. 35. Thomasson, Fiction and Metaphysics, chap. 1. 36. That ...

We describe a general construction of finiteness spaces which subsumes the interpretations of all positive connectors of linear logic. We then show how to apply this construction to prove the existence of least fixpoints for particular functors in the category of finiteness spaces: these include the functors involved in a relational interpretation of lazy recursive algebraic datatypes along the...

This paper is a survey of several results concerning finite dualities, a special case of the famous Constraint Satisfaction Problem (CSP). In CSP, the point is to characterize a class C of objects X determined by constraints represented by the requirement of the existence of structure preserving mappings from X into special ones. In a finite duality, such a class C is characterized by the non-e...

A family T of digraphs is a complete set of obstructions for a digraph H if for an arbitrary digraph G the existence of a homomorphism from G to H is equivalent to the non-existence of a homomorphism from any member of T to G. A digraph H is said to have tree duality if there exists a complete set of obstructions T consisting of orientations of trees. We show that if H has tree duality, then it...

Relational database is widely used in most of the application to store and retrieve data. They work best when they handle a limited set of data. Handling real time huge volume of data like internet was inefficient in relation database systems. To overcome this problem the "NO-SQL" or "Not Only SQL" Database came into existence. This paper discusses about problems with relation databases and how...

Institutional identity as a concept in CDA is a field of study that deals with the identities that individuals in institutions obtain, one that merits deep research attention. News interviews as institutional instances can be analyzed based on the impersonal structures because interviewees see themselves as part of the institution and they may not take responsibility when they encounter problem...

We prove positive and negative results on the expressive power of the relational calculus augmented with linear constraints. We show non-expressibility of some properties expressed by polynomial constraints. We also show expressibility of some queries involving existence of lines, when the query output has a simple geometrical relation to the input. Finally, we compare the expressive power of l...

Abstract We present an analysis of the Frauchiger–Renner Gedankenexperiment from point view relational interpretation quantum mechanics. Our shows that paradox obtained by Frauchiger and Renner disappears if one rejects promoting agent’s certainty to another when it cannot be validated records past. A by-product our is interaction-free detection scheme for existence such records.