Ordered structures for parallel rule-based computations

References

• Chang , J. , Despain , A.M. and Degroot , D. 1985 . AND-Parallelism of Logic Programs Based on Static Data Dependency Analysis . COMPCOM Spring , : 218 – 225 .
   Google Scholar
• Conery , J.S. 1983 . The AND/OR Process Model for Parallel Interpretation of Logic Programs , Irvine : Univ. California . Ph.D. Th. Dpto. Information and Computer Science
   Google Scholar
• Debray , S.K. 1992 . Efficient Dataflow Analysis of Logic Programs . Journal of the ACM , 39 ( 4 ) : 949 – 984 .
   Web of Science ®Google Scholar
• DeGroot , D. 1984 . “ Restricted And-Parallelism ” . In Procs. of the International Conf on Fifth Generation Comp. Systems , 471 – 478 . North Holland .
   Google Scholar
• Delcher , A. and Kasif , S. 1989 . Some Result on the Complexity of Exploiting Data Dependency in Parallel Logic Programs . Journal of Logic Programming , 6 : 229 – 241 .
   Web of Science ®Google Scholar
• Gupta , G. 1992 . Parallel Execution of Logic Programs on Shared Memory Multiprocessors , Univ. North Carolina Chapel Hill . Ph. D. Thesis Dept. of Computer Science
   Google Scholar
• Gupta , G. and Santos Costa , V. 1994 . Optimal implementation of And-OR Parallel Prolog . FGCS , 10 ( 1 ) : 71 – 92 .
   Web of Science ®Google Scholar
• Kal , L.V. 1991 . The REDUCE-OR Process Model for Parallel Interpretation of Logic Programs . The Journal of Logic Programming , 11 ( 1 ) : 55 – 84 .
   Web of Science ®Google Scholar
• Mellish , C.S. 1981 . The Automatic Generation of mode Declaration for Prolog Programs , Univ, of Edinburgh . Dept, Artificial Intelligence, Research Paper No. 163
   Google Scholar
• Muthukumar , K. and Hermenegildo , M. 1990 . The CDG, UDG and MEL Methods for Automatic Compile-Time Parallehzation of Logic Programs for Independent And Parallelism . ICLP , 90 : 221 – 237 .
   Google Scholar
• Muthukumar , K. and Hermenegildo , M. 1992 . Compile-Time Derivation of Variable Dependency Using Abstract Interpretation . Journal of Logic Programming , 13 : 315 – 347 .
   Web of Science ®Google Scholar
• Muthukumar , K. , Bueno , F. , La Bamda , Garca De M. and Hermenegildo , M. 1999 . Automatic compile-time parallelization of logic programms for restricted, goal level, independent and parallelism . The Journal of Logic Programming , 38 ( 2 ) : 165 – 218 .
   Web of Science ®Google Scholar
• Puente , J. , Varela , R. , Vela , C. and Alonso , C. 1998 . A Parallel Logic Programming Approach to Job Shop Scheduling Constraint Satisfaction Problems . Joint Conference on Declarative Programming APPIA-GULP-PRQDE . 1998 . pp. 29 – 41 . La Coruna , , Spain
   Google Scholar
• Varela , R. 1995 . Un Modelo para el Calcule Paralelo de Deducciones en Légica de Predicados , Universidad de Oviedo . Ph. D. Departamento de Maiemàticas
   Google Scholar
• Varela , R. , Vela , C. , Puente , J. and Alonso , C. 2000 . It Parallel Logic Programming for Problem Solving . International Journal of Parallel Programming , 25 ( 3 ) : 275 – 319 .
   Google Scholar
• Vela , C.R. and Bahamonde , A. 1992 . An Algorithm to Minimise Representations of Finite Order Relations . International Journal of Computer Mathematics , 41 ( 3 ) : 139 – 150 .
   Web of Science ®Google Scholar
• Vela , C.R. and Bahamonde , A. 1995 . The Best Nondetenninistic Representations of Finite Orderings . Journal of Computer and Systems Sciences , 50 ( 3 ) : 486 – 494 .
   Web of Science ®Google Scholar
• Vela , C.R. , Alonso , C.L. , Varela , R. and Puente , J. 1997 . A Genetic Approach to Computing Independent AND Parallelism in Logic Programming, L.N.C.S . Biological and Artificial Computation: From Neuroscience to Technology , IWANN97 ( 3 ) : 566 – 575 .
   Google Scholar
• Westphal , H. , Robert , P. , Chassin , J. and Syre , J. The PEPSys Model: Combining Backtraking, AND- and OR-Parallelism . IEEE Intl Symp, in Logig Programming . Vol. San Francisco , pp. 436 – 448 .
   Google Scholar