Supporting the Design of Ontologies for Data Access

We study the data complexity of conjunctive query answering under these new semantics, and show a general tractability result for all known first-order rewritable ontology languages.

The distinguishing feature of STARQL is its general stream windowing and ABox sequencing strategy which allows it to plugin well known query languages such as unions of

In these applications, the probability measures that are involved are replaced by uniform probability measures on discrete point sets, and we use our algorithm to solve the

Time-average approximation and principal component analysis of the stochastic process underlying the functional data are the main tools for adapting NIPALS algorithm to estimate

This paper presents the solution, which allows attractive visualisation of the data computed using a 1D blood flow model.. Review of existing algorithms and analysis of

This work addresses this problem by introducing a temporal query language that extends a well-investigated temporal query language with probability operators, and investigating

This paper describes a generic Ontology Design Pattern (ODP) based on a project to convert bibliographic records from Montana State University’s Open Access Institutional

Both the Biological Collections Ontology (BCO) and the Ontologized Minimum Information About BIobank data Sharing (OMIABIS) are ontologies rooted in specimens and