Transformation From Semantic Data Model to Rdf

There have been several efforts to use relational model and database to store and manipulate Resource Description Framework (RDF). They have one general disadvantage, i.e. one is forced to map the model of semantics of RDF into relational model, which will end up in constraints and additional properties, such as, validating each assertion against the RDF schema which also stored as a triplets table. In this paper, we introduce Semantic Data Model as a proposed data model language to store and manipulate Resource Description Framework. This study also tries to prescribe the procedure on transforming a semantic data model into a RDF data model. Keyworsd: Semantic Data Model, Resource Description Framework

Learning from AI : new trends in database technology

Recently some researchers in the areas of database data modelling and knowledge representations in artificial intelligence have recognized that they share many common goals. In this survey paper we show the relationship between database and artificial intelligence research. We show that there has been a tendency for data models to incorporate more modelling techniques developed for knowledge representations in artificial intelligence as the desire to incorporate more application oriented semantics, user friendliness, and flexibility has increased. Increasing the semantics of the representation is the key to capturing the "reality" of the database environment, increasing user friendliness, and facilitating the support of multiple, possibly conflicting, user views of the information contained in a database

Ontology-based model abstraction

In recent years, there has been a growth in the use of reference conceptual models to capture information about complex and critical domains. However, as the complexity of domain increases, so does the size and complexity of the models that represent them. Over the years, different techniques for complexity management in large conceptual models have been developed. In particular, several authors have proposed different techniques for model abstraction. In this paper, we leverage on the ontologically well-founded semantics of the modeling language OntoUML to propose a novel approach for model abstraction in conceptual models. We provide a precise definition for a set of Graph-Rewriting rules that can automatically produce much-reduced versions of OntoUML models that concentrate the models’ information content around the ontologically essential types in that domain, i.e., the so-called Kinds. The approach has been implemented using a model-based editor and tested over a repository of OntoUML models

A generic model of dyadic social relationships

We introduce a model of dyadic social interactions and establish its correspondence with relational models theory (RMT), a theory of human social relationships. RMT posits four elementary models of relationships governing human interactions, singly or in combination: Communal Sharing, Authority Ranking, Equality Matching, and Market Pricing. To these are added the limiting cases of asocial and null interactions, whereby people do not coordinate with reference to any shared principle. Our model is rooted in the observation that each individual in a dyadic interaction can do either the same thing as the other individual, a different thing or nothing at all. To represent these three possibilities, we consider two individuals that can each act in one out of three ways toward the other: perform a social action X or Y, or alternatively do nothing. We demonstrate that the relationships generated by this model aggregate into six exhaustive and disjoint categories. We propose that four of these categories match the four relational models, while the remaining two correspond to the asocial and null interactions defined in RMT. We generalize our results to the presence of N social actions. We infer that the four relational models form an exhaustive set of all possible dyadic relationships based on social coordination. Hence, we contribute to RMT by offering an answer to the question of why there could exist just four relational models. In addition, we discuss how to use our representation to analyze data sets of dyadic social interactions, and how social actions may be valued and matched by the agents

Approaching the Problem of Time with a Combined Semiclassical-Records-Histories Scheme

I approach the Problem of Time and other foundations of Quantum Cosmology using a combined histories, timeless and semiclassical approach. This approach is along the lines pursued by Halliwell. It involves the timeless probabilities for dynamical trajectories entering regions of configuration space, which are computed within the semiclassical regime. Moreover, the objects that Halliwell uses in this approach commute with the Hamiltonian constraint, H. This approach has not hitherto been considered for models that also possess nontrivial linear constraints, Lin. This paper carries this out for some concrete relational particle models (RPM's). If there is also commutation with Lin - the Kuchar observables condition - the constructed objects are Dirac observables. Moreover, this paper shows that the problem of Kuchar observables is explicitly resolved for 1- and 2-d RPM's. Then as a first route to Halliwell's approach for nontrivial linear constraints that is also a construction of Dirac observables, I consider theories for which Kuchar observables are formally known, giving the relational triangle as an example. As a second route, I apply an indirect method that generalizes both group-averaging and Barbour's best matching. For conceptual clarity, my study involves the simpler case of Halliwell 2003 sharp-edged window function. I leave the elsewise-improved softened case of Halliwell 2009 for a subsequent Paper II. Finally, I provide comments on Halliwell's approach and how well it fares as regards the various facets of the Problem of Time and as an implementation of QM propositions.Comment: An improved version of the text, and with various further references. 25 pages, 4 figure