67 search results - page 1 / 14 » Reasoning on temporal class diagrams: Undecidability results |
AMAI
2006
Springer
13 years 4 months ago
2006
Springer
CSL
2008
Springer
13 years 6 months ago
2008
Springer
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
TIME
1994
IEEE
13 years 8 months ago
1994
IEEE
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
ENTCS
2007
13 years 4 months ago
2007
This paper establishes undecidability of satisfiability for multi-modal logic equipped with the hybrid binder ↓ , with respect to frame classes over which the same language wit...
TIME
2007
IEEE
13 years 11 months ago
2007
IEEE
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...