Vítor Santos Costa
- 1.R. Bahgat. Solving Resource Allocation Problems in Pandora. Technical Report, Imperial College, Department of Computing, 1990.Google Scholar
- 2.R. Bahgat and S. Gregory. Pandora: nondeterministic parallel logic programming. In Proceedings of the Sixth International Conference on Logic Programming, pages 471-486, The MIT Press, June 1989.Google Scholar
- 3.Anthony Beaumont, S. Muthu Raman, and P6ter Szeredi. Scheduling Or-Parallelism in Aurora with the Bristol Scheduler. Technical Report TR- 90-04, University of Bristol, Computer Science Department, March 1990.Google Scholar
- 4.J. Crammond. Implementation of Committed Choice Logic Languages on Shared Memory Multiprocessors. PhD thesis, Dept of Computing, Imperial College, May 1988. Google ScholarDigital Library
- 5.Richard P. Gabriel. Performance and evaluation of Lisp systems. The MIT Press, 1985. Google ScholarDigital Library
- 6.S. Haridi and S. Jansson. Kemel Andorra Prolog and its computational model. In David H. D. Warren and P. Szeredi, editors, Logic Programming: Proceedings of the Seventh International Conference, pages 31-46, MIT Press, 1990. Google ScholarDigital Library
- 7.Seif Haridi and Per Brand. Andorra Prologan integration of Prolog and committed choice languages. In International Conference on Fifth Generation Computer Systems 1988, ICOT, 1988.Google Scholar
- 8.Douglas R. Hofstadter. Godel, Escher, Bach: an eternal golden braid. Harmondsworth: Penguin, 1980. Google ScholarDigital Library
- 9.L.V. Kal6, B. Ramkumar, and W. Shu. A memory organization independent binding environment for AND and OR parallel execution of logic programs. In The 5th International Conference#Symposium on Logic Programming, pages 1223-1240, 1988.Google Scholar
- 10.S. Kliger and E. Shapiro. A decision tree compilation algorithm for FCP(I,:,?). In Proceedings of the 1988 Symposium on Logic Programming, pages 1315-1336, 1988.Google Scholar
- 11.Ewing Lusk, David H. D. Warren, Seif Haridi, et al. The Aurora or-parallel Prolog system. New Generation Computing, 7(2,3):243-271, 1990. Google ScholarDigital Library
- 12.Michael Ratcliffe. A progress report on PEPSys. July 1988. Presentation at the Gigalips Workshop, Manchester.Google Scholar
- 13.V. Santos Costa. Compile-time analysis for Andorra-I. October 1990. PEPMA Project workshop, University of Bristol.Google Scholar
- 14.Vitor Santos Costa and Rong Yang. Andorra4 User's Guide and reference manual. Technical Report, University of Bristol, Computer Science Department, Sept 1990. Internal Report, Gigalips Project.Google Scholar
- 15.Raed Sindaha. Scheduling speculative work in the Aurora or-parallel Prolog system. March 1990. Intemal Report, Gigalips Project.Google Scholar
- 16.Leon Sterling and Ehud Shapiro. The Art of Prolog. The MIT Press, 1986.Google Scholar
- 17.Prter Szeredi and Mats Cadsson. The Engine- Scheduler Interface in the Aurora Or-Parallel Prolog System. Technical Report TR-90-09, University of Bristol, Computer Science Department, April 1990.Google Scholar
- 18.Pascal van Hentenryck. Constraint Satisfation in Logic programming. The MIT Press, 1989. Google ScholarDigital Library
- 19.P. Van Roy, B. Demoen, and Y. D. Willems. Improving the execution speed of compiled Prolog with modes, clause selection and determinism. In TAPSOFT'87, pages 111-125, Springer Verlag, 1987. Google ScholarDigital Library
- 20.David H. D. Warren. An Abstract Prolog Instruction Set. Technical Note 309, SRI Intemational, 1983.Google Scholar
- 21.David H. D. Warren. Extended Andorra model. October 1989. PEPMA Project workshop, University of Bristol.Google Scholar
- 22.David H. D. Warren. The SRI model for orparallel execution of Prolog#abstract design and implementation issues. In Proceedings of the 1987 Symposium on Logic Programming, pages 92- 102, 1987.Google Scholar
- 23.David H. D. Warren. WARPLAN: a System for Generating Plans. DCL Memo 76, University of Edinburgh, June 1974.Google Scholar
- 24.Rong Yang. Solving simple substitution ciphers in Andorra-l. In Proceedings of the Sixth International Conference on Logic Programming, pages 113-128, The MIT Press, June 1989.Google Scholar
- 25.Rong Yang and V. Santos Costa. Andorra-I: A System integrating Or-parallelism with Dependent And-parallelism. Technical Report TR- 90-03, University of Bristol, Computer Science Department, March 1990.Google Scholar
Index Terms
- Andorra I: a parallel Prolog system that transparently exploits both And-and or-parallelism
Comments