L. Adianto and J.C. Tay (Singapore)
temporal constraint, constraint satisfaction problem, TCSP, Interval Algebra, Path Consistency Algorithm
This paper describes the work involved in extending the existing Constraint Specification Language (or CSL) with temporal constraints. CSL is a specification language for specifying the constraint satisfaction problem (or CSP). It is used in conjunction with APACS, an interactive performance measurement architecture for benchmarking new CSP algorithms. In this paper, we describe the challenges that we faced during the development of temporal constraints within CSL. The pros and cons of using CSL to represent the temporal constraint satisfaction problem (or TCSP) is discussed. Extensions of Allen's constraints and algorithms to facilitate interpretability and efficiency are presented. Finally, we provide proposals for future extensions of CSL.
Important Links:
Go Back
