{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:10:50Z","timestamp":1748405450240,"version":"3.41.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Parallel Programming"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1023\/a:1007529200051","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:04:10Z","timestamp":1040551450000},"page":"275-319","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Logic Programming for Problem Solving"],"prefix":"10.1007","volume":"28","author":[{"given":"Ramiro Varela","family":"Arias","sequence":"first","affiliation":[]},{"given":"Camino Rodr\u00edguez","family":"Vela","sequence":"additional","affiliation":[]},{"given":"Jorge Puente","family":"Peinador","sequence":"additional","affiliation":[]},{"given":"Cesar Alonso","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"223884_CR1","first-page":"445","volume":"19","author":"K. A. M. Ali","year":"1991","unstructured":"K. A. M. Ali and R. Karlsson, Full Prolog and scheduling or-parallelism in Muse, IJPP, 19(6):445\u2013475 (1991).","journal-title":"IJPP"},{"key":"223884_CR2","volume-title":"The and-or process model for parallel interpretation of logic programs","author":"J. S. Conery","year":"1983","unstructured":"J. S. Conery, The and-or process model for parallel interpretation of logic programs, Ph.D. Th. Dpto. Information and Computer Science, University California, Irvine (1983)."},{"key":"223884_CR3","unstructured":"D. DeGroot, Restricted and-parallelism, Proc. Int'l. Conf. Fifth Generation Comp. Systems, North-Holland, pp. 471\u2013478 (1984)."},{"key":"223884_CR4","unstructured":"J. Chang, A. M. Despain, and D. Degroot, and-parallelism of logic programs-based on static data dependency analysis, COMPCOM, pp. 218\u2013225 (1985)."},{"key":"223884_CR5","volume-title":"Parallel architectures for problem solving","author":"L. V. Kale","year":"1985","unstructured":"L. V. Kale, Parallel architectures for problem solving, Ph.D. thesis, Dept. Computer Science, SUNY, Stony Brook (1985)."},{"key":"223884_CR6","unstructured":"P. P. Li and A. J. Martin, The SYNC model: A parallel execution method for logic programming, Proc. Symp. on Logic Progr., Salt Lake City (September 1986)."},{"key":"223884_CR7","unstructured":"H. Westphal, P. Robert, J. Chassin, and J. Syre, The PEPSys model: Combining back-traking, and-and or-parallelism, IEEE Int'l. Symp. Logic Progr., San Francisco, California, pp. 436\u2013448 (1987)."},{"key":"223884_CR8","unstructured":"G. Gupta, Parallel execution of logic programs on shared memory multiprocessors, Ph.D. thesis, Dept. of Computer Science, University North Carolina at Chapel Hill (1992)."},{"key":"223884_CR9","volume-title":"An abstract machin\u00e9based execution model for computer architecture design and efficient implementation of logic programs in parallel","author":"M. V. Hermenegildo","year":"1986","unstructured":"M. V. Hermenegildo, An abstract machin\u00e9based execution model for computer architecture design and efficient implementation of logic programs in parallel, Ph.D. thesis, University of Texas at Austin (1986)."},{"key":"223884_CR10","doi-asserted-by":"crossref","unstructured":"E. Lusk et al., The Aurora or-parallel Prolog system, New Generation Computing, 7(2\u20133) (1990).","DOI":"10.1007\/BF03037208"},{"key":"223884_CR11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0743-1066(91)90009-E","volume":"11","author":"L. V. Kale","year":"1991","unstructured":"L. V. Kale, The REDUC\u00e9OR process model for parallel interpretation of logic programs, J. Logic Progr., 11:55\u201384 (1991).","journal-title":"J. Logic Progr."},{"key":"223884_CR12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(92)90006-J","volume":"58","author":"P. V. Hentenryck","year":"1992","unstructured":"P. V. Hentenryck, H. Simonis, and M. Dincbas, Constraint satisfaction using constraint logic programming, Artificial Intelligence, 58:113\u2013159 (1992).","journal-title":"Artificial Intelligence"},{"key":"223884_CR13","doi-asserted-by":"crossref","unstructured":"H. M. Adorf and M. D. Johnston, A discrete stochastic neural network algorithm for constraint satisfaction problems, Proc. Int'l. Joint Conf. Neural Networks, San Diego, California (1990).","DOI":"10.1109\/IJCNN.1990.137951"},{"key":"223884_CR14","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0004-3702(92)90010-U","volume":"58","author":"M. Zweben","year":"1992","unstructured":"M. Zweben, E. Davis, B. Daun, E. Drascher, M. Deale, and M. Eskey, Learning to improve constraint-based scheduling, Artificial Intelligence, 58:271\u2013296 (1992).","journal-title":"Artificial Intelligence"},{"key":"223884_CR15","unstructured":"D. Corne and P. Ross, Practical Issues and Recent Advances in Job-and Open-Shop Scheduling, D. Dasgupta and Z. Michalewicz (eds.), Springer-Verlag."},{"key":"223884_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(95)00098-4","volume":"86","author":"N. Sadeh","year":"1996","unstructured":"N. Sadeh and M. S. Fox, Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem, Artificial Intelligence, 86:1\u201341 (1996).","journal-title":"Artificial Intelligence"},{"key":"223884_CR17","unstructured":"N. J. Nilsson and J. Matuszynski, Logic, Programming and Prolog, John Wiley (1990)."},{"key":"223884_CR18","unstructured":"L. V. Kale, A tree representation for parallel problem solving, Proc. Int'l. Conf. Parallel Processing, St. Charles, pp. 677\u2013681 (August 1988)."},{"issue":"1","key":"223884_CR19","first-page":"47","volume":"22","author":"J. B. Dennis","year":"1994","unstructured":"J. B. Dennis, Machines and models for parallel computers, IJPP, 22(1):47\u201377 (February 1994).","journal-title":"IJPP"},{"key":"223884_CR20","unstructured":"R. Varela, Un Modelo para el c\u00e1 lculo paralelo de deducciones en l\u00f3gica de predicados, Tesis doctoral, Departamento de Matem\u00e1ticas, Universidad de Oviedo (1995)."},{"key":"223884_CR21","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0743-1066(89)90015-0","volume":"6","author":"A. Delcher","year":"1989","unstructured":"A. Delcher and S. Kasif, Some result on the complexity of exploiting data dependency in parallel logic programs, J. Logic Progr., 6:229\u2013241 (1989).","journal-title":"J. Logic Progr."},{"key":"223884_CR22","doi-asserted-by":"crossref","unstructured":"C. R. Vela, C. L. Alonso, R. Varela, and J. Puente, A genetic approach to computing independent and parallelism in logic programming, in Biological and Artificial Computation: From Neuroscience to Technology, IWANN'97, J. Mira, R. Moreno, and J. Cabestany (eds.), Springer-Verlag, Lecture Notes in Computer Science, pp. 566\u2013575 (1997).","DOI":"10.1007\/BFb0032516"},{"key":"223884_CR23","unstructured":"C. L. Alonso, C. R. Vela, R. Varela, and J. Puente, Ordered structures for parallel rul\u00e9based computations, Technical Report, Centro de Inteligencia Artificial, Univ. de Oviedo (1999)."},{"key":"223884_CR24","unstructured":"R. Varela, E. Sierra, L. Jim\u00e9nez, and C. R. Vela, Combinaci\u00f3 n de Soluciones Parciales en Programaci\u00f3n L\u00f3gica Paralela, C-AEPIA, Alicante (1995)."},{"issue":"1\u20133","key":"223884_CR25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0004-3702(92)90003-G","volume":"58","author":"A. K. Mackworth","year":"1992","unstructured":"A. K. Mackworth, The logic of constraint satisfaction, Artificial Intelligence, 58(1\u20133):3\u201320 (December 1992).","journal-title":"Artificial Intelligence"},{"issue":"1","key":"223884_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(93)00007-F","volume":"22","author":"M. V. Hermenegildo","year":"1995","unstructured":"M. V. Hermenegildo and F. Rossi, Strict AND Nonstrict and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions, J. Logic Progr., 22(1):1\u201345 (January 1995).","journal-title":"J. Logic Progr."},{"issue":"4","key":"223884_CR27","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1145\/146585.146624","volume":"39","author":"S. K. Debray","year":"1992","unstructured":"S. K. Debray, Efficient dataflow analysis of logic programs, J. ACM, 39(4):949\u2013984 (1992).","journal-title":"J. ACM"},{"key":"223884_CR28","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0743-1066(92)90034-Z","volume":"13","author":"D. Jacobs","year":"1992","unstructured":"D. Jacobs and A. Langen, Static analysis of logic programs for independent and parallelism, J. Logic Progr., 13:291\u2013314 (1992).","journal-title":"J. Logic Progr."},{"key":"223884_CR29","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","volume":"13","author":"K. Muthukumar","year":"1992","unstructured":"K. Muthukumar and M. Hermenegildo, Compile-time derivation of variable dependency using abstract interpretation, J. Logic Progr., 13:315\u2013347 (1992).","journal-title":"J. Logic Progr."},{"issue":"2","key":"223884_CR30","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0743-1066(98)10022-5","volume":"38","author":"K. Muthukumar","year":"1999","unstructured":"K. Muthukumar, F. Beuno, M. Garc\u00eda de la Banda, and M. Hermenegildo, Automatic compile-time parallelization of logic programs for restricted, goal level, independent and parallelism, J. Logic Progr., 38(2):165\u2013218 (February 1999).","journal-title":"J. Logic Progr."},{"key":"223884_CR31","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0747-7171(08)80151-4","volume":"12","author":"B. Schend","year":"1991","unstructured":"B. Schend, A Methodology for detecting shared variable dependencies in logic programs, J. Symbolic Computation, 12:275\u2013298 (1991).","journal-title":"J. Symbolic Computation"},{"key":"223884_CR32","unstructured":"R. Cucchiara, E. Lamma, P. Mello, M. Milano, and M. Piccardi, Interactive Constraint Satisfaction and its Application to Visual Object Recognition, Proc. APPIA-GULP-PRODE, La Coru\u00f1a, Spain, pp. 57\u201369 (July 1998)."},{"issue":"1\u20132","key":"223884_CR33","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0743-1066(90)90052-7","volume":"8","author":"M. Dincbas","year":"1990","unstructured":"M. Dincbas, H. Simonis, and P. V. Hentenryck, Solving large combinatorial problems in logic programming, J. Logic Progr., 8(1\u20132):75\u201393 (1990).","journal-title":"J. Logic Progr."},{"issue":"1\u20133","key":"223884_CR34","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0743-1066(98)10008-0","volume":"37","author":"F. Fages","year":"1998","unstructured":"F. Fages, J. Fowler, and T. Sola, Experiments in reactive constraint logic programming, J. Logic Progr., 37(1\u20133):185\u2013212 (1998).","journal-title":"J. Logic Progr."},{"issue":"1\u20133","key":"223884_CR35","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0743-1066(98)10006-7","volume":"37","author":"P. V. Hentenryck","year":"1998","unstructured":"P. V. Hentenryck, V. Saraswat, and Y. Deville, Design, implementation, and evaluation of the constraint language cc(FD), J. Logic Progr., 37(1\u20133):139\u2013164 (1998).","journal-title":"J. Logic Progr."},{"issue":"20","key":"223884_CR36","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jafar","year":"1994","unstructured":"J. Jafar and M. J. Maher, Constraint logic programming: A survey, J. Logic Progr., 19\/20:503\u2013581 (1994).","journal-title":"J. Logic Progr."},{"issue":"1","key":"223884_CR37","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0743-1066(98)10016-X","volume":"38","author":"E. Lamma","year":"1999","unstructured":"E. Lamma, M. Milano, and P. Mello, Reasoning on constraints in CLP(FD), J. Logic Progr., 38(1):93\u2013110 (January 1999).","journal-title":"J. Logic Progr."},{"key":"223884_CR38","unstructured":"J. Puente, R. Varela, C. R. Vela, and C. Alonso, A parallel logic programming approach to job shop constraint satisfaction problems, Proc. APPI\u00c1-GULP-PRODE, La Coru\u00f1a, Spain, pp. 29\u201341 (July 1998)."},{"key":"223884_CR39","unstructured":"R. Varela, J. Puente, C. R. Vela, and C. Alonso, Planificaci\u00f3 n Heur\u00edstica de Procesos and-or Paralelos, CAEPIA, M\u00e1laga (1997)."},{"key":"223884_CR40","first-page":"9","volume":"1","author":"J. Puente","year":"1999","unstructured":"J. Puente, R. Varela, and C. R. Vela, C\u00e1lculo paralelo de deducciones en un sistema multi-procesador, Proc. CAEPIA, Murcia, Spain, Vol. 1, pp. 9\u201316 (November 1999).","journal-title":"Proc. CAEPIA, Murcia, Spain"},{"key":"223884_CR41","doi-asserted-by":"crossref","unstructured":"E. Pontelli, G. Gupta, and M. Hermenegildo, 6\u2013ACE: A high performance parallel Prolog system, Proc. Ninth Int'l. Parallel Proc. Symp., IEEE Press, pp. 564\u2013571 (1995).","DOI":"10.1109\/IPPS.1995.395891"},{"key":"223884_CR42","unstructured":"K. Shen, Initial results from the parallel implementation DASWAM, Proc. Joint Int'l. Conf. Symp. Logic Progr., MIT Press (1996)."},{"key":"223884_CR43","unstructured":"G. Gupta and E. Pontelli, High performance parallel logic programming: The ACE parallel Prolog system, APPIA-GULP-PRODE, Grado, Italy, pp. 25\u201331 (1997)."},{"key":"223884_CR44","unstructured":"R. Varela and C. R. Vela, AND-OR Trees for Parallel Deductions, ITHURS, Le\u00f3n, Spain (July 1996)."},{"key":"223884_CR45","unstructured":"C. S. Mellish, The automatic generation of mode declaration for Prolog programs, Dept. Artificial Intelligence, Research Paper No. 163, University of Edinburgh (1981)."},{"key":"223884_CR46","unstructured":"R. Varela, El Modelo RPS para la Gesti\u00f3n del Paralelismo and Independiente en Programas L\u00f3gicos, Proc. Joint Conf. Declarative Progr. GULP_PRODE, pp. 251\u2013265 (1994)."},{"key":"223884_CR47","unstructured":"R. Varela, C. R. Vela, and J. Puente, Efficient Producer-Consumer Parallelism in Logic Programming, APPIA-GULP-PRODE, San Sebastian (July 1996)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007529200051.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007529200051\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007529200051.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:38:28Z","timestamp":1748335108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007529200051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["223884"],"URL":"https:\/\/doi.org\/10.1023\/a:1007529200051","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}