Polynomial conjunctive query rewriting under unary inclusion dependencies

Ontology-based data access (OBDA) is widely accepted as an important ingredient of the new generation of information systems. In the OBDA paradigm, potentially incomplete relational data is enriched by means of ontologies, representing intensional knowledge of the application domain. We consider the problem of conjunctive query answering in OBDA. Certain ontology languages have been identified as FO-rewritable (e.g., DL-Lite and sticky-join sets of TGDs), which means that the ontology can be incorporated into the user's query, thus reducing OBDA to standard relational query evaluation. However, all known query rewriting techniques produce queries that are exponentially large in the size of the user's query, which can be a serious issue for standard relational database engines. In this paper, we present a polynomial query rewriting for conjunctive queries under unary inclusion dependencies. On the other hand, we show that binary inclusion dependencies do not admit polynomial query rewriting algorithms

Apollo experience report: Development of the extravehicular mobility unit

The development and performance history of the Apollo extravehicular mobility unit and its major subsystems is described. The three major subsystems, the pressure garment assembly, the portable life-support system, and the oxygen purge system, are defined and described in detail as is the evolutionary process that culminated in each major subsystem component. Descriptions of ground-support equipment and the qualification testing process for component hardware are also presented

The Einstein relation generalized to non-equilibrium

The Einstein relation connecting the diffusion constant and the mobility is violated beyond the linear response regime. For a colloidal particle driven along a periodic potential imposed by laser traps, we test the recent theoretical generalization of the Einstein relation to the non-equilibrium regime which involves an integral over measurable velocity correlation functions

On the succinctness of query rewriting over shallow ontologies

We investigate the succinctness problem for conjunctive query rewritings over OWL2QL ontologies of depth 1 and 2 by means of hypergraph programs computing Boolean functions. Both positive and negative results are obtained. We show that, over ontologies of depth 1, conjunctive queries have polynomial-size nonrecursive datalog rewritings; tree-shaped queries have polynomial positive existential rewritings; however, in the worst case, positive existential rewritings can be superpolynomial. Over ontologies of depth 2, positive existential and nonrecursive datalog rewritings of conjunctive queries can suffer an exponential blowup, while first-order rewritings can be superpolynomial unless NP �is included in P/poly. We also analyse rewritings of tree-shaped queries over arbitrary ontologies and note that query entailment for such queries is fixed-parameter tractable

A controlled experiment for the empirical evaluation of safety analysis techniques for safety-critical software

Context: Today's safety critical systems are increasingly reliant on software. Software becomes responsible for most of the critical functions of systems. Many different safety analysis techniques have been developed to identify hazards of systems. FTA and FMEA are most commonly used by safety analysts. Recently, STPA has been proposed with the goal to better cope with complex systems including software. Objective: This research aimed at comparing quantitatively these three safety analysis techniques with regard to their effectiveness, applicability, understandability, ease of use and efficiency in identifying software safety requirements at the system level. Method: We conducted a controlled experiment with 21 master and bachelor students applying these three techniques to three safety-critical systems: train door control, anti-lock braking and traffic collision and avoidance. Results: The results showed that there is no statistically significant difference between these techniques in terms of applicability, understandability and ease of use, but a significant difference in terms of effectiveness and efficiency is obtained. Conclusion: We conclude that STPA seems to be an effective method to identify software safety requirements at the system level. In particular, STPA addresses more different software safety requirements than the traditional techniques FTA and FMEA, but STPA needs more time to carry out by safety analysts with little or no prior experience.Comment: 10 pages, 1 figure in Proceedings of the 19th International Conference on Evaluation and Assessment in Software Engineering (EASE '15). ACM, 201

Horn rewritability vs PTime query evaluation for description logic TBoxes

We study the following question: if τ is a TBox that is formulated in an expressive DL L and all CQs can be evaluated in PTime w.r.t. τ, can τ be replaced by a TBox τ' that is formulated in the Horn-fragment of L and such that for all CQs and ABoxes, the answers w.r.t. τ and τ' coincide? Our main results are that this is indeed the case when L is the set of ALCHI or ALCIF TBoxes of quantifier depth 1 (which covers the majority of such TBoxes), but not for ALCHIF and ALCQ TBoxes of depth 1