Complexity of branching temporal description logics

We study branching-time temporal description logics (TDLs) based on the DLs ALC and EL and the temporal logics CTL and CTL*. The main contributions are algorithms for satisfiability that are more direct than existing approaches, and (mostly) tight elementary complexity bounds that range from PTIME to 2EXPTIME and 3EXPTIME. A careful use of tree automata techniques allows us to obtain transparent and uniform algorithms, avoiding to deal directly with the intricacies of CTL*

Temporalised Description Logics for Monitoring Partially Observable Events

Inevitably, it becomes more and more important to verify that the systems surrounding us have certain properties. This is indeed unavoidable for safety-critical systems such as power plants and intensive-care units. We refer to the term system in a broad sense: it may be man-made (e.g. a computer system) or natural (e.g. a patient in an intensive-care unit). Whereas in Model Checking it is assumed that one has complete knowledge about the functioning of the system, we consider an open-world scenario and assume that we can only observe the behaviour of the actual running system by sensors. Such an abstract sensor could sense e.g. the blood pressure of a patient or the air traffic observed by radar. Then the observed data are preprocessed appropriately and stored in a fact base. Based on the data available in the fact base, situation-awareness tools are supposed to help the user to detect certain situations that require intervention by an expert. Such situations could be that the heart-rate of a patient is rather high while the blood pressure is low, or that a collision of two aeroplanes is about to happen. Moreover, the information in the fact base can be used by monitors to verify that the system has certain properties. It is not realistic, however, to assume that the sensors always yield a complete description of the current state of the observed system. Thus, it makes sense to assume that information that is not present in the fact base is unknown rather than false. Moreover, very often one has some knowledge about the functioning of the system. This background knowledge can be used to draw conclusions about the possible future behaviour of the system. Employing description logics (DLs) is one way to deal with these requirements. In this thesis, we tackle the sketched problem in three different contexts: (i) runtime verification using a temporalised DL, (ii) temporalised query entailment, and (iii) verification in DL-based action formalisms

Towards More Useful Description Logics of Time, Change and Context

Description Logics (DLs) are a family of logic-based formalisms for the representation of and reasoning about knowledge. Classical DLs are fragments of first-order logic and therefore aim at capturing static knowledge. Alas, the lack of means of DLs to capture dynamic aspects of knowledge has been often criticized because many important DL applications depend on this kind of knowledge. As a reaction to this shortcoming of DLs, two-dimensional extensions of DLs with capabilities to represent and reason about dynamic knowledge were introduced. We further, in this thesis, the understanding and utility of two-dimensional DLs. We particularly focus on identifying two-dimensional DLs providing the right expressive power to model more accurately temporal and contextual aspects of knowledge required by certain DL applications, or providing better computational properties than other possible alternatives. We pursue three lines of research: we study branching-time temporal DLs that emerge from the combination of classical DLs with the classical temporal logics CTL* and CTL; we study description logics of change that emerge from the combination of classical DLs with the modal logic S5; we study description logics of context that emerge from the combination of classical DLs with multi-modal logics. We investigate temporal and contextual DLs based on the classical DL ALC and on members of the EL-family of DLs. Our main technical contributions are algorithms for satisfiability and subsumption, and (mostly) tight complexity bounds

Past and future of DL-Lite

We design minimal temporal description logics that are capa- ble of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We show that, depending on the required types of temporal and atemporal constraints, the satisfiability problem for temporal knowledge bases in the resulting logics can be NLOGSPACE-, NP- and PSPACE-complete, as well as undecidable