Sciweavers

2273 search results - page 119 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
SEBD
2001
145views Database» more  SEBD 2001»
14 years 11 months ago
Reasoning over Conceptual Schemas and Queries in Temporal Databases
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
Alessandro Artale, Enrico Franconi, Milenko Mosuro...
TIME
2002
IEEE
15 years 2 months ago
Representation and Reasoning with Disjunctive Temporal Constraints
We show the expressiveness provided by a Labelled point-based metric model for specifying and reasoning about complex disjunctive temporal constraints. The model allows us to mana...
María Isabel Alfonso Galipienso, Federico B...
ICALP
2009
Springer
15 years 2 months ago
Decidability of the Guarded Fragment with the Transitive Closure
We consider an extension of the guarded fragment in which one can guard quantiers using the transitive closure of some binary relations. The obtained logic captures the guarded fr...
Jakub Michaliszyn
LICS
1999
IEEE
15 years 2 months ago
Entailment of Atomic Set Constraints is PSPACE-Complete
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
Joachim Niehren, Martin Müller, Jean-Marc Tal...
AAAI
2010
14 years 11 months ago
Past and Future of DL-Lite
We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We ...
Alessandro Artale, Roman Kontchakov, Vladislav Ryz...