Abstract
The paper describes the approach and prototype of the tool for handling uncertainty in probabilistic interpretation in the framework of Constraint Logic Programming (CLP). The approach is intended to formulate real-life scheduling, planing, manufacturing problems more adequate to real situation with regard to uncertainty of input information. The main features and implementation of the tool integrated in the CLP(R) system [1] are described briefly. Theoretical background of the approach is a probabilistic logic introduced by N.Nilsson [2]. Calculation of probabilities for the goals in probabilistic logic programs is performed by means of Monte-Carlo method as suggested in [3]. The pilot application for dealing with network based project planing is presented in order to demonstrate the technology of the tool usage. We also discuss possible ways of speeding up the Logical Inference with Probability (LIP) by means of the so-called Success Formula that allows to skip unproductive trials and increase efficiency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jaffar J., Michaylov S., Stuckey P.J., Yap R.H.C., 1992, The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, 14(3). 339–395.
Nilsson N.J., 1986, Probabilistic Logic. Artificial Intelligence, 18(1), 71–87.
Dantsin E., Kreynovich V., 1989, Probabilistic Inference in Forecasting Systems, Reports of the Russian Academy of Science (mathematics), 307(1), 17–21 (in Russian).
Sterling L., Shapiro E., 1986, The Art of Prolog, MIT Press, Cambridge. MA.
Fruhwirth T., Herold A., Kuchenhoff V., Provost T., Lim P., Monfroy E., Wallace M., 1993, Constraint Logic Programming. An Informal Introduction. Tech. Report ECRC-93-5. Munich. Germany.
Van Hentenryck, P., 1989, Constraint Satisfaction in Logic Programming, MIT Press, Cambridge, MA.
Aggoun A., Beldiceanu N., 1993, Extending CHIP in order to solve Complex Scheduling and Placement Problems. Math. Comput. Modelling. 17(7), 57–73.
Bigelow C.G., 1962, Bibliography on Project Planning and Control by Network Analysis. Operations Res., 10, 728–731.
Elkan C., 1994, The paradoxical success of Fuzzy Logic, IEEE Expert — Intelligent systems & their applications., Aug.
Dantsin E., 1992, Probabilistic Logic Programming and their Semantic. Lecture Notes in Computer Science. 592, Springer-Verlag, 152-164.
Hoeffding W., 1963, Probability inequalities for sums of bounded random variables, J. Amer. Statist. Assoc. 58(301), 13–30.
Valkovsky V. Gerasimov M., Evgrafov A., Sawin K., 1996, Probabilistic Constraint Logic Programming. Tech Report TR-1996-8. Dept. of Software Engineering and Computer Application, St. Petersburg State Electrotechnical University, St. Petersburg. Russia.
Dantsin E., Valkovsky V., 1996, Abductive Reasoning in Probabilistic Prolog, Proceedings of the Second Workshop of INTAS-93-1702 project Efficient Symbolic Computing, St. Petersburg, Russia, October.
Souder W.E., 1978, Project choice. Project Tasks Scheduling and Project Management in Handbook of Operational Research, ed. Moder J.J. and Elmaghraby, Van Nostrand Reinhold Company.
Ventsel E.S., 1972, Operations Research, Moscow, Russia (in Russian).
Fazard W., 1962, The origin of PERT, The Controller, (December 1962). 598-602, 618-621.
Gunter R.C., 1979, Management methodology for software product engineering, A Wiley-Interscience publication. J. Wiley&Sons, NY-Chichester-Brisbane-Toronto.
Valkovsky V.B., Gerasimov M.B., Sawin K.O., 1996, CLP with Probability in Scheduling Problems. Proceedings of the Second International Conference on the Practical Application of Constraint Technology, London. UK. April. 299-315.
Gerasimov M.B., 1995, Investigation of efficiency of logical inference with probability in CLP, MSc Thesis, St. Petersburg State Electrotechnical University, St.Petersburg. Russia (in Russian).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag London
About this paper
Cite this paper
Valkovsky, V.B., Savvin, K.O., Gerasimov, M.B. (1998). Handling Probabilistic Uncertainty in Constraint Logic Programming. In: Chawdhry, P.K., Roy, R., Pant, R.K. (eds) Soft Computing in Engineering Design and Manufacturing. Springer, London. https://doi.org/10.1007/978-1-4471-0427-8_26
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0427-8_26
Publisher Name: Springer, London
Print ISBN: 978-3-540-76214-0
Online ISBN: 978-1-4471-0427-8
eBook Packages: Springer Book Archive