Learn More
The recently introduced series of description logics under the common moniker 'DL-Lite' has attracted attention of the description logic and semantic web communities due to the low computational complexity of inference, on the one hand, and the ability to represent conceptual modeling formalisms, on the other. The main aim of this article is to carry out a(More)
Many types of part-whole relations have been proposed in the literature to aid the conceptual modeller to choose the most appropriate type, but many of those relations lack a formal specification to give clear and unambiguous semantics to them. To remedy this, a formal taxonomy of types of mereological and meronymic part-whole relations is presented that(More)
It is known that for temporal languages, such as first-order LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal description logics as well: constant binary relations together with general concept subsumptions in combinations of LT L and the basic description logic ALC cause undecidability. In(More)
This paper presents a semantic foundation of temporal conceptual models used to design temporal information systems. We consider a modeling language able to express both times-tamping and evolution constraints. We conduct a deeper investigation on evolution constraints, eventually devising a model-theoretic semantics for a full-fledged model with both(More)
A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed by temporally relating actions and world states. The temporal languages are members of the family of Description Logics,(More)
This paper introduces a new logical formalism, intended for temporal conceptual modelling , as a natural combination of the well-known description logic ÄÊ and point-based linear temporal logic with Since and Until. The expressive power of the resulting ÄÊÍË logic is illustrated by providing a characterisation of the most important temporal conceptual(More)
We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs: ISA between entities and relationships, disjointness and covering of entities and relationships, cardinality constraints for entities in relationships and their refinements as well as(More)