Sciweavers

67 search results - page 2 / 14
» Reasoning on temporal class diagrams: Undecidability results
Sort
View
ENTCS
2010
120views more  ENTCS 2010»
13 years 5 months ago
Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings
The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of interval structures in whi...
Davide Bresolin, Dario Della Monica, Valentin Gora...
FROCOS
2011
Springer
12 years 4 months ago
Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models
Temporal data models have been used to describe how data can evolve in the context of temporal databases. Both the Extended Entity-Relationship (EER) model and the Unified Modelli...
Alessandro Artale, Roman Kontchakov, Vladislav Ryz...
LICS
2010
IEEE
13 years 3 months ago
The Isomorphism Problem on Classes of Automatic Structures
Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is 0 1complete. (ii)...
Dietrich Kuske, Jiamou Liu, Markus Lohrey
CADE
2005
Springer
14 years 5 months ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev
LICS
2010
IEEE
13 years 3 months ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...