A Decision Generator Shell in Prolog

  • K. M. van Hee
  • W. P. M. Nuijten
Part of the CISM International Centre for Mechanical Sciences book series (CISM, volume 320)


Many decision problems can be considered as searching for an element in a finite set. Classical approaches lead to sophisticated combinatorial optimization algorithms that exploit a lot of the structure of the decision situation. Often these algorithms are not easy to adapt to new constraints on decisions imposed by the decision makers.

Our approach to the generation of decisions is to use general search methods that are easy to adapt in case of new constraints. In general they give less good decisions but are more robust. A general-purpose shell based on these search methods is sketched using Prolog. As an illustration two decision problems are treated: the travelling salesman problem and precedence constrained scheduling.


Completion Time Decision Support System Search Method Domain Knowledge Travelling Salesman Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Aarts, E.H.L. and Korst, J., Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing, Wiley, 1989.Google Scholar
  2. Checkland, P., Systems Thinking and Systems Practice, Wiley, 1981.Google Scholar
  3. Eiben, A.E. and van Hee, K.M.: Knowledge Representation and Search Methods for Decision Support Systems, in: Gaul, W. and Schader, M., Ed., Data, Expert Knowledge and Decisions, Springer -Verlag, 1990.Google Scholar
  4. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman and Co, 1978.Google Scholar
  5. van Hee, K.M. and Lapinski, A., OR and AI approaches to decision support, Decision Support Systems 4 (1989), pp 447–459.Google Scholar
  6. Keen, P.G.W. and Scott Morton, M.S., Decision support systems: an organized perspective, Addison-Wesley, 1978.Google Scholar
  7. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G. and Shmoys, D.B., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, 1985.MATHGoogle Scholar
  8. Papadimitriou, C.H. and Stieglitz, K., Combinatorial optimization: algorithms and complexity, Prentice -Hall, 1982.Google Scholar
  9. Pearl, J.R., Artificial intelligence: the heuristic programming approach, McGraw-Hill, 1971.Google Scholar
  10. Schnupp, P. and Bernhard L.W., Productive Prolog Programming, Prentice Hall, 1986.Google Scholar
  11. Spivey, M., The Z notation, Prentice Hall, 1989.Google Scholar

Copyright information

© Springer-Verlag Wien 1991

Authors and Affiliations

  • K. M. van Hee
    • 1
  • W. P. M. Nuijten
    • 1
  1. 1.Eindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations