TopVida de VariáveisReferences

References

 [1]
Abderrahamane Aggoun, David Chan, Pierre Dufresne, Eamon Falvey, Hugh Grant, Alexander Herold, Geoffrey Macartney, Micha Meier, David Miller, Shyam Mudambi, Bruno Perez, Emmanuel van Rossum, Joachim Schimpf, Periklis Andreas Tsahageas, and Dominique Henry de Villeneuve. ECLiPSe 3.5 User Manual. ECRC, December 1995.
 [2]
Hassan Aït-Kaci. Warren's Abstract Machine -- A Tutorial Reconstruction. MIT Press, 1991.
 [3]
Khayri A. M. Ali and Roland Karlsson. Full Prolog and scheduling OR-Parallelism in Muse. International Journal of Parallel Programming, 19(6):445-475, December 1990.
 [4]
Khayri A. M. Ali and Roland Karlsson. The Muse approach to OR-Parallel Prolog. International Journal of Parallel Programming, 19(2):129-162 (or 129-160??), April 1990.
 [5]
Khayri A. M. Ali and Roland Karlsson. OR-Parallel Speedups in a Knowledge Based System: on Muse and Aurora. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 739-745, ICOT, Japan, 1992. Association for Computing Machinery.
 [6]
Khayri A. M. Ali and Roland Karlsson. Scheduling speculative work in MUSE and performance results. International Journal of Parallel Programming, 21(6):449-476, December 1992.
 [7]
Johan Andersson, Stefan Andersson, Kent Boortz, Mats Carlsson, Hans Nilsson, Thomas Sjoland, and Johan Widén. SICStus Prolog User's Manual. Technical report, Swedish Institute of Computer Science, November 1997. SICS Technical Report T93-01.
 [8]
Karen Appleby, Mats Carlsson, Seif Haridi, and Dan Sahlin. Garbage collection for Prolog based on WAM. Communications of the ACM, 31(6):171-183, 1989.
 [9]
Reem Bahgat and Steve Gregory. Pandora: Non-deterministic Parallel Logic Programming. In Proceedings of the Sixth International Conference on Logic Programming, pages 471-486. MIT Press, June 1989.
 [10]
Anthony Beaumont, S Muthu Raman, Péter Szeredi, and David H. D. Warren. Flexible Scheduling of OR-Parallelism in Aurora: The Bristol Scheduler. In PARLE91: Conference on Parallel Architectures and Languages Europe, volume 2, pages 403-420. Springer Verlag, June 1991.
 [11]
Anthony Beaumont and David H. D. Warren. Scheduling speculative work in or-parallel Prolog systems. In ICLP93, pages 135-149, 1993.
 [12]
Joachim Beer. Concepts, Design, and Performance Analysis of a Parallel Prolog Machine. Number 404 in Lecture Notes in Computer Science. Springer Verlag, 1989.
 [13]
James R. Bell. Threaded code. Communications of the ACM, 16(6):370-372, 1973.
 [14]
Johan Bevemyr and Thomas Lindgren. A simple and efficient copying garbage collector for Prolog. Lecture Notes in Computer Science, 844:88-101, 1994.
 [15]
Johan Bevemyr, Thomas Lindgren, and Häkan Millroth. Reform Prolog: The Language and its Implementation. In Proceedings of the Tenth International Conference on Logic Programming, pages 283-298. MIT Press, June 1993.
 [16]
Patrice Boizumault. A General Model to Implement Dif and Freeze. In Ehud Shapiro, editor, Third International Conference on Logic Programming, London, pages 585-592. Springer-Verlag, 1986.
 [17]
Kenneth A. Bowen, Kevin A. Buettner, Ilyas Cicekli, and Andrew K. Turk. The Design of a High-Speed Incremental Portable Prolog Compiler. In Third International Conference on Logic Programming, number 225 in Lecture Notes in Computer Science, pages 650-656. Imperial College, Springer-Verlag, July 1986.
 [18]
Maurice Bruynooghe. A Practical Framework for the Abstract Interpretation of Logic Programs. The Journal of Logic Programming, 10(2), February 1991.
 [19]
Francisco Bueno, Maria García de la Banda, and Manuel V. Hermenegildo. Effectiveness of Abstract Interpretation in Automatic Parallelization: A Case Study in Logic Programming. ACM TOPLAS, 1998.
 [20]
Daniel Cabeza and Manuel V. Hermenegildo. The Ciao Modular, Standalone Compiler and Its Generic Program Processing Library. In Inês C. Dutra, Vìtor Santos Costa, Gopal Gupta, Enrico Pontelli, Manuel Carro, and Peter Kacsuk, editors, Parallelism and Implementation Technology for (Constraint) Logic Programming, volume 30, Issue 3 of Electronic Notes in Theoretical Computer Science. Elsevier North-Holland Inc, March 2000. http://www.elsevier.nl/gej-ng/31/29/23/show/Products/notes/contents.htt.
 [21]
Vanusa M. Calegario and Inês C. Dutra. Performance Evaluation of Or-Parallel Logic Programming Systems on Distributed Shared Memory Architectures. In Proceedings of the EUROPAR'99, Aug-Sep 1999.
 [22]
Mats Carlsson. Freeze, Indexing, and Other Implementation Issues in the Wam. In Jean-Louis Lassez, editor, Proceedings of the Fourth International Conference on Logic Programming, MIT Press Series in Logic Programming, pages 40-58. University of Melbourne, "MIT Press", May 1987.
 [23]
Mats Carlsson. On the efficiency of optimised shallow backtracking in Compiled Prolog. In Proceedings of the Sixth International Conference on Logic Programming, pages 3-15. MIT Press, June 1989.
 [24]
Mats Carlsson. Design and Implementation of an OR-Parallel Prolog Engine. SICS Dissertation Series 02, The Royal Institute of Technology, 1990.
 [25]
Mats Carlsson, Greger Ottosson, and Björn Carlson. An open-ended finite domain constraint solver. In H. Glaser, P. Hartel, and H. Kucken, editors, Programming Languages: Implementations, Logics, and Programming, volume 1292 of Lecture Notes in Computer Science, pages 191-206, Southampton, September 1997. Springer-Verlag.
 [26]
Jacques Chassin de Kergommeaux and Philippe Codognet. Parallel Logic Programming Systems. Computing Surveys, 26(3):295-336, September 1994.
 [27]
Jacques Chassin de Kergommeaux and Philippe Robert. An Abstract Machine to Implement Or-And Parallel Prolog Efficiently. The Journal of Logic Programming, 8(3), May 1990.
 [28]
Takashi Chikayama, Tetsuro Fujise, and Daigo Sekit. A Portable and Efficient Implementation of KL1. In 6th International Symposium PLILP, pages 25-39, 1994.
 [29]
Takashi Chikayama and Y. Kimura. Multiple Reference Management in Flat GHC. In Jean-Louis Lassez, editor, Proceedings of the Fourth International Conference on Logic Programming, MIT Press Series in Logic Programming, pages 276-293. University of Melbourne, "MIT Press", May 1987.
 [30]
Keith L. Clark and Steve Gregory. A Relational Language for Parallel Programming. In Arvind, editor, ACM Conference on Functional Programming Languages and Computer Architecture, pages 171-178. Acm, October 1981.
 [31]
William F. Clocksin and H. Alshawi. A Method for Efficiently Executing Horn Clause Programs Using Multiple Processors. New Generation Computing, 5(4):361-376, 1988.
 [32]
Christian Codognet and Philippe Codognet. Non-deterministic Stream And-Parallelism Based on Intelligent Backtracking. In Giorgio Levi and Maurizio Martelli, editors, Logic Programming: Proceedings of the Sixth International Conference, pages 63-79. The MIT Press, 1989.
 [33]
Philippe Codognet and Daniel Diaz. wamcc: Compiling Prolog to C. In 12th International Conference on Logic Programming. The MIT Press, 1995.
 [34]
Philippe Codognet and Daniel Diaz. Compiling constraints in clp(fd). The Journal of Logic Programming, 27(3):185-226, June 1996.
 [35]
Alain Colmerauer. Prolog II: Reference Manual and Theoretical Model. Groupe D'Intelligence Artificielle, Faculte Des Sciences De Luminy, Marseilles, October 1982.
 [36]
Alain Colmerauer. An Introduction to Prolog-III. Communications of the ACM, 33(7):69-90, July 1990.
 [37]
Alain Colmerauer. The Birth of Prolog. In The Second ACM-SIGPLAN History of Programming Languages Conference, pages 37-52. ACM, March 1993.
 [38]
John S. Conery. Parallel Execution of Logic Programs. Kluwer Academic Publishers, Norwell, Ma 02061, 1987.
 [39]
Thomas Conway, Fergus Henderson, and Zoltan Somogyi. Code generation for Mercury. In John Lloyd, editor, Proceedings of the International Symposium on Logic Programming, pages 242-256, Cambridge, December 4-7 1995. MIT Press.
 [40]
Manuel Eduardo Correia and Vítor Santos Costa. IAP for Dummies: The YAP Design. In Inês C. Dutra, Vìtor Santos Costa, Gopal Gupta, Enrico Pontelli, Manuel Carro, and Peter Kacsuk, editors, Parallelism and Implementation Technology for (Constraint) Logic Programming, volume 30, Issue 3 of Electronic Notes in Theoretical Computer Science. Elsevier North-Holland Inc, March 2000. http://www.elsevier.nl/gej-ng/31/29/23/show/Products/notes/contents.htt.
 [41]
Manuel Eduardo Correia, Fernando Silva, and Vítor Santos Costa. The SBA: Exploiting orthogonality in OR-AND Parallel Systems. In Proceedings of the 1997 International Logic Programming Symposium, pages 117-131. MIT Press, October 1997. Also published as Technical Report DCC-97-3, DCC - FC & LIACC, Universidade do Porto, April, 1997.
 [42]
Patrick Cousot and Radhia Cousot. Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Conference Record of the 4th ACM Symposium on Principles of Programming Languages, pages 238-252, 1977.
 [43]
Patrick Cousot and Radhia Cousot. Abstract interpretation and application to logic programs. The Journal of Logic Programming, 13(1, 2, 3 and 4):103-179, 1992.
 [44]
James A. Crammond. A Garbage Collection Algorithm for Shared Memory Parallel Processors. International Journal of Parallel Processing, 17(6), December 1988.
 [45]
James A. Crammond. The abstract machine and implementation of parallel parlog. New Generation Computing, 10(4):385-422, 1992.
 [46]
Steve Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, Konstantinos F. Sagonas, S. Skiena, Terrance Swift, and David S. Warren. Unification factoring for efficient execution of logic programs. In ACM, editor, Conference record of POPL '95, 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages: papers presented at the Symposium: San Francisco, California, January 22-25, 1995, pages 247-258, New York, NY, USA, 1995. ACM Press.
 [47]
Koen de Bosschere, Saumya K. Debray, David Gudeman, and S. Kannan. Call Forwarding: An Interprocedural Optimization Technique for Dynamically Typed Languages. In Proceedings of the SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 1994.
 [48]
Maria García de la Banda, Manuel V. Hermenegildo, and Kim Marriott. Independence in dynamically scheduled logic languages. In Michael Hanus and Mario Rodríguez-Artalejo, editors, Algebraic and Logic Programming, 5th International Conference, ALP'96, volume 1139 of lncs, pages 47-61, Aachen, Germany, 25-27 September 1996. Springer.
 [49]
Saumya K. Debray. Register allocation in a Prolog machine. In Symposium on Logic Programming, pages 267-275. IEEE Computer Society, The Computer Society Press, September 1986.
 [50]
Saumya K. Debray. A Simple Code Improvement Scheme for Prolog. In Sixth International Conference on Logic Programming, pages 17-32. MIT Press, June 1989.
 [51]
Doug DeGroot. Restricted and-parallelism. In Hideo Aiso, editor, International Conference on Fifth Generation Computer Systems 1984, pages 471-478. Institute for New Generation Computing, Tokyo, 1984.
 [52]
Bart Demoen, Maria García de la Banda, Warwick Harvey, Kim Marriott, and Peter J. Stuckey. Herbrand Constraint Solving in HAL. In Proceedings of ICLP99, pages 260-274. MIT Press, 1999.
 [53]
Bart Demoen, Geert Engels, and Paul Tarau. Segment Preserving Copying Garbage Collection for WAM based Prolog. In Proceedings of the 1996 ACM Symposium on Applied Computing, pages 380-386, Philadelphia, February 1996. ACM Press.
 [54]
Bart Demoen, Gerda Janssens, and Henk Vandecasteele. Compiling large disjunctions. In Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, London, July 2000.
 [55]
Bart Demoen and Konstantinos F. Sagonas. CAT: the Copying Approach to Tabling. In Proceedings of PLILP/ALP98. Springer Verlag, September 1998.
 [56]
Bart Demoen and Konstantinos F. Sagonas. CHAT: The copy-hybrid approach to tabling. Lecture Notes in Computer Science, 1551:106-121, 1999.
 [57]
Bart Demoen and Konstantinos F. Sagonas. Heap Garbage Collection in XSB: Practice and Experience. In Enrico Pontelli and Vítor Santos Costa, editors, Practical Aspects of Declarative Languages, number 1753 in Lecture Notes in Computer Science, pages 93-108. Springer Verlag, January 2000.
 [58]
Mehmet Dincbas, Pascal Van Hentenryck, Helmut Simonis, Abderrahmane Aggoun, T. Graf, and F. Berthier. The Constraint Logic Programming Language CHIP. In International Conference on Fifth Generation Computer Systems 1988, pages 693-702. ICOT, Tokyo, Japan, November 1988.
 [59]
Inês C. Dutra. Strategies for Scheduling And- and Or-Work in Parallel Logic Programming Systems. In Logic Programming: Proceedings of the 1994 International Symposium, pages 289-304. MIT Press, 1994.
 [60]
Inês C. Dutra, Vítor Santos Costa, and Ricardo Bianchini. The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems. In Proceedings of CL'2000, LNAI 1861, pages 1285-1299, July 2000.
 [61]
D. Eadline. Implementing Prolog on Distributed Systems: n-parallel Prolog. In Proceedings of the Post-ILPS'94 Workshop on Design and Implementation of Parallel Logic Programming Systems, Ithaca, NY, USA,, 1994.
 [62]
Michel Ferreira and Luís Damas. Multiple specialization of WAM code. Lecture Notes in Computer Science, 1551:243-258, 1999.
 [63]
Thom Frühwirth. Theory and Practice of Constraint Handling Rules. The Journal of Logic Programming, 37(1-3), October 1998.
 [64]
Kazuhiro Fuchi, Robert Kowalski, Koichi Furukawa, Kazunori Ueda, Ken Kahn, Takashi Chikayama, and Evan Tick. The fifth generation project: Launching the new era. CACM, 36(3):49-99, March 1993.
 [65]
Steve Gregory and Rong Yang. Parallel Constraint Solving in Andorra-I. In International Conference on Fifth Generation Computer Systems 1992, pages 843-850. ICOT, Tokyo, Japan, June 1992.
 [66]
David Gudeman, Koen de Bosschere, and Saumya K. Debray. jc: An Efficient and Portable Sequential Implementation of Janus. In Proceedings of the 1992 Joint International Conference and Symposium on Logic Programming, 1992.
 [67]
Hai-Feng Guo and Gopal Gupta. A New Tabling Scheme with Dynamic Reordering of Alternatives. In Workshop on Parallelism and Implementation Technology for (Constraint) Logic Languages, July 2000. to appear.
 [68]
Gopal Gupta, Khayri A. M. Ali, Mats Carlsson, and Manuel V. Hermenegildo. Parallel Logic Programming: A Survey. Research Report, ftp://pub.cs.nmsu.edu/pub/papers/lp/survey.ps.Z, 1997.
 [69]
Gopal Gupta, Manuel V. Hermenegildo, Enrico Pontelli, and Vítor Santos Costa. ACE: And/Or-parallel Copying-based Execution of Logic Programs. In Proc. ICLP'94, pages 93-109. MIT Press, 1994.
 [70]
Gopal Gupta, Manuel V. Hermenegildo, and Vítor Santos Costa. And-Or Parallel Prolog: A Recomputation based Approach. New Generation Computing, 11(3,4):770-782, 1993.
 [71]
Gopal Gupta and Bharat Jayaraman. Compiled And-Or Parallelism on Shared Memory Multiprocessors. In Proceedings of the North American Conference on Logic Programming, pages 332-349. MIT Press, October 1989.
 [72]
Gopal Gupta and Bharat Jayaraman. Analysis of or-parallel execution models. ACM TOPLAS, 15(4):659-680, 1993.
 [73]
Gopal Gupta and Enrico Pontelli. Stack-splitting: Or-/And-parallelism on Distributed Memory Machines. In Proceedings of ICLP99, pages 290-304. MIT Press, 1999.
 [74]
Gopal Gupta and Vítor Santos Costa. Optimal implementation of and-or parallel Prolog. Future Generation Computer Systems, 14(10):71-92, 1994.
 [75]
Gopal Gupta and Vítor Santos Costa. Cuts and Side-Effects in And-Or Parallel Prolog. Journal of Logic Programming, 27(1):45-71, April 1996.
 [76]
Seif Haridi, Peter Van Roy, Per Brand, and Christian Schulte. Programming Languages for Distributed Applications. New Generation Computing, 16(3):223-261, 1998.
 [77]
Bogumil Hausman, Andrzej Ciepielewski, and Alan Calderwood. Cut and Side-Effects in Or-Parallel Prolog. In International Conference on Fifth Generation Computer Systems 1988, pages 831-840. ICOT, 1988.
 [78]
Ralph C. Haygood. Native code compilation in SICStus Prolog. In Pascal Van Hentenryck, editor, Proceedings of the Eleventh International Conference on Logic Programming. MIT Press, June 1994.
 [79]
Manuel V. Hermenegildo. An Abstract Machine for Restricted And-Parallel Execution of Logic Programs. In Ehud Shapiro, editor, Third International Conference on Logic Programming, London, pages 25-39. Springer-Verlag, July 1986.
 [80]
Manuel V. Hermenegildo and Manuel Carro. Relating Data-Parallelism and And-Parallelism in Logic Programs. In Proceedings of EURO-PAR'95, Swedish Institute of Computer Science (SICS), August 1995.
 [81]
Manuel V. Hermenegildo and Kevin Greene. &-Prolog and its Performance: Exploiting Independent And-Parallelism. New Generation Computing, 9(3,4):233-257, 1991.
 [82]
Manuel V. Hermenegildo and Roger I. Nasr. Efficient Management of Backtracking in AND-parallelism. In Third International Conference on Logic Programming, number 225 in Lecture Notes in Computer Science, pages 40-54. Imperial College, Springer-Verlag, July 1986.
 [83]
Manuel V. Hermenegildo and Francesca Rossi. Non-Strict Independent And-Parallelism. In Proceedings of the Seventh International Conference on Logic Programming, pages 237-252. MIT Press, June 1990.
 [84]
Timothy Hickey and Shyam Mudambi. Global compilation of Prolog. The Journal of Logic Programming, pages 193-230, November 1989.
 [85]
Christian Holzbaur. Metastructures vs. Attributed Variables in the Context of Extensible Unification. In Programming Language Implementation and Logic Programming, LNCS 631, pages 260-268. Springer Verlag, 1992.
 [86]
Zhiyi Huang, Chengzheng Sun, Abdul Sattar, and Wan-Ju Lei. Parallel Logic Programming on Distributed Shared Memory System. In Proceedings of the IEEE International Conference on Intelligent Processing Systems, October 1997.
 [87]
Noriyoshi Ito, Masatoshi Sato, Eiji Kuno, and Kazuaki Rokusawa. The Architecture and Preliminary Evaluation Results of the Experimental Parallel Inference Machine PIM-D. In The 13th Annual International Symposium on Computer Architecture, pages 149-156, Tokyo, Japan, 1986. IEEE.
 [88]
Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Proceedings Fourtheenth Annual ACM Symposium on Principles of Programming Languages, pages 111-119. "ACM", 1987.
 [89]
Joxan Jaffar, Spiro Michaylov, Peter J. Stuckey, and Roland H.C. Yap. An Abstract Machine for CLP(R). In Proceedings of the ACM SIGPlAN'92 Conference on Programming Language Design and Implementation, pages 128-139, June 1992.
 [90]
Gerda Janssens and Maurice Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. The Journal of Logic Programming, 13(1, 2, 3 and 4):205-258, 1992.
 [91]
Gerda Janssens, Bart Demoen, and André Mariën. Improving the register allocation of WAM by recording unification. In ICLP88, pages 1388-1402, 1988.
 [92]
Péter Kacsuk and Michael J. Wise, editors. Implementations of Distributed Prolog. Wiley, Series in Parallel Computing, 1992.
 [93]
Laxmikant V. Kalé. The REDUCE OR process model for parallel execution of logic programming. The Journal of Logic Programming, 11(1), July 1991.
 [94]
Shmuel Kliger and Ehud Shapiro. A Decision Tree Compilation Algorithm for FCP(|,:,?). In Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1315-1336. MIT Press, August 1988.
 [95]
Shmuel Kliger and Ehud Shapiro. From Decision Trees to Decision Graphs. In Proceedings of the North American Conference on Logic Programming, pages 97-116. MIT Press, October 1990.
 [96]
Feliks Kluzniak. Developing applications for Aurora. Technical Report TR-90-17, University of Bristol, Computer Science Department, August 1990.
 [97]
Péter Koves and Péter Szeredi. Collection of Papers on Logic Programming, chapter Getting the Most Out of Structure-Sharing. SZKI, November 1993.
 [98]
Robert A. Kowalski. Logic for Problem Solving. Elsevier North-Holland Inc., 1979.
 [99]
Baudoin Le Charlier and Pascal Van Hentenryck. Experimental evaluation of a generic abstract interpretation algorithm for PROLOG. ACM TOPLAS, 16(1):35-101, January 1994.
 [100]
Xining Li. A new term representation method for Prolog. Journal of Logic Programming, 34(1):43-57, January 1998.
 [101]
Yow-Jian Lin and Vipin Kumar. AND-parallel execution of logic programs on a shared-memory multiprocessor. The Journal of Logic Programming, 10(1,2,3 and 4):155-178, 1991.
 [102]
Thomas Lindgren. Polyvariant detection of uninitialized arguments of prolog predicates. The Journal of Logic Programming, 28(3), September 1997.
 [103]
Ricardo Lopes and Vítor Santos Costa. Parallelism and Implementation of Logic and Constraint Logic Programming, chapter The YAIL: An Intermediate Language for Native Compilation of Prolog Programs, pages 313-328. Nova Science, Inc., 1999.
 [104]
Pedro López-García, Manuel V. Hermenegildo, and Saumya K. Debray. A Methodology for Granularity Based Control of Parallelism in Logic Programs. Journal of Symbolic Computing, Special Issue on Parallel Symbolic Computation, 11(3-4):217-242, 1996.
 [105]
Ewing Lusk, Ralph Butler, Terrence Disz, Robert Olson, Ross A. Overbeek, Rick Stevens, David H. D. Warren, Alan Calderwood, Péter Szeredi, Seif Haridi, Per Brand, Mats Carlsson, Andrzej Ciepielewski, and Bogumil Hausman. The Aurora or-parallel Prolog system. New Generation Computing, 7(2,3):243-271, 1990.
 [106]
Ewing Lusk, Shyam Mudambi, Ross A. Overbeek, and Péter Szeredi. Applications of the Aurora parallel Prolog system to computational molecular biology. In Logic Programming - Proceedings of the 1993 International Symposium, pages 353-369, 1993.
 [107]
Henning Makholm. A region-based memory manager for Prolog. In CL2000 First Workshop on Memory Management in Logic Programs, Technical Report of Dept. Comp. Science, K.U.Leuven, July 2000.
 [108]
André Mariën and Bart Demoen. On the Management of Choicepoint and Environment Frames in the WAM. In Ewing L. Lusk and Ross A. Overbeek, editors, Proceedings of the North American Conference on Logic Programming, pages 1030-1050, Cleveland, Ohio, USA, 1989.
 [109]
André Mariën and Bart Demoen. A new scheme for unification in WAM. In Vijay A. Saraswat and Kazunori Ueda, editors, Logic Programming, Proceedings of the 1991 International Symposium, pages 257-271, San Diego, USA, 1991. The MIT Press.
 [110]
Ludek Matyska, Adriana Jergová, and David Toman. Register allocation in WAM. In Koichi Furukawa, editor, Proceedings of the Eighth International Conference on Logic Programming, pages 142-156, Paris, France, 1991. The MIT Press.
 [111]
Micha Meier. Compilation of compound terms in prolog. In Saumya K. Debray and Manuel V. Hermenegildo, editor, Proceedings of the 1990 North American Conference on Logic Programming, pages 63-79, Austin, TX, October 1990. MIT Press.
 [112]
Christopher S. Mellish. Abstract interpretation of PROLOG programs. In Abstract Interpretation of Declarative Languages, chapter 8, pages 181-198. Ellis-Horwood, September 1987.
 [113]
Johan Montelius and Khayri A. M. Ali. An And/Or-Parallel Implementation of AKL. New Generation Computing, 14(1), 1996.
 [114]
Remco Moolenaar and Bart Demoen. A parallel implementation for AKL. In Proceedings of the Programming Language Implementation and Logic Programming: PLILP '93, Tallin, Estonia, pages 246-261, 1993.
 [115]
Remco Moolenaar and Bart Demoen. Hybrid tree search in the Andorra Model. In Pascal Van Hentenryck, editor, Proceedings of the Eleventh International Conference on Logic Programming, pages 110-123. MIT Press, June 1994.
 [116]
Anne Mulkers, William Winsborough, and Maurice Bruynooghe. Live-structure dataflow analysis for Prolog. ACM TOPLAS, 16(2):205-258, March 1994.
 [117]
Kalyasundaran Muthukumar and Manuel V. Hermenegildo. Efficient Methods for Supporting Side Effects in Independent And-parallelism and Their Backtracking Semantics. In Proceedings of the Sixth International Conference on Logic Programming, pages 80-97. MIT Press, June 1989.
 [118]
Kalyasundaran Muthukumar and Manuel V. Hermenegildo. The CDG, UDG, and MEL Methods for Automatic Compile-time Parallelization of Logic Programs for Independent And-parallelism. In Proceedings of the Seventh International Conference on Logic Programming, pages 221-237. MIT Press, June 1990.
 [119]
Kalyasundaran Muthukumar and Manuel V. Hermenegildo. Compile-time derivation of variable dependency using abstract interpretation. The Journal of Logic Programming, 13(1, 2, 3 and 4):315-347, 1992.
 [120]
Lee Naish. Negation and Control in Prolog. Lecture notes in Computer Science 238. Springer-Verlag, 1985.
 [121]
Lee Naish. Parallelizing NU-Prolog. In Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1546-1564. MIT Press, August 1988.
 [122]
Ian William Olthof. An Optimistic AND-Parallel Prolog Implementation. Master's thesis, Department of Computer Science, University of Calgary, 1991.
 [123]
Luís Moniz Pereira and António Porto. Intelligent Backtracking and Sidetracking in Horn Clause Programs - the Theory. Report 2/79, Departamento de Informatica, Universidade Nova de Lisboa, October 1979.
 [124]
Enrico Pontelli and Gopal Gupta. Data and-parallel logic programming in &ace. In 7th IEEE Symposium on Parallel and Distributed Processing. IEEE Computer Society, 1995.
 [125]
Enrico Pontelli and Gopal Gupta. Dependent and Extended Dynamic Dependent And-parallelism in ACE. Journal of Functional and Logic Programming, 1999(Special Issue 1), April 1999.
 [126]
Enrico Pontelli, Gopal Gupta, and Manuel V. Hermenegildo. &ACE: A High-Performance Parallel Prolog System. In International Parallel Processing Symposium. IEEE Computer Society, 1995.
 [127]
Enrico Pontelli, Gopal Gupta, Manuel V. Hermenegildo, Manuel Carro, and DongXing Tang. Efficient Implementation of And-Parallel Logic Programming Systems. Computer Languages, 22(2/3), 1996.
 [128]
Enrico Pontelli, Gopal Gupta, DongXing Tang, Manuel Carro, and Manuel V. Hermenegildo. Improving the Efficiency of Nondeterministic And-Parallel Systems. Journal of Computer Languages, 22(2/3), 1996.
 [129]
Enrico Pontelli, Gopal Gupta, Janyce Wiebe, and David Farwell. Natural language multiprocessing: A case study. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and of the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pages 76-82, Menlo Park, July 26-30 1998. AAAI Press.
 [130]
Quintus Prolog User's Guide and Reference Manual--Version 6, April 1986.
 [131]
Konstantinos F. Sagonas, Terrance Swift, David S. Warren, Juliana Freire, and P. Rao. The XSB programmer's manual. Technical report, State University of New York at Stony Brook, 1997. Available at http://www.cs.sunysb.edu/~sbprolog.
 [132]
Dan Sahlin and Mats Carlsson. Variable shunting for the WAM. Technical Report R91-07, Swedish Institute of Computer Science, April 1, 1991.
 [133]
Vítor Santos Costa. Implementação de Prolog. Provas de aptidão pedagógica e capacidade científica, Universidade do Porto, Dezembro 1988.
 [134]
Vítor Santos Costa. Cowl: Copy-on-write for logic programs. In Proceedings of the IPPS/SPDP99, pages 720-727. IEEE Computer Press, May 1999.
 [135]
Vítor Santos Costa. Optimising bytecode emulation for prolog. In LNCS 1702, Proceedings of PPDP'99, pages 261-267. Springer-Verlag, September 1999.
 [136]
Vítor Santos Costa, David H. D. Warren, and Rong Yang. Andorra-I Compilation. New Generation Computing, 14(1):3-30, 1996.
 [137]
Vítor Santos Costa, Ricardo Bianchini, and Inês C. Dutra. Parallel Logic Programming Systems on Scalable Architectures. Journal of Parallel and Distributed Computing, 60(7):835-852, July 2000. http://www.idealibrary.com/links/toc/jpdc/60/7/0.
 [138]
Vítor Santos Costa, Ricardo Rocha, and Fernando Silva. Novel Models for Or-Parallel Logic Programs: A Performance Analysis. In Proceedings of EuroPar2000, LNCS 1900, pages 744-753, September 2000.
 [139]
Vítor Santos Costa, David H. D. Warren, and Rong Yang. Andorra-I: A Parallel Prolog System that Transparently Exploits both And- and Or-Parallelism. In Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming PPOPP, pages 83-93. ACM press, April 1991. SIGPLAN Notices vol 26(7), July 1991.
 [140]
Vítor Santos Costa, David H. D. Warren, and Rong Yang. The Andorra-I Engine: A parallel implementation of the Basic Andorra model. In Proceedings of the Eighth International Conference on Logic Programming, pages 825-839. MIT Press, June 1991.
 [141]
Vítor Santos Costa, David H. D. Warren, and Rong Yang. The Andorra-I Preprocessor: Supporting full Prolog on the Basic Andorra model. In Proceedings of the Eighth International Conference on Logic Programming, pages 443-456. MIT Press, June 1991.
 [142]
Vijay A. Saraswat. Partial Correctness Semantics for CP[downarrow,|,&,;]. In Proceedings of the Foundations of Software Technology and Theoretical Computer Science Conference, pages 347-368, December 1985.
 [143]
Joachim Schimpf. Garbage collection for Prolog based on twin cells. In 2nd NACLP Workshop on Logic Programming Architectures and Implementations. MIT Press, 1990.
 [144]
Ehud Shapiro. The family of Concurrent Logic Programming Languages. ACM computing surveys, 21(3):412-510, 1989.
 [145]
Kish Shen. Initial Results from the Parallel Implementation of DASWAM. In Michael Maher, editor, Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming. The MIT Press, 1996.
 [146]
Kish Shen. Overview of DASWAM: Exploitation of Dependent And-parallelism. Journal of Logic Programming, 29(1-3), 1996.
 [147]
Kish Shen, Vítor Santos Costa, and Andy King. Distance: a New Metric for Controlling Granularity for Parallel Execution. Journal of Functional and Logic Programming, 1999(Special Issue 1), April 1999.
 [148]
Raéd Sindaha. Branch-Level Scheduling in Aurora: The Dharma Scheduler. In ILPS93, pages 403-419, 1993.
 [149]
Donald A. Smith. Multilog and data or-parallelism. The Journal of Logic Programming, 1-3, October 1996.
 [150]
Zoltan Somogyi, Fergus Henderson, and Thomas Conway. The execution algorithm of mercury, an efficient purely declarative logic programming language. The Journal of Logic Programming, 1-3, October 1996.
 [151]
Zoltan Somogyi, Kotagiri Ramamohanarao, and Jayen Vaghani. A Stream AND-Parallel Execution Algorithm with Backtracking. In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming: Proceedings of the Fifth International Conference and Symposium, Volume 2, pages 1142-1159. The MIT Press, 1988.
 [152]
Richard M. Stallman. Using and porting gcc. Technical report, The Free Software Foundation, 1993.
 [153]
Terrance Swift and David S. Warren. An abstract machine for SLG resolution: definite programs. In Maurice Bruynooghe, editor, Logic Programming - Proceedings of the 1994 International Symposium, pages 633-652, Massachusetts Institute of Technology, 1994. The MIT Press.
 [154]
Terrance Swift and David S. Warren. Analysis of SLG-WAM evaluation of definite programs. In Maurice Bruynooghe, editor, Logic Programming - Proceedings of the 1994 International Symposium, pages 219-235, Massachusetts Institute of Technology, 1994. The MIT Press.
 [155]
Péter Szeredi. Using Dynamic Predicates in an Or-Parallel Prolog System. In Logic Programming: Proceedings of the International Logic Programming Symposium, pages 355-371. MIT Press, October 1991.
 [156]
Péter Szeredi and Zsuzsa Farkas. Handling large knowledge bases in parallel Prolog. In Workshop on High Performance Logic Programming Systems, European Summer School on Logic, Language, and Information, August 1996.
 [157]
Akikazu Takeuchi. Parallel Logic Programming. PhD thesis, University of Tokyo, July 1990.
 [158]
Paul Tarau. An Efficient Specialization of the WAM for Continuation Passing Binary programs. In Proceedings of the 1993 ILPS Conference, Vancouver, Canada, 1993. MIT Press. poster.
 [159]
Paul Tarau, Koen de Bosschere, and Bart Demoen. Partial Translation: Towards a Portable and Efficient Prolog Implementation Technology. Journal of Logic Programming, 29(1-3):65-83, November 1996.
 [160]
Andrew Taylor. Parma-bridging the performance gap between imperative and logic programming. The Journal of Logic Programming, 1-3, October 1996.
 [161]
Hans Tebra. Optimistic And-Parallelism in Prolog. In PARLE: Parallel Architectures and Languages Europe, Volume II, pages 420-431. Springer-Verlag, 1987. Published as Lecture Notes in Computer Science 259.
 [162]
Evan Tick. Memory Performance of Prolog Architectures. Kluwer Academic Publishers, Norwell, MA 02061, 1987.
 [163]
Evan Tick, Bart C. Massey, and James S. Larson. Experience with the super Monaco optimizing compiler. The Journal of Logic Programming, 1-3, October 1996.
 [164]
Bo-Ming Tong and Ho-Fung Leung. Data-Parallel Concurrent Constraint Programming. The Journal of Logic Programming, 35(2), 1998.
 [165]
Herve Touati. A prolog garbage collector for aquarius. Technical Report CSD-88-443, University of California, Berkeley, August 15, 1988.
 [166]
Andrew K. Turk. Compiler optimizations for the WAM. In Ehud Shapiro, editor, Proceedings of the Third International Conference on Logic Programming, Lecture Notes in Computer Science, pages 657-662, London, 1986. Springer-Verlag.
 [167]
Kazunori Ueda. I/O mode analysis in concurrent logic programming. Lecture Notes in Computer Science, 907:356-??, 1995.
 [168]
Peter Van Roy. Can Logic Programming Execute as Fast as Imperative Programming? PhD thesis, University of California at Berkeley, November 1990.
 [169]
Peter Van Roy. 1983-1993: The Wonder Years of Sequential Prolog Implementation. The Journal of Logic Programming, 19/20, May/July 1994.
 [170]
Peter Van Roy, Bart Demoen, and Yves D. Willems. Improving the execution speed of compiled Prolog with modes, clause selection and determinism. In TAPSOFT'87, pages 111-125. Springer Verlag, 1987.
 [171]
Peter Van Roy and A. M. Despain. The Benefits of Global Dataflow Analysis for an Optimizing Prolog Compiler. In Logic Programming Proceedings of the 1990 North American Conference, pages 501-515. MIT Press, October 1990.
 [172]
David 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.
 [173]
David H. D. Warren. An Abstract Prolog Instruction Set. Technical Note 309, SRI International, 1983.
 [174]
David H. D. Warren. The SRI model for or-parallel execution of Prolog--abstract design and implementation issues. In Proceedings of the 1987 Symposium on Logic Programming, pages 92-102, 1987.
 [175]
David H. D. Warren. The Andorra model. Presented at Gigalips Project workshop, University of Manchester, March 1988.
 [176]
David H. D. Warren, Luís Moniz Pereira, and F. C. N. Pereira. Prolog--The Language and its Implementation Compared with Lisp. ACM SIGPLAN Notices, 12(8):109-115, 1977.
 [177]
Rong Yang. P-Prolog a Parallel Logic Programming Language. World Scientific, 1987.
 [178]
Rong Yang, Anthony Beaumont, Inês C. Dutra, Vítor Santos Costa, and David H. D. Warren. Performance of the Compiler-based Andorra-I System. In Proceedings of the Tenth International Conference on Logic Programming, pages 150-166. MIT Press, June 1993.
 [179]
X. Zhon, Evan Tick, S. Duvvuru, L. Hansen, A. Sastry, and Sundararajan. Towards an efficient compile-time granularity analysis algorithm. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 809-816, ICOT, Japan, 1992. Association for Computing Machinery.
 [180]
Neng-Fa Zhou. A Novel Implementation Method of Delay. In Proceedings of the JICSLP"96, Bonn, pages 97-111. MIT Press, September 1996.
 [181]
Neng-Fa Zhou. Garbage Collection in B-Prolog. In CL2000 First Workshop on Memory Management in Logic Programs, Technical Report of Dept. Comp. Science, K.U.Leuven, July 2000.
 [182]
Neng-Fa Zhou. Implementation of a Linear Tabling Mechanism. In Enrico Pontelli and Vítor Santos Costa, editors, Practical Aspects of Declarative Languages, number 1753 in Lecture Notes in Computer Science, pages 109-123. Springer Verlag, January 2000.
 [183]
Neng-Fa Zhou, Toshihisa Takagi, and Ushijima Kazuo. A Matching Tree Oriented Abstract Machine for Prolog. In David H. D. Warren and Péter Szeredi, editors, Proceedings of the Seventh International Conference on Logic Programming, pages 158-173. MIT Press, 1990.

vitor@cos.ufrj.br

TopVida de VariáveisReferences