937 research outputs found
Tailoring temporal description logics for reasoning over temporal conceptual models
Temporal data models have been used to describe how data can evolve in the context of temporal databases. Both the Extended Entity-Relationship (EER) model and the Unified Modelling Language (UML) have been temporally extended to design temporal databases. To automatically check quality properties of conceptual schemas various encoding to Description Logics (DLs) have been proposed in the literature. On the other hand, reasoning on temporally extended DLs turn out to be too complex for effective reasoning ranging from 2ExpTime up to undecidable languages. We propose here to temporalize the ālight-weightā DL-Lite logics obtaining nice computational results while still being able to represent various constraints of temporal conceptual models. In particular, we consider temporal extensions of DL-Lite^N_bool, which was shown to be adequate for capturing non-temporal conceptual models without relationship inclusion, and its fragment DL-Lite^N_core with most primitive concept inclusions, which are nevertheless enough to represent almost all types of atemporal constraints (apart from
covering)
Developing Genetic Tools for Geobacillus
Bacillus and Geobacillus are the primary bacterium used in biotechnology industries due to their ability to excrete extracellular materials such as proteins, enzymes and other byproducts. Bacillus subtilis, has a well-characterized competence machinery, giving way to characterized genetic tools. However, a significant problem associated with working with Bacillus is the regulation of endospore formation. An alternative to Bacillus is Geobacillus, a thermophilic bacterium. Thermophiles offer significant advantages over other bacteria as host organisms in biofuel, bioremediation, and biocatalyst processes. However, the genetic tools and competency associated with Geobacillus is still unknown. Through, genetic engineering the ability of ComK to induce competency in Geobacillus is being studied. By inducing competency in this species biotechnology industries can be revolutionized
Analytic solution of nonlinear fractional Burgers-type equation by invariant subspace method
In this paper we study the analytic solutions of Burgers-type nonlinear
fractional equations by means of the Invariant Subspace Method. We first study
a class of nonlinear equations directly related to the time-fractional Burgers
equation. Some generalizations linked to the forced time-fractional Burgers
equations and variable-coefficient diffusion are also considered. Finally we
study a Burgers-type equation involving both space and time-fractional
derivatives
DL-lite with attributes and datatypes
We extend the DL-Lite languages by means of attributes and datatypes. Attributes -- a notion borrowed from data models -- associate concrete values from datatypes to abstract objects and in this way complement roles, which describe relationships between abstract objects. The extended languages remain tractable (with a notable exception) even though they contain both existential and (a limited form of) universal quantification. We present complexity results for two most important reasoning problems in DL-Lite: combined complexity of knowledge base satisfiability and data complexity of positive existential query answering
A cookbook for temporal conceptual data modelling with description logic
We design temporal description logics suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Lite logics with three types of concept inclusions (ranging from atomic concept inclusions and disjointness to the full Booleans), as well as cardinality constraints and role inclusions. In the temporal dimension, they capture future and past temporal operators on concepts, flexible and rigid roles, the operators `always' and `some time' on roles, data assertions for particular moments of time and global concept inclusions. The logics are interpreted over the Cartesian products of object domains and the flow of time (Z,<), satisfying the constant domain assumption. We prove that the most expressive of our temporal description logics (which can capture lifespan cardinalities and either qualitative or quantitative evolution constraints) turn out to be undecidable. However, by omitting some of the temporal operators on concepts/roles or by restricting the form of concept inclusions we obtain logics whose complexity ranges between PSpace and NLogSpace. These positive results were obtained by reduction to various clausal fragments of propositional temporal logic, which opens a way to employ propositional or first-order temporal provers for reasoning about temporal data models
Temporalising OWL 2 QL
We design a temporal description logic, TQL, that extends the standard ontology language OWL2QL, provides basic means for temporal conceptual modelling and ensures first-order rewritability of conjunctive queries for suitably defined data instances with validity time
Temporal description logic for ontology-based data access
Our aim is to investigate ontology-based data access over temporal data with validity time and ontologies capable of temporal conceptual modelling. To this end, we design a temporal description logic, TQL, that extends the standard ontology language OWL2QL, provides basic means for temporal conceptual modelling and ensures first-order rewritability of conjunctive queries for suitably defined data instances with validity time
- ā¦