Claudia Carapelle

Learn More
Reasoning for Description logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. However, with some restriction on the concrete domain, decidability can be regained. We introduce a novel way to integrate concrete domains D into the well-known description logic ALC, we call the resulting logic ALC(D). We then identify sufficient(More)
We show that satisfiability and finite satisfiability for ECTL with equality-, order-, and modulo-constraints over Z are decidable. Since ECTL is a proper extension of CTL this greatly improves the previously known decidability results for certain fragments of CTL, e.g., the existential and positive fragments and EF. We also show that our choice of local(More)
Recently, we have shown that satisfiability for ECTL∗ with constraints over Z is decidable using a new technique. This approach reduces the satisfiability problem of ECTL∗ with constraints over some structure A (or class of structures) to the problem whether A has a certain model theoretic property that we called EHD (for “existence of homomorphisms is(More)
In the context of real-time systems, Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent and widely used extensions of Linear Temporal Logic. In this paper, we examine the possibility of using MTL and TPTL to specify properties about classes of non-monotonic data languages over the natural numbers. Words in this class may(More)
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent extensions of Linear Temporal Logic to specify properties about data languages. In this paper, we consider the class of data languages of non-monotonic data words over the natural numbers. We prove that, in this setting, TPTL is strictly more expressive than MTL. To this(More)
Reasoning for Description logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. For particular, restricted concrete domains decidablity can be regained. We introduce a novel way to integrate a concrete domain D into the well-known description logic ALC, we call the resulting logic ALC(D). We then identify sufficient conditions(More)
Recently, we have shown that satisfiability for the temporal logic E C T L ∗ with local constraints over (ℤ, <, =) is decidable using a new technique (Carapelle et al., 2013). This approach reduces the satisfiability problem of E C T L ∗ with constraints over some structure 𝓐 $\mathcal {A}$ (or class of structures) to the problem whether 𝓐 $\mathcal {A}$(More)