Previous |  Up |  Next

Article

Title: Programování s omezujícími podmínkami — na cestě ke svatému grálu (Czech)
Title: Constraint programming – on the way to the Holly Grail (English)
Author: Barták, Roman
Language: Czech
Journal: Pokroky matematiky, fyziky a astronomie
ISSN: 0032-2423
Volume: 45
Issue: 3
Year: 2000
Pages: 218-231
.
Category: math
.
MSC: 68-02
MSC: 68N17
MSC: 68N19
idZBL: Zbl 1049.68558
.
Date available: 2010-12-11T18:04:17Z
Last updated: 2012-08-25
Stable URL: http://hdl.handle.net/10338.dmlcz/141039
.
Reference: [1] Adhikary, J., Hasle, G., Misund, G.: Constraint Technology Applied to Forest Treatment Scheduling.In: Proc. of Practical Application of Constraint Technology (PACT97), London, UK, 1997.
Reference: [2] Barták, R.: On-line Guide to Constraint Programming.Prague, 1998,http://kti.mff.cuni.cz/~bartak/constraints/
Reference: [3] Bellone, J., Chamard, A., Pradeless, C.: PLANE: An Evolutive Planning System for Aircraft Production.In: Proc. of Practical Application of Prolog (PAP92), London, UK, 1992.
Reference: [4] Borning, A.: The Programming Language Aspects of ThingLab, A Constraint-Oriented Simulation Laboratory.In: ACM Transactions on Programming Languages and Systems 3 (4): 252–387, 1981.
Reference: [5] Chan, P., Heus, K., Weil, G.: Nurse Scheduling with Global Constraints in CHIP: GYMNASTE.In: Proc. of Practical Application of Constraint Technology (PACT98), London, UK, 1998.
Reference: [6] Chow, K. P., Perett, M.: Airport Counter Allocation using Constraint Logic Programming.In: Proc. of Practical Application of Constraint Technology (PACT97), London, UK, 1997.
Reference: [7] Dincbas, M., Simonis, H.: APACHE — A Constraint Based, Automated Stand Allocation Systems.In: Proc. of Advanced Software Technology in Air Transport (ASTAIR91), London, UK, 1991.
Reference: [8] Focacci, F., Lamma, E., Mello, P., Milano, M.: Constraint Logic Programming for the Crew Rostering Problem.In: Proc. of Practical Application of Constraint Technology (PACT97), London, UK, 1997.
Reference: [9] Freuder, E. C.: Synthesizing Constraint Expressions.In: Communications ACM 21 (11): 958–966, ACM, 1978. Zbl 0386.68065, MR 0510243
Reference: [10] Frühwirth, T., Brisset, P.: Optimal Placement of Base Stations in Wireless Indoor Telecommunication.In: Proc. of Principles and Practice of Constraint Programming (CP98), Pisa, Italy, 1998.
Reference: [11] Gaschnig, J.: Performance Measurement and Analysis of Certain Search Algorithms.CMU-CS-79-124, Carnegie-Mellon University, 1979.
Reference: [12] Gallaire, H.: Logic Programming: Further Developments.In: IEEE Symposium on Logic Programming, Boston, IEEE, 1985.
Reference: [13] Glover, F., Laguna, M.: Tabu Search.In: Modern Heuristics for Combinatorial Problems, Blackwell Scientific Publishing, Oxford, 1993. Zbl 0774.90033, MR 1665424
Reference: [14] Haralick, R. M., Elliot, G. L.: Increasing tree search efficiency for constraint satisfaction problems.In: Artificial Intelligence 14: 263–314, 1980.
Reference: [15] Jacquet-Lagreze, E.: Hybrid Methods for Large Scale Optimisation Problems: an OR Perspective.In: Proc. of Practical Application of Constraint Technology (PACT98), London, UK, 1998.
Reference: [16] Jaffar, J., Lassez, J. L.: Constraint Logic Programming.In: Proc. The ACM Symposium on Principles of Programming Languages, ACM, 1987.
Reference: [17] Jaffar, J., Maher, M. J.: Constraint Logic Programming — A Survey.J. Logic Programming, 19/20: 503–581, 1996. MR 1279934
Reference: [18] Johansen, B. S., Hasle, G.: Well Activity Scheduling — An Application of Constraint Reasoning.In: Proc. of Practial Application of Constraint Technology (PACT97), London, UK, 1997.
Reference: [19] Kumar, V.: Algorithms for Constraint Satisfaction Problems: A Survey.AI Magazine 13 (1): 32–44, 1992.
Reference: [20] Mackworth, A. K.: Consistency in Networks of Relations.In: Artificial Intelligence 8 (1): 99–118, 1977. Zbl 0341.68061
Reference: [21] Marriot, K., Stuckey, P.: Programming with Constraints: An Introduction.The MIT Press, Cambridge, Mass., 1998. MR 1615090
Reference: [22] Minton, S., Johnston, M. D., Laird, P.: Minimising conflicts: a heuristic repair method for constraint satisfaction and scheduling problems.In: Artificial Intelligence 58 (1–3): 161–206, 1992. MR 1192398
Reference: [23] Monfroy, E.: Solver Collaboration for Constraint Logic Programming.PhD Thesis, l’Universite Henri Poincare-Nancy I, 1996.
Reference: [24] Montanary, U.: Networks of constraints: Fundamental properties and applications to picture processing.In: Information Science 7: 95–132, 1974. MR 0413625
Reference: [25] Nadel, B.: Tree Search and Arc Consistency in Constraint Satisfaction Algorithms.In: Search in Artificial Intelligence, Springer-Verlag, New York, 1988. MR 1019101
Reference: [26] Nilsson, N. J.: Principles of Artificial Intelligence.Tioga, Palo Alto, 1980. Zbl 0422.68039
Reference: [27] Perett, M.: Using Constraint Logic Programming Techniques in Container Port Planning.In: ICL Technical Journal, May: 537–545, 1991.
Reference: [28] Selman, B., Kautz, H.: Domain-independent extensions to GSAT: Solving Large Structured Satisfiability Problems.In: Proc. IJCAI-93, 1993.
Reference: [29] Simonis, H., Aggoun, A.: Search Tree Debugging.Technical Report, COSYTEC SA, 1997.
Reference: [30] Sutherland, I.: Sketchpad: a man-machine graphical communication system.In: Proc. IFIP Spring Joint Computer Conference, 1963.
Reference: [31] Tsang, E.: Foundations of Constraint Satisfaction.Academic Press, London, 1995.
Reference: [32] Hentenryck, P. van: Constraint Satisfaction in Logic Programming.The MIT Press, Cambridge, Mass., 1989. MR 1013366
Reference: [33] Hentenryck, P. van, Michel, L., Deville, Y.: Numerica: A Modeling Language for Global Optimization.The MIT Press, Cambridge, Mass., 1997.
Reference: [34] Waltz, D. L.: Understanding line drawings of scenes with shadows.In: Psychology of Computer Vision, McGraw-Hill, New York, 1975. MR 0395290
.

Files

Files Size Format View
PokrokyMFA_45-2000-3_4.pdf 355.1Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo