On the complexity of or-parallelism-Reference-Cited by-同舟云学术

On the complexity of or-parallelism

Published:1999-09 Issue:3 Volume:17 Page:285-307
ISSN:0288-3635
Container-title:New Generation Computing
language:en
Short-container-title:NGCO

Author:

Ranjan Desh,Pontelli Enrico,Gupta Gopal

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF03037223.pdf

Reference39 articles.

1. Ali, K. A. M. and Karlsson, R., “The Muse Or-parallel Prolog Model and its Performance,” in1990 North American Conf. on Logic Programming, MIT Press, pp. 757–776, 1990.

2. Ali, K. A. M. and Karlsson, R., “Full Prolog and Scheduling Or-parallelism in Muse,”International Journal of Parallel Programming, 19(6), pp. 445–475, 1991.

3. Beaumont, T. and Warren, D. H. D., “Scheduling Speculative Work in Or-Parallel Prolog Systems,” in10th International Conf. on Logic Programming, MIT Press, pp. 135–149, 1993.

4. Ben-Amram, A. M., “What is a Pointer Machine?,”Technical report, DIKU, University of Copenhagen, 1995.

5. Blum, N., “On the single-operation worst-case time complexity of the disjoint set union problem,”SIAM Journal on Computing, 15(4), pp. 1021–1024, 1986.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel Logic Programming: A Sequel;Theory and Practice of Logic Programming;2022-03-28

2. Parallel Answer Set Programming;Handbook of Parallel Constraint Reasoning;2018

3. PALS: Efficient Or-Parallel execution of Prolog on Beowulf clusters;Theory and Practice of Logic Programming;2007-11

4. Stack splitting: A technique for efficient exploitation of search parallelism on share-nothing platforms;Journal of Parallel and Distributed Computing;2006-10

5. Sequential and parallel algorithms for the NCA problem on pure pointer machines;Theoretical Computer Science;2006-03