4,777 research outputs found

    A cookbook for temporal conceptual data modelling with description logic

    Get PDF
    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

    Get PDF
    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

    Get PDF
    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

    Dry sediment loading of headwater channels fuels post-wildfire debris flows in bedrock landscapes

    Get PDF
    Landscapes following wildfire commonly have significant increases in sediment yield and debris flows that pose major hazards and are difficult to predict. Ultimately, post-wildfire sediment yield is governed by processes that deliver sediment from hillslopes to channels, but it is commonly unclear the degree to which hillslope sediment delivery is driven by wet versus dry processes, which limits the ability to predict debris-flow occurrence and response to climate change. Here we use repeat airborne lidar topography to track sediment movement following the 2009 CE Station Fire in southern California, USA, and show that post-wildfire debris flows initiated in channels filled by dry sediment transport, rather than on hillsides during rainfall as typically assumed. We found widespread patterns of 1–3 m of dry sediment loading in headwater channels immediately following wildfire and before rainfall, followed by sediment excavation during subsequent storms. In catchments where post-wildfire dry sediment loading was absent, possibly due to differences in lithology, channel scour during storms did not occur. Our results support a fire-flood model in bedrock landscapes whereby debris-flow occurrence depends on dry sediment loading rather than hillslope-runoff erosion, shallow landslides, or burn severity, indicating that sediment supply can limit debris-flow occurrence in bedrock landscapes with more-frequent fires

    Tractable interval temporal propositional and description logics

    Get PDF
    We design a tractable Horn fragment of the Halpern-Shaham temporal logic and extend it to interval-based temporal description logics, instance checking in which is P-complete for both combined and data complexity
    corecore