Göm menyn
Files: Description Format
Fulltext PDF (requires Acrobat Reader)
Fulltext PostScript (requires a PostScript Reader)
Authors: Thierry Vidal and Hélène Fargier
Article title: Contingent durations in temporal CSPs: from consistency to controllabilities
Publ. type: Article
Volume: 2
Article No: 2
Language: English
Abstract [en]: A Temporal CSP is a network of time-points related by binary constraints expressing maximal and minimal durations between them. This formalism has proven to be useful in many different research areas, but it has also proven to be limited in the sense that it does not take into account the contingent nature of some constraints: in many real applications, we cannot decide some effective durations that are not under our control but will be provided by the external world. This paper aims at proposing an extension of TCSP that enables the expression of such constraints. Here indeed the classical consistency property must be redefined in terms of controllability of the network : in outline, a network is controllable iff it is consistent in the classical sense in any situation that could arise in the external world, i.e. whatever the actual durations of the contingent intervals are. A more in-depth analysis leads to the identification of three different levels of controllability, the Strong, the Weak and the Dynamic one. The paper will focus on the representation and concept issues, with some hints on their relevance in different domains. The reasoning aspects (complexity and algorithms) will only be sketched in this preliminary report.
Publisher: Linköping University Electronic Press
Year: 1997
Available: 1997-01-22
No. of pages: 10
Series: Linköping Electronic Articles in Computer and Information Science
ISSN: 1401-9841

Responsible for this page: Peter Berkesand
Last updated: 2017-02-21