References

[Aggoun & Beldiceanu 92]

A. Aggoun and N. Beldiceanu, Extending CHIP in order to Solve Complex Scheduling and Placement Problems, Mathl. Comput. Modelling, vol. 17, no. 7, pp. 57--73, Pergamon Press Ltd., 1993.

[Ali & Karlsson 92]

K.A.M. Ali and R. Karlsson, Scheduling Speculative work in MUSE and Performance Results, International Journal of Parallel Programming, Vol 21, No.6, December 1992.

[Aronsson 91]

M. Aronsson, Methodology and Programming Techniques in GCLAII. In Proceedings of the second Workshop on Extensions of Logic Programming (ELP), by Eriksson, Hallnas, and Schroeder-Heister (eds.), held at SICS, Stockholm, Sweden 1991, to be published in Lecture Notes in Artificial Intelligence, Springer-Verlag. Also available as research report SICS R92:05.

[Aronsson 93]

M. Aronsson, Implementational Issues in GCLA: A-Sufficiency and the Definiens operation, in Proceedings of the third Workshop on Extensions of Logic Programming (ELP), LNAI 660, Springer Verlag, 1993.

[Beldiceanu & Contejean 94]

N. Beldiceanu and E. Contejean, Introducing Global Constraints in CHIP, Mathl. Comput. Modelling, vol. 20, no. 12, pp. 97--123, Pergamon Press Ltd., 1994.

[Bryant 86]

R.E. Bryant, Graph-Based Logarithms for Boolean Function Manipulation, IEEE Trans. on Computers, August, 1986.

[Carlsson 90]

M. Carlsson, Design and Implementation of an OR-Parallel Prolog Engine, SICS Dissertation Series 02, 1990.

[Carreiro & Gelernter 89a]

N. Carreiro and D. Gelernter, Linda in Context, Comm. of the ACM, 32(4) 1989.

[Carreiro & Gelernter 89b]

N. Carreiro and D. Gelernter, How to Write Parallel Programs: A Guide to the Perplexed, ACM Computing Surveys, September 1989.

[Clocksin & Mellish 81]

W.F. Clocksin and C.S. Mellish, Programming in Prolog, Springer-Verlag, 1981.

[Colmerauer 75]

A. Colmerauer, Les Grammaires de Metamorphos, Technical Report, Groupe d'Intelligence Artificielle, Marseille-Luminy, November, 1975.

[Colmerauer 90]

Colmerauer A.: An Introduction to Prolog III, Communications of the ACM, 33(7), 69-90, 1990.

[Conery 83]

J. Conery, The AND/OR Process Model for Parallel Interpretation of Logic Programs, PhD thesis, University of California at Irvine, 1983.

[Diaz & Codognet 93]

D. Diaz and P. Codognet, A Minimal Extension of the WAM for clp(FD), Proceedings of the International Conference on Logic Programming, MIT Press, 1993.

[Elshiewy 90]

N.A. Elshiewy, Robust Coordinated Reactive Computing in Sandra, SICS Dissertation Series 03, 1990.

[Falkman & Torgersson 94]

G. Falkman and O. Torgersson, Programming Methodologies in GCLA, in Proceedings of the fourth Workshop on Extensions of Logic Programming (ELP), LNAI 798, Springer Verlag, 1994.

[Gorlick & Kesselman 87]

M.M. Gorlick and C.F. Kesselman, Timing Prolog Programs Without Clocks, Proc. Symposium on Logic Programming, pp. 426--432, IEEE Computer Society, 1987.

[Hausman 90]

B. Hausman, Pruning and Speculative Work in OR-Parallel PROLOG, PhD thesis, Department of Telecommunication and Computer Systems, The Royal Institute of Technology, Stockholm, 1990.

[Heintze et al. 87]

N. Heintze, J. Jaffar, S. Michaylov, P. Stuckey, R. Yap, The CLP(R) Programmers Manual, Monash University, Clayton, Victoria, Australia, Department of Computer Science, 1987.

[Hermenegildo and Greene 90]

M.V. Hermenegildo and K.J. Greene, &-Prolog and its performance: Exploiting Independent And-Parallelism, Proceedings of the Seventh ICLP, Jerusalem, MIT Press, 1990.

[Holzbaur 90]

C. Holzbaur, Specification of Constraint Based Inference Mechanism through Extended Unification, dissertation, Dept. of Medical Cybernetics & AI, University of Vienna, 1990.

[Holzbaur 92]

C. Holzbaur, A High-Level Approach to the Realization of CLP Languages, Proceedings of the JICSLP92 Post-Conference Workshop on Constraint Logic Programming Systems, Washington D.C., 1992.

[Holzbaur 92]

C. Holzbaur, Metastructures vs. Attributed Variables in the Context of Extensible Unification, in M. Bruynooghe & M. Wirsing (eds.), Programming Language Implementation and Logic Programming, Springer-Verlag, LNCS 631, pp. 260-268, 1992.

[Holzbaur 94]

C. Holzbaur, A Specialized, Incremental Solved Form Algorithm for Systems of Linear Inequalities, Austrian Research Institute for Artificial Intelligence, Vienna, TR-94-07, 1994.

[Jaffar & Michaylov 87]

J. Jaffar, S. Michaylov, Methodology and Implementation of a CLP System, in J.L. Lassez (ed.), Logic Programming - Proceedings of the 4th International Conference - Volume 1, MIT Press, Cambridge, MA, 1987.

[Karlsson 92]

R. Karlsson, A High Performance OR-parallel Prolog System, PhD thesis, Department of Telecommunication and Computer Systems, The Royal Institute of Technology, Stockholm, 1992.

[Kowalski 74]

R.A. Kowalski, Logic for Problem Solving, DCL Memo 75, Dept of Artificial Intelligence, University of Edinburgh, March, 1974.

[Kowalski 79]

R.A. Kowalski, Artificial Intelligence: Logic for Problem Solving. North Holland, 1979.

[Kreuger 91]

P. Kreuger, GCLAII--A definitional approach to control. In Proceedings of the second Workshop on Extensions of Logic Programming (ELP), by Eriksson, Hallnas, and Schroeder-Heister (eds.), held at SICS, Stockholm, Sweden 1991, to be published in Lecture Notes in Artificial Intelligence, Springer-Verlag. Also available as research report SICS R92:09.

[Lusk et al. 90]

E. Lusk, D.H.D. Warren, S. Haridi et al., The Aurora Or-Parallel System, New Generation Computing vol. 7 nos. 2--3 pp. 243--271, 1990.

[McCabe 92]

F. McCabe, Logic and Objects, Prentice Hall, 1992.

[O'Keefe 90]

R.A. O'Keefe, The Craft of Prolog, MIT Press, 1990.

[Ousterhout 94]

John K. Ousterhout, Tcl and the Tk Toolkit. Addison-Wesley, 1994.

[Pereira & Warren 80]

F.C.N. Pereira and D.H.D. Warren, Definite clause grammars for language analysis--a survey of the formalism and a comparison with augmented transition networks in Artificial Intelligence 13:231-278, 1980.

[Regin 94]

J.-C. Regin, A filtering algorithm for constraints of difference in CSPs, Proc. of the Twelfth National Conference on Artificial Intelligence (AAAI-94), pp. 362--367, 1994

[Robinson 65]

J.A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, Journal of the ACM 12:23-44, January 1965.

[Roussel 75]

P. Roussel, Prolog : Manuel de Reference et d'Utilisation, Groupe d'Intelligence Artificielle, Marseille-Luminy, 1975.

[Saraswat 90]

V. Saraswat, Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, 1990.

[Sterling & Shapiro 86]

L. Sterling and E. Shapiro, The Art of Prolog. The MIT Press, Cambridge MA, 1986.

[Van Hentenryck 89]

P. Van Hentenryck, Constraint Satisfaction in Logic Programming, Logic Programming Series, The MIT Press, 1989.

[Van Hentenryck et al. 92]

P. Van Hentenryck, V. Saraswat and Y. Deville, Constraint processing in cc(FD), unpublished manuscript, 1992.

[Van Hentenryck & Deville 91]

P. Van Hentenryck and Y. Deville, The Cardinality Operator: a new logical connective and its application to constraint logic programming, In: Eighth International Conference on Logic Programming, 1991.

[Van Hentenryck et al. 95]

P. Van Hentenryck, V. Saraswat and Y. Deville, Design, implementation and evaluation of the constraint language cc(FD). In A. Podelski, ed., Constraints: Basics and Trends, volume 910 of Lecture Notes in Computer Science. Springer-Verlag, 1995.

[Warren 77]

D.H.D. Warren, Applied Logic--Its Use and Implementation as a Programming Tool, PhD thesis, Edinburgh University, 1977. Available as Technical Note 290, SRI International.

[Warren 83]

D.H.D. Warren, An Abstract Prolog Instruction Set, Technical Note 309, SRI International, 1983.

[Wirth 76]

N. Wirth, Algorithms + Data Structures = Programs, Prentice-Hall, 1976.

Go to the first, previous, next, last section, table of contents.