Recognizing relational similarity relies on the ability to understand that defining object properties might not lie in the objects individually, but in the relations of the properties of various object to each other. This aptitude is highly relevant for many important human skills such as language, reasoning, categorization and understanding analogy and metaphor. In the current study, we invest...

In this demo, we will show the operation of Ultrawrap Mapper, a semi-automatic software for creating mappings from Relational Databases to RDF in the R2RML language. In 2012, the W3C ratified two related standards for mapping relational database contents to RDF: the Direct Mapping [1] and R2RML [2]. The Direct Mapping is a default mapping of relational data to RDF. The organization and content ...

The SHRUTI model demonstrates how complex cognitive functions can be realized by neural circuitry. This paper addresses how some key elements of this circuitry can be learned in a neurally plausible manner. Two basic mechanisms, causal Hebbian learning and recruitment learning, are used to learn relational concepts and causal rules.

In this paper, we propose an alternative mapping strategy to mine the structural similarity and an advanced mapping rule from the algorithm. Objectrelational mapping technique is used for extracting advanced storage design schema for microarray data and structural similarity of elements is evaluated for efficient storage construction. The mapping strategy reduced the number of relational tables...

The paper characterises compositional homomorphims of relational structures. A detailed study of three categories of such structures { viewed as multialgebras { reveals the one with the most desirable properties. In addition, we study analogous categories with homomorphisms mapping elements to sets (thus being relations). Finally, we indicate some consequences of our results for partial algebra...

This note gives an explicit construction of the one-generated free domain semiring. In particular it is proved that the elements can be represented uniquely by finite antichains in the poset of finite strictly decreasing sequences of nonnegative integers. It is also shown that this domain semiring can be represented by sets of binary relations with union, composition and relational domain as op...

Business Networks are sets of repetitive transactions based on structural and relational formations with dynamic boundaries that comprise of interconnected elements (actors, resources and activities). Networks accommodate the contradictory aims pursued by each actor, and facilitate joint activities and repetitive exchanges that have specific directionality and flow of information, commodities, ...

Generalizing relational structures and formal languages to structures whose relations are evaluated by elements of a lattice, we show that such structure classes form a Heyting algebra if and only if the evaluation lattice is a Heyting algebra. Hence various new and some older results obtained for Heyting algebras can be applied to such structure classes.

The fundamental relations that underlie cognitive comparisons—“same” and “different”—can be defined at multiple levels of abstraction, which vary in relational complexity. We compared response times to decide whether or not two sequentially-presented patterns, each composed of two pairs of colored squares, were the same at three levels of abstraction: perceptual, relational, and system (higher ...