Abstract
Time granularity constraint reasoning is likely to have a relevant role in emerging applications like GIS, time management in the Web and Personal Information Management applications for mobile systems. This paper reports recent advances in the development of a system for solving temporal constraint satisfaction problems where distance constraints are specified in terms of arbitrary time granularities. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Bettini, C., Mascetti, S., & Pupillo, V. (2005). A system prototype for solving multi-granularity temporal CSP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3419 LNAI, pp. 142–156). https://doi.org/10.1007/11402763_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
