Automated deduction by theory resolution
Journal of Automated Reasoning
Calendrical calculations
Symbolic representation of user-defined time granularities
Annals of Mathematics and Artificial Intelligence
Efficient Resolution Mechanism for Fuzzy Temporal Constraint Logic
TIME '00 Proceedings of the Seventh International Workshop on Temporal Representation and Reasoning (TIME'00)
A scheme for integrating concrete domains into concept languages
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Possibilistic temporal reasoning based on fuzzy temporal constraints
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
| Hi-index | 0.00 |
The CTTN–system is a computer program which provides advanced processing or temporal notions. The basic data structures of the CTTN–system are time points, crisp and fuzzy time intervals, labelled partitionings of the time line, durations, and calendar systems. The labelled partitionings are used to model periodic temporal notions, quite regular ones like years, months etc., partially regular ones like timetables, but also very irregular ones like, for example, dates of a conference series. These data structures can be used in the temporal specification language GeTS (GeoTemporal Specifications). GeTS is a functional specification and programming language with a number of built-in constructs for specifying customised temporal notions. CTTN is implemented as a Web server and as a C++ library. This paper gives a short overview over the current state of the system and its components.