The Manual of NCL (1998)
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Jianyang Zhou},
title = {The Manual of NCL},
journal = {Loria, Campus Scientifique - BP 239},
year = {1998},
volume = {54506}
}
Bookmarks
OpenURL
Abstract:
The principal goal of designing NCL is to provide programmers with a declarative language, which is fast to learn and easy to use, for solving a large scope of combinatorial problems. To develop NCL (Natural Constraint Language in Te ) became the author's idea in early 1995. It was mainly designed and used during the author's thesis work for solving the famous job-shop scheduling problem [14], supervised by Alain Colmerauer. Several hard instances of the problem have been solved. Part of NCL's constraint library has been used for solving a transportation problem of a public service for handicapped people [4]. Concerning license agreement, Jianyang Zhou reserves the copyright of this document and the corresponding software NCL. Permission to use, copy, and distribute version 1.2 of NCL for any purpose without fee is hereby granted, provided that this entire notice is included in all copies of the system. Concerning warranty, though the software has been used for a long time, it is insufficiently tested and debugged. So the software is being provided \as is", without any expressed or implied warranty. In particular, the author does not make any representation or warranty of any kind concerning the merchantability of the software or its fitness for any particular purpose. Finally, please also note that the present document is not detailed.
Citations
| 270 | The Oz programming model – Smolka - 1995 |
| 262 | An introduction to PROLOGIII – Colmerauer - 1990 |
| 262 | AMPL: A Modeling Language for – Fourer, Gay, et al. - 1993 |
| 133 | Compiling constraints in clp(fd – Codognet, Diaz - 1996 |
| 127 | Analysis of constraint logic programs – Marriott, Sondergaard - 1990 |
| 7 | A Permutation-Based Approach for Solving the Job-Shop Problem – Zhou - 1997 |
| 5 | cplex, user’s manual – ILOG - 2000 |
| 5 | The Number of Knight’s Tours Equals 33,439,123,484,294 – Counting with Binary Decision Diagrams – Löbbing, Wegener - 1996 |
| 4 | ECLiPSe 3.5 – ECRC - 1995 |
| 3 | The constraint logic language CHIP – Dincbas, Hentenrick, et al. - 1988 |
| 2 | Generating feasible schedules for a pick-up and delivery problem – Domenjoud, Kirchner, et al. - 1998 |
| 2 | Designing and implementing a natural constraint language for solving combinatorial problems – Zhou - 1997 |
| 1 | manuel de – Le - 1996 |
| 1 | Calculs d'enfer. Vision Mathematique – Stewart - 1994 |
