메뉴 건너뛰기




Volumn 17, Issue 3, 1999, Pages 285-307

On the complexity of or-parallelism

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; LOGIC PROGRAMMING;

EID: 0032592776     PISSN: 02883635     EISSN: None     Source Type: Trade Journal    
DOI: 10.1007/BF03037223     Document Type: Article
Times cited : (15)

References (39)
  • 4
    • 0002257927 scopus 로고
    • What is a pointer machine?
    • DIKU, University of Copenhagen
    • Ben-Amram, A. M., "What is a Pointer Machine?," Technical report, DIKU, University of Copenhagen, 1995.
    • (1995) Technical Report
    • Ben-Amram, A.M.1
  • 5
    • 0022812206 scopus 로고
    • On the single-operation worst-case time complexity of the disjoint set union problem
    • 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.
    • (1986) SIAM Journal on Computing , vol.15 , Issue.4 , pp. 1021-1024
    • Blum, N.1
  • 6
    • 0001610841 scopus 로고
    • Restricted AND-parallelism execution model with side-effects
    • Ewing L. Lusk and Ross A. Overbeek, eds.
    • Chang, S-E. and Chiang, Y-P., "Restricted AND-Parallelism Execution Model with Side-Effects," in Proc. of the North American Conf. on Logic Programming (Ewing L. Lusk and Ross A. Overbeek, eds.), pp. 350-368, 1989.
    • (1989) Proc. of the North American Conf. on Logic Programming , pp. 350-368
    • Chang, S.-E.1    Chiang, Y.-P.2
  • 7
    • 0024018076 scopus 로고
    • A functional approach to data structures and its use in multidimensional searching
    • Chazelle, B.., "A Functional Approach to Data Structures and its Use in Multidimensional Searching, SIAM Journal of Computing, 17(3), pp. 427-462, 1988.
    • (1988) SIAM Journal of Computing , vol.17 , Issue.3 , pp. 427-462
    • Chazelle, B.1
  • 10
    • 85030568489 scopus 로고
    • Data structures for weighted matching and nearest common ancestor
    • Gabow, H. N., "Data structures for weighted matching and nearest common ancestor," in ACM Symp. on Discrete Algorithms, pp. 434-443, 1990.
    • (1990) ACM Symp. on Discrete Algorithms , pp. 434-443
    • Gabow, H.N.1
  • 12
    • 0030127333 scopus 로고    scopus 로고
    • Cuts and side-effects in and/or parallel Prolog
    • Gupta, G. and Santos Costa, V., "Cuts and Side-effects in And/Or Parallel Prolog," Journal of Logic Programming, 27(1), pp. 45-71, 1996.
    • (1996) Journal of Logic Programming , vol.27 , Issue.1 , pp. 45-71
    • Gupta, G.1    Santos Costa, V.2
  • 14
    • 0002381368 scopus 로고
    • ACE: And/or-parallel copying-based execution of logic programs
    • MIT Press
    • Gupta, G., Pontelli, E., Hermenegildo, H. and Santos Costa, V., "ACE: And/Or-parallel Copying-based Execution of Logic Programs," in Proc. ICLP'94, MIT Press, pp. 93-109, 1994.
    • (1994) Proc. ICLP'94 , pp. 93-109
    • Gupta, G.1    Pontelli, E.2    Hermenegildo, H.3    Santos Costa, V.4
  • 15
    • 0027659656 scopus 로고
    • Analysis of or-parallel execution models
    • Gupta, G. and Jayaraman, B., "Analysis of or-parallel execution models," ACM TOPLAS, 15(4), pp. 659-680, 1993.
    • (1993) ACM TOPLAS , vol.15 , Issue.4 , pp. 659-680
    • Gupta, G.1    Jayaraman, B.2
  • 16
    • 0021426157 scopus 로고
    • Fast algorithms for finding nearest common ancestor
    • Harel, D. and Tarjan, R. E., "Fast Algorithms for Finding Nearest Common Ancestor," SIAM Journal of Computing, 13(2), pp. 338-355, 1984.
    • (1984) SIAM Journal of Computing , vol.13 , Issue.2 , pp. 338-355
    • Harel, D.1    Tarjan, R.E.2
  • 19
    • 0002767863 scopus 로고
    • &-Prolog and its performance: Exploiting independent and-parallelism
    • MIT Press, Jun.
    • Hermenegildo, M. and Greene, K., "&-Prolog and its Performance: Exploiting Independent And-Parallelism," in 1990 International Conf. on Logic Programming, MIT Press, pp. 253-268, Jun. 1990.
    • (1990) 1990 International Conf. on Logic Programming , pp. 253-268
    • Hermenegildo, M.1    Greene, K.2
  • 20
    • 0028515405 scopus 로고
    • Parallel logic programming systems
    • Kergommeaux, J. C. and Codognet, P., "Parallel logic programming systems," ACM Computing Surveys, 26(3), pp. 295-336, 1994.
    • (1994) ACM Computing Surveys , vol.26 , Issue.3 , pp. 295-336
    • Kergommeaux, J.C.1    Codognet, P.2
  • 22
    • 0030082304 scopus 로고    scopus 로고
    • Lower bounds for the union-find and the split-find problem on pointer machines
    • LaPoutré, H., "Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines," Journal of Computer and System Sciences, 52, pp. 87-99, 1996.
    • (1996) Journal of Computer and System Sciences , vol.52 , pp. 87-99
    • LaPoutré, H.1
  • 24
    • 0000670670 scopus 로고
    • The Aurora or-parallel Prolog system
    • Lusk, E. et al., "The Aurora Or-parallel Prolog System," New Generation Computing, 7(2/3), 1990.
    • (1990) New Generation Computing , vol.7 , Issue.2-3
    • Lusk, E.1
  • 27
    • 0029237793 scopus 로고
    • &ACE: A high-performance parallel Prolog system
    • Santa Barbara, CA, IEEE Computer Society, Apr.
    • Pontelli, E., Gupta, G. and Hermenegildo, M., "&ACE: A High-performance Parallel Prolog System," in International Parallel Processing Symp., Santa Barbara, CA, IEEE Computer Society, pp. 564-571, Apr. 1995.
    • (1995) International Parallel Processing Symp. , pp. 564-571
    • Pontelli, E.1    Gupta, G.2    Hermenegildo, M.3
  • 30
    • 0345092892 scopus 로고    scopus 로고
    • Dynamic data structures in advanced programming languages implementation
    • Dept. Computer Science, New Mexico State University
    • Ranjan, D., Pontelli, E. and Gupta, G., "Dynamic Data Structures in Advanced Programming Languages Implementation," Technical report, Dept. Computer Science, New Mexico State University, 1997.
    • (1997) Technical Report
    • Ranjan, D.1    Pontelli, E.2    Gupta, G.3
  • 31
    • 84918983692 scopus 로고
    • A machine oriented logic based on the resolution principle
    • Jan.
    • Robinson, J. A., "A Machine Oriented Logic Based on the Resolution Principle," Journal of the ACM, 12(23), pp. 23-41, Jan. 1965.
    • (1965) Journal of the ACM , vol.12 , Issue.23 , pp. 23-41
    • Robinson, J.A.1
  • 32
    • 0000371259 scopus 로고
    • Storage modification machines
    • Aug.
    • Schönhage, A., "Storage Modification Machines," SIAM Journal of Computing, 9(3), pp. 490-508, Aug. 1980.
    • (1980) SIAM Journal of Computing , vol.9 , Issue.3 , pp. 490-508
    • Schönhage, A.1
  • 36
    • 0011739689 scopus 로고
    • Performance analysis of the Aurora or-parallel Prolog system
    • MIT Press, Oct.
    • Szeredi, P., "Performance Analysis of the Aurora Or-Parallel Prolog System," in 1989 North American Conf. on Logic Programming, MIT Press, pp. 713-732, Oct. 1989.
    • (1989) 1989 North American Conf. on Logic Programming , pp. 713-732
    • Szeredi, P.1
  • 37
    • 0018455018 scopus 로고
    • A class of algorithms which require nonlinear time to mantain disjoint sets
    • Tarjan, R. E., "A Class of Algorithms which Require Nonlinear Time to Mantain Disjoint Sets," Journal of Computer and System Sciences, 2(18), pp. 110-127, 1979.
    • (1979) Journal of Computer and System Sciences , vol.2 , Issue.18 , pp. 110-127
    • Tarjan, R.E.1
  • 38
    • 0023842642 scopus 로고
    • The nearest common ancestor in a dynamic tree
    • Tsakalidis, A. K., "The Nearest Common Ancestor in a Dynamic Tree," ACTA Informatica, 25, 1988.
    • (1988) ACTA Informatica , vol.25
    • Tsakalidis, A.K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.