{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T20:40:10Z","timestamp":1683060010193},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1986,2,1]],"date-time":"1986-02-01T00:00:00Z","timestamp":507600000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1986,2]]},"DOI":"10.1007\/bf01379150","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T00:11:46Z","timestamp":1112400706000},"page":"73-99","source":"Crossref","is-referenced-by-count":2,"title":["Control and data driven execution of logic programs: A comparison"],"prefix":"10.1007","volume":"15","author":[{"given":"Simon","family":"Kasif","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"S. Kasif, Analysis of Parallelism in Logic Programs, Ph.D. Thesis, Computer Science Dept., University of Maryland., (1984)."},{"key":"CR2","unstructured":"R. A. Kowalski,Logic for Problem Solving, North-Holland, (1979)."},{"key":"CR3","volume-title":"A Note on Translating Flowchart and Recursive Schemas to Prolog Schemas, TR-1273","author":"S. Kasif","year":"1983","unstructured":"S. Kasif, A Note on Translating Flowchart and Recursive Schemas to Prolog Schemas, TR-1273, Department of Computer Science, University of Maryland, College Park, Maryland, (May 1983)."},{"key":"CR4","unstructured":"S. Kasif, M. Kohli, and J. Minker, PRISM?A Parallel Inference System Based on Logic, Technical Report TR-1243, Computer Science Department, University of Maryland, (February 1983)."},{"key":"CR5","unstructured":"C. Rieger, R. Trigg, and R. Bane, ZMOB: A New Computing Engine for AI,Proc. of IJCAI-81, Vancouver (also University of Maryland CS TR-1028), (August 1981)."},{"key":"CR6","unstructured":"E. Y. Shapiro, A Subset of Concurrent Prolog and Its Interpreter, TR-003,ICOT, (1983)."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"K. Clark and S. Gregory, PARLOG: Parallel Programming in Logic,ACM TOPLAS 8(1) (January 1986).","DOI":"10.1145\/5001.5390"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"M. J. Wise A Parallel Prolog: The Construction of A Data Driven Model,ACM Symp. on LISP and Functional Programming, Pittsburgh, (August 1982).","DOI":"10.1145\/800068.802135"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"K. Ueda, Guarded Horn Clauses, TR-103, ICOT, Japan, (1985).","DOI":"10.1007\/3-540-16479-0_17"},{"key":"CR10","first-page":"253","volume-title":"Logic Programming","author":"K. L. Clark","year":"1982","unstructured":"K. L. Clark and F. McCabe, IC-Prolog Language Features, inLogic Programming, K. L. Clark and S. A. Tarnlund, eds. Academic Press, London, pp. 253?267 (1982)."},{"key":"CR11","unstructured":"S. Kasif, M. Kohli, and J. Minker, Control Facilities of PRISM?A Parallel Inference System Based on Logic,Proc. of the Int. Joint Conf. on Artificial Intelligence, (August 1983)."},{"key":"CR12","series-title":"Technical Report","volume-title":"Parallel Logic Programming in PRISM: Initial Experimental Work","author":"Mark Giuliano","year":"1985","unstructured":"Mark, Giuliano, Madhur Kohli, Jack Minker, Arcot Rajasekar, and Deepak Sherlekar, Parallel Logic Programming in PRISM: Initial Experimental Work, Technical Report, Department of Computer Science, University of Maryland, College Park, (1985)."},{"key":"CR13","unstructured":"Paul H. Morris, A Dataflow Interpreter for Logic Programs,Proc. of the First Workshop on Logic Programming, pp. 148?159, (1980)."},{"key":"CR14","unstructured":"M. H. van Emden and G. J. de Lucena, Predicate Logic as a Programming Language for Parallel Programming, inLogic Programming, K. L. Clark and S. A. Tarnlund, eds., Academic Press, (1982)."},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"K. L. Clark and S. Gregory, A Relational Programming Language for Parallel Programming, Research Report, Imperial College, (July 1981).","DOI":"10.1145\/800223.806776"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"K. Ueda, Concurrent Prolog Re-examined, TR-102,ICOT, Japan, (1984).","DOI":"10.1007\/978-3-642-96868-6_196"},{"key":"CR17","unstructured":"V. A. Saraswat, Problems with Concurrent Prolog, CMU Technical Report, (June 1985)."},{"issue":"1","key":"CR18","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/356869.356873","volume":"14","author":"P. C. Treleaven","year":"1982","unstructured":"P. C. Treleaven, D. R. Brownbridge, and R. P. Hopkins, Data-Driven and Demand-Driven Computer Architecture,Computing Surveys 14(1): 93?143 (March 1982).","journal-title":"Computing Surveys"},{"issue":"3","key":"CR19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF03037062","volume":"2","author":"A. J. Kusalik","year":"1984","unstructured":"A. J. Kusalik, Process Serialization in a Concurrent Prolog,New Generation Computing 2(3): 289?298 (1984).","journal-title":"New Generation Computing"},{"key":"CR20","volume-title":"Design, Application and Implementation of a Parallel Logic Programming Language","author":"S. Gregory","year":"1985","unstructured":"S. Gregory, Design, Application and Implementation of a Parallel Logic Programming Language, Ph. D. Thesis, Imperial College, London, (1985)."},{"key":"CR21","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman,Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading Massachusetts, (1979)."},{"key":"CR22","unstructured":"L. M. Pereira and L. F. Monteiro, The Semantics of Parallelism and Coroutining in Logic Programming, Report 2\/80, Departmento de Informatica, Universidade Nova de Lisboa, (January 1978)."},{"key":"CR23","unstructured":"A. Reuveni, The Event Based Language and Its Multiple Processor Implementations, Ph. D. Thesis, MIT\/LCS\/TR-226, (January 1980)."},{"key":"CR24","first-page":"384","volume":"10","author":"J. D. Ullman","year":"1975","unstructured":"J. D. Ullman, NP-Complete Scheduling Problems,JCSS 10:384?393, (1975).","journal-title":"JCSS"},{"key":"CR25","volume-title":"Computers and Intractability: A Guide to NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to NP-completeness, Freeman and Company, San Francisco, (1979)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01379150.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01379150\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01379150","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T20:05:05Z","timestamp":1683057905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01379150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,2]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,2]]}},"alternative-id":["BF01379150"],"URL":"https:\/\/doi.org\/10.1007\/bf01379150","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,2]]}}}