A prerequisite for joining the rapidly growing Semantic Web is to expose data as RDF triples. In the cultural heritage world the data in question is very often a mixture of structured database fields and associated textual documents. Transforming relational database (RDB) content to RDF is not altogether straightforward and the issues are examined as a preliminary to the much more difficult ste...

Let P ⊂ R3 be a polyhedron. It was conjectured that if P is weakly convex (i. e. its vertices lie on the boundary of a strictly convex domain) and decomposable (i. e. P can be triangulated without adding new vertices), then it is infinitesimally rigid. We prove this conjecture under a weak additionnal assumption of codecomposability. The proof relies on a result of independent interest concerni...

The Linked Data (LD) initiative fostered the publication of a large number of relational databases in the Linked Open Data (LOD) cloud. A general and flexible way of publishing relational data in RDF format is to create an RDF view of the underlying relational data (RDB-RDF view). An RDB-RDF view can be materialized to improve query performance and data availability. However, an RDB-RDF view mu...

Kuhn’s incommensurability thesis seems to challenge scientific realism. One response to that challenge is to focus on the continuity of reference. The causal theory of reference in particular seems to offer the possibility of continuity of reference that would provide a basis for the sort of comparability between theories that the realist requires. In “Dubbing and Redubbing: The Vulnerability o...

Let P be a (non necessarily convex) embedded polyhedron in R, with its vertices on an ellipsoid. Suppose that the interior of P can be decomposed into convex polytopes without adding any vertex. Then P is infinitesimally rigid. More generally, let P be a polyhedron bounding a domain which is the union of polytopes C1, · · · , Cn with disjoint interiors, whose vertices are the vertices of P . Su...

A tensegrity polygon is a planar cable-strut tensegrity framework in which the cables form a convex polygon containing all vertices. The underlying edgelabeled graph, in which the cable edges form a Hamilton cycle, is an abstract tensegrity polygon. It is said to be robust if every convex realization as a tensegrity polygon has an equilibrium stress which is positive on the cables and negative ...

Nowadays, the majority of data sources in the current web are stored in Relational Data Bases (RDB), the semantic web main idea is to solve the problem of sharing and reusing information between applications and companies in different common areas, based on data stored in RDBs. This article present a complete automatic approach that generate Ontology from a giving relational database based on a...

Absiraet. in this work we extend results from [4], [3] and [2] about propositional calculi with graded modalities to the predicative level. Our semantic is based on Kripke models with a single domain of interpretation for all the worlds. Therefore the axiomatic system will need a suitable generalization of the Barcan formula. We haven't considered semantics with world-relative domains because t...