Independence in CLP languages

ACM Transactions on Programming Languages and Systems

Volumn 22, Issue 2, 2000, Pages 296-339

  De La Banda, María García ^b   Hermenegildo, Manuel ^a   Marriott, Kim ^b  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b MONASH UNIVERSITY   (Australia)

Author keywords

D.1.2 Programming Techniques : Automatic Programming automatic analysis of algorithms; D.1.3 Programming Techniques : Parallel Programming; D.1.6 Programming Techniques : Logic Programming; F.3.1; Program transformation

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS; SEMANTICS;

HERBRAND DOMAINS; INTELLIGENT BACKTRACKING;

LOGIC PROGRAMMING;

EID: 0040291313     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/349214.349224     Document Type: Article

References (41)

1. APT, K. 1990. Introduction to Logic Programming. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B: Formal Model and Semantics. Elsevier, Amsterdam and The MIT Press, Cambridge, 495-574.
2. APT, K. AND VAN EMDEN, M. 1982. Contributions to the theory of logic programming. J. ACM 29, 3 (July), 841-863.
3. BACON, D., GRAHAM, S., AND SHARP, O. 1994. Compiler Transformations for High-Performance Computing. Computing Surveys 26, 4 (December), 345-420.
4. BEST, E. AND LENGAUER, C. 1990. Semantic Independence. Science of Computer Programming 13, 23-50.
5. BRUYNOOGHE, M. AND PEREIRA, L. 1984. Deduction Revision by Intelligent Backtracking. In Implementations of Prolog, J. Campbell, Ed. Elliss Horwood, 194-205.
6. BUENO, F., GRACÍA DE LA BANDA, M., HERMENEGILDO, M., AND MUTHUKUMAR, K. 1999. Automatic Compile-time Parallelization of Logic Programs for Restricted, Goal-level, Independent And-parallelism. J. Logic Program. 38, 2 (February), 165-218.
7. BUENO, F., HERMENEGILDO M., MONTANARI, U., AND ROSSI, F. 1998. Partial Order and Contextual Net Semantics for Atomic and Locally Atomic CC Programs. Science of Computer Programming 30, 51-82. Special CCP95 Workshop issue.
8. CABEZA, D. AND HERMENEGILDO, M. 1994. Extracting Non-strict Independent And-parallelism Using Sharing and Freeness Information. In 1994 International Static Analysis Symposium. Number 864 in LNCS. Springer-Verlag, Namur, Belgium, 297-313.
9. CHASSIN, J. AND CODOGNET, P. 1994. Parallel Logic Programming Systems. Computing Surveys 26, 3 (September), 295-336.
10. COLMERAUER, A. 1990. An Introduction to Prolog III. Commun. ACM 28, 4, 412-418.
11. CONERY, J. S. 1983. The and/or process model for parallel interpretation of logic programs. Ph.D. thesis, The University of California At Irvine. Tech. Rep. 204.
12. CONERY, J. S. 1987. Binding Environments for Parallel Logic Programs in Nonshared Memory Multiprocessors. In Symposium on Logic Programming 457-467.
13. DEBRAY, S. K. 1993. QD-Janus : A Sequential Implementation of Janus in Prolog. Software -Practice and Experience 23, 12 (December), 1337-1360.
14. DEGROOT, D. 1984. Restricted AND-Parallelism. In International Conference on 5th Generation Computer Systems. Tokyo, 471-478.
15. FRANZEN, T. 1992. Logical Aspects of the Andorra Kernel Language. Draft/Personal communication.
16. GARCÍA DE LA BANDA M., BUENO, F., AND HERMENEGILDO, M. 1996. Towards Independent And-Parallelism in CLP. In Programming Languages: Implementation, Logics, and Programs. Number 1140 in LNCS. Springer-Verlag, Aachen, Germany, 77-91.
17. HARIDI, S. AND JANSON, S. 1990. Kernel Andorra Prolog and its Computation Model. In Proceedings of the 7th International Conference on Logic Programming. MIT Press, 31-46.
18. HERMENEGILDO, M. 1997. Automatic Parallelization of Irregular and Pointer-Based Computations: Perspectives from Logic and Constraint Programming. In Proceedings of EUROPAR'97. LNCS, vol. 1300. Springer-Verlag, 31-46. (invited).
19. HERMENEGILDO, M. AND GREENE, K. 1990. &-Prolog and its Performance: Exploiting Independent And-Parallelism. In 1990 International Conference on Logic Programming. MIT Press, 253-268.
20. HERMENEGILDO, M. AND ROSSI, F. 1995. Strict and Non-Strict Independent And-Parallelism in Logic Programs. Correctness, Efficiency, and Compile-Time Conditions. J. Logic Program. 22, 1, 1-45.
21. JAFFAR, J. AND LASSEZ, J.-L. 1987. Constraint Logic Programming. In ACM Symp. Principles of Programming Languages. ACM, 111-119.
22. JAFFAR, J. AND MAHER, M. 1994. Constraint Logic Programming: A Survey. J. Logic Program. 19/20, 503-581.
23. JAFFAR, J. AND MICHAYLOV, S. 1987. Methodology and Implementation of a CLP System. In 4th International Conference on Logic Programming. University of Melbourne, MIT Press, 196-219.
24. JANSON, S. AND HARIDI, S. 1991. Programming Paradigms of the Andorra Kernel Language. In 1991 International Logic Programming Symposium. MIT Press, 167-183.
25. KALÉ, L. V. 1987. Completeness and Full Parallelism of Parallel Logic Programming Schemes. In 4th IEEE Symposium on Logic Programming. IEEE, 125-133.
26. KELLY, A., MACDONALD A., MARRIOTT, K., STUCKEY, P., AND YAP, R. 1996. Effectiveness of optimizing compilation for CLP(R). In Proceedings of Joint International Conference and Symposium on Logic Programming. MIT Press, 37-51.
27. LIN, Y.-J. 1988. A Parallel Implementation of Logic Programs. Ph.D. thesis, Dept. of Computer Science, University of Texas at Austin, Austin, Texas 78712.
28. LLOYD, J. W. 1987. Logic Programming. Springer-Verlag.
29. MARRIOT, K. AND STUCKEY, P. 1998. Programming with Constraints: An Introduction. The MIT Press.
30. MARRIOT, K. AND STUCKEY, P. 1992. The 3 R's of Optimizing Constraint Logic Programs: Refinement, Removal, and Reordering. In 19th Annual ACM Conf. on Principles of Programming Languages. ACM, 334-344.
31. MARRIOTT, K. AND STUCKEY, P. 1994. Approximating Interaction Between Linear Arithmetic Constraints. In 1994 International Symposium on Logic Programming. MIT Press, 571-585.
32. MARTELLI, A. AND MONTANARI, U. 1982. An Efficient Unification Algorithm. ACM Transactions on Programming Languages and Systems 4, 3, 258-282.
33. PATERSON, M. S. AND WEGMAN, M. 1978. Linear Unification. J. of Computer and System Sciences 16, 2, 158-167.
34. PEREIRA, L. M. AND PORTO, A. 1982. Selective backtracking. In Logic Programming. Academic Press, 107-114.
35. PUEBLA G., GARCÍA DE LA BANDA, M., MARRIOTT, K., AND STUCKEY, P. 1997. Optimization of Logic Programs with Dynamic Scheduling. In 1997 International Conference on Logic Programming. MIT Press, Cambridge, MA, 93-107.
36. ROBINSON, J. A. 1965. A Machine Oriented Logic Based on the Resolution Principle. J. ACM 12, 23 (January), 23-41.
37. SARASWAT, V. 1987. Compiling CP() on top of Prolog. Tech. Rep. CMU-CS-87-174, Computer Science Department, Carnegie-Mellon University, Pittsburgh. October.
38. UEDA, K. AND CHIKIYAMA, T. (1985). A compiler for concurrent prolog. In 2nd International Symposium on Logic Programming. IEEE Press, Boston, 119-126.
39. WARREN, D. AND PEREIRA, F. C. N. 1982. An Efficient, Easily Adaptable System For Interpreting Natural Language Queries. American Journal of Computational Linguistics 8, 3-4, 110-122.
40. WARREN, R., HERMENEGILDO, M., AND DEBRAY, S. K. 1988. On the Practicality of Global Flow Analysis of Logic Programs. In 5th International Conference and Symposium on Logic Programming. MIT Press, 684-699.
41. WINSBOROUGH, W. AND WAERN, A. 1988. Transparent And-Parallelism in the Presence of Shared Free variables. In 5th International Conference and Symposium on Logic Programming. Seattle, Washington, 749-764.