论文信息 - Using clp(FD) to Support Air Traffic Flow Management

Using clp(FD) to Support Air Traffic Flow Management

In this paper, a Constraint Logic Programming (CLP) approach is used to solve an Air Traffic Flow Management (ATFM) problem, the aircraft departure slot allocation. Moreover, our purpose is to show that CLP, combining the declarativity of logic programming with the efficiency of constraint solving, is well suited to model many combinatorial optimization problems involved in the ATFM domain. clp(FD), a Constraint Logic Programming language with Finite Domain constraints has been chosen to implement our practical application.

[1] Pascal Van Hentenryck. Constraint satisfaction in logic programming , 1989, Logic programming.

[2] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[3] Pascal Van Hentenryck,et al. A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[4] Bernard A. Nadel,et al. Constraint satisfaction algorithms 1 , 1989, Comput. Intell..

[5] Philippe Codognet,et al. A Minimal Extension of the WAM for clp(FD) , 1993, ICLP.

[6] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..

[7] Eugene C. Freuder,et al. Constraint satisfaction using constraint logic programming , 1994 .

[8] Joxan Jaffar,et al. Constraint logic programming , 1987, POPL '87.