DocumentCode :
3127645
Title :
Contingent durations in temporal CSPs: from consistency to controllabilities
Author :
Vidal, Thierry ; Fargier, Hélène
Author_Institution :
Dept. of Comput. & Inf. Sci., Linkoping Univ., Sweden
fYear :
1997
fDate :
10-11 May 1997
Firstpage :
78
Lastpage :
85
Abstract :
Temporal Constraint Networks (TCSP) allow to express minimal and maximal durations between time-points. Though being used in many research areas, this model disregards the contingent nature of some constraints, whose effective duration cannot be decided by the system but is provided by the external world. We propose an extension of TCSP in which the classical network consistency property must be redefined in terms of controllability: intuitively, we would like to say that a network is controllable if it is consistent in any situation (i.e. any assignment of the whole set of contingent intervals) that may arise in the external world. Three levels of controllability must be distinguished, namely the Strong, the Weak and the Dynamic ones. This preliminary report mainly stresses the representation and concept issues, discussing their relevance in dynamic application domains, and partially tackles the reasoning issues (complexity, algorithms and tractable subclasses)
Keywords :
constraint handling; controllability; temporal logic; Dynamic; Strong; Temporal Constraint Networks; Weak; classical network consistency property; complexity; controllability; reasoning issues; temporal CSPs; tractable subclasses; Algebra; Computer networks; Electronic mail; Information science; Intelligent networks; Logic functions; Multimedia databases; Numerical models; Stress; Systems engineering and theory;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Temporal Representation and Reasoning, 1997. (TIME '97), Proceedings., Fourth International Workshop on
Conference_Location :
Dayton Beach, FL
Print_ISBN :
0-8186-7937-9
Type :
conf
DOI :
10.1109/TIME.1997.600786
Filename :
600786
Link To Document :
بازگشت