Direct Granularity Conversions among Temporal Constraints
| dc.creator | Bettini,Claudio | |
| dc.creator | Ruffini,Simone | |
| dc.date | 2003 | |
| dc.date.accessioned | 2024-02-06T12:52:35Z | |
| dc.date.available | 2024-02-06T12:52:35Z | |
| dc.description | This paper considers temporal constraints that can impose a minimum and maximum time distance between the occurrences of two events by specifying the minimum and maximum values in terms of a time granularity. When several constraints using different time granularities are part of the specification of a single problem, a reasonable question is how to convert the constraints in terms of a single granularity in order to apply standard temporal constraint algorithms. This paper investigates the problem of converting a distance constraint expressed in terms of a granularity into another one in terms of a different time granularity. An expressive formal model for time granularities is assumed including common granularities like hours and days as well as user-defined granularities like business days and academic semesters. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-009-09-1123 | |
| dc.identifier | https://lib.jucs.org/article/28115/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/8410 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 9(9): 1123-1136 | |
| dc.subject | temporal constraints | |
| dc.subject | time granularity | |
| dc.subject | temporal abstraction | |
| dc.title | Direct Granularity Conversions among Temporal Constraints | |
| dc.type | Research Article |