{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:19Z","timestamp":1725663859086},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540554257"},{"type":"electronic","value":"9783540470663"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55425-4_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:58:49Z","timestamp":1330250329000},"page":"253-269","source":"Crossref","is-referenced-by-count":0,"title":["Non-WAM models of logic programming and their support by novel parallel hardware"],"prefix":"10.1007","author":[{"given":"Jiwei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy","family":"Marsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Lavington","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"13_CR1","unstructured":"F. Bancilhon, D. Maier, Y. Sagiv & J.D. Ullman, \u201cMagic sets and other strange ways to implement logic programs\u210d, proceedings 5th ACM SIGMOD-SIGACT Symposium on Principles of Database Systems (PODS), pp. 1\u201315."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"C. Beeri & R. Ramakrishnan, \u201cOn the power of magic\u210d, proceedings 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), San Diego, CA, March 1987, pp. 269\u2013283.","DOI":"10.1145\/28659.28689"},{"key":"13_CR3","unstructured":"F. Bry, \u201cAdvanced fixpoint procedures for querying databases: A rule-based approach\u210d, Internal report No. IR-KB-61, ECRC, March 1989."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"W. Bibel, F, Kurfess, K. Aspetsberger, P. Hintenaus & J. Schumann. \u201cParallel Inference Machines\u210d, Future Parallel Computers, Edited by P. Treleaven & M. Vanneschi, LNCS. No. 272, Springer-Verlag, 1987, pp. 185\u2013226.","DOI":"10.1007\/3-540-18203-9_5"},{"key":"13_CR5","first-page":"159","volume":"12","author":"C. L. Chang","year":"1979","unstructured":"C.L. Chang & J.R. Slagle. \u201cUsing Rewriting Rules for Connection Graphs to Prove Theorems\u210d, Journal of AI 12 (1979), pp. 159\u2013180.","journal-title":"Journal of AI"},{"key":"13_CR6","volume-title":"Initial Evaluation of a Virtual Machine for OR-Parallel Execution of Logic Programs","author":"A. Ciepielewski","year":"1985","unstructured":"A. Ciepielewski, S. Haridi & B. Hausman. \u201cInitial Evaluation of a Virtual Machine for OR-Parallel Execution of Logic Programs\u210d, IFIP TC-10 Working Conf. on Fifth Generation Computer Architecture, UMIST, Manchester, July 15\u201318 1985."},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF03037466","volume":"No. 5","author":"J. H. Harland","year":"1987","unstructured":"J.H. Harland & J. Jaffar. \u201cOn Parallel Unification for Prolog\u210d, New Generation Computing, No. 5, 1987, pp. 259\u2013279.","journal-title":"New Generation Computing"},{"key":"13_CR8","unstructured":"L. Kale, B. Ramkumar & W. Shu, \u201cA memory organization independent binding environment for AND and OR parallel execution of logic programs\u210d, proceedings 5th International Conference and Symposium on Logic Programming, R.Kowalski K.Bowen (ed), Seattle, August 1988, pp. 1223\u20131240."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"S.H. Lavington, M. Standring, Y.J. Jiang, C.J. Wang & M.E. Waite. \u201cHardware Memory Management for Large Knowledge Bases\u210d, Proc. of PARLE, the Conference on Parallel Architectures and Languages Europe, Eindhoven, June 1987, pp. 226\u2013241.","DOI":"10.1007\/3-540-17943-7_131"},{"issue":"No3","key":"13_CR10","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0950-7051(88)90074-3","volume":"1","author":"S. H. Lavington","year":"1988","unstructured":"S.H. Lavington. \u201cTechnical Overview of the Intelligent File Store\u210d, J. Knowledge-Based Systems, vol.1, No 3. 1988, pp. 166\u2013172.","journal-title":"J. Knowledge-Based Systems"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"S.H. Lavington, J. Robinson & F-Y. Mok. \u201cA High-speed Relational Algebraic Processor for Large Knowledge Bases\u210d, Proc. of Intl. Workshop on VLSI for AI, Oxford, July, 1988. Also in VLSI for AI, (eds). Delgado-Frias and Moore, Kluwer Academic Press, 1989, pp. 133\u2013143.","DOI":"10.1007\/978-1-4613-1619-0_12"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"S.H. Lavington & R.A.J. Davies, \u201cActive Memory for Managing Persistent Objects\u210d. Presented at the International Workshop on Computer Architectures to Support Security and Persistence, Bremen, FRG, May 1990. Proceedings published by Springer-Verlag, pages 137\u2013154.","DOI":"10.1007\/978-1-4471-3178-6_10"},{"key":"13_CR13","unstructured":"J.C. Manley, \u201ckbProlog: a Language for Knowledge Management\u210d. Proceedings of the UNICOM Seminar on Commercial Parallel Processing, London, June 1990, pages 164\u2013173."},{"key":"13_CR14","unstructured":"A.J.Marsh, \u201cA query evaluation model supporting parallelism for logic programs\u210d, Thesis submitted for Ph.D., Dept. of Computer Science, Univ. of Essex, 1990."},{"key":"13_CR15","unstructured":"W. Nejdl, \u201cRecursive strategies for answering recursive queries \u2014 The RQA\/FQI strategy\u210d, proceedings 13th International Conference on Very Large Data Bases, Brighton, U.K. September 1987, pp. 43\u201350."},{"issue":"No.3","key":"13_CR16","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF03037407","volume":"4","author":"R. Rohmer","year":"1986","unstructured":"R. Rohmer, R. Lescoeur & J.M. Kerisit, \u201cThe Alexander Method, a Technique for Processing of Recursive Axioms in Deductive Databases\u210d, New Generation Computing, Vol. 4 No. 3, 1986, pp. 273\u2013285.","journal-title":"New Generation Computing"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"J. Robinson & S.H. Lavington, \u201cA Transitive Closure and Magic Functions Machine\u210d, Proc. of the Second International Symposium on Databases in Parallel and Distributed Systems, Dublin, July 1990, pp. 44\u201354.","DOI":"10.1109\/DPDS.1990.113697"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"H. Tamaki & T. Sato, \u201cOLD resolution with tabulation\u210d, proceedings of 3rd International Conference on Logic programming, London, U.K., 1986, pp. 84\u201398.","DOI":"10.1007\/3-540-16492-8_66"},{"key":"13_CR19","unstructured":"L. Vieille, \u201cRecursive Axioms in Deductive Databases: The Query\/Subquery Approach\u210d, proceedings First International Conference on Expert Database Systems, Charleston, 1986, pp. 179\u2013194."},{"issue":"No.1","key":"13_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","volume":"69","author":"L. Vieille","year":"1989","unstructured":"L. Vieille, \u201cRecursive Query Processing: the Power of Logic\u210d, Journal of Theoretical Computer Science (Netherlands), vol 69, No. 1, December 1989, pp. 1\u201353.","journal-title":"Journal of Theoretical Computer Science (Netherlands)"},{"key":"13_CR21","unstructured":"J. Wang. \u201cA New Computational Model for Logic Languages and its Supporting Architecture\u210d, Forthcoming Ph.D. Thesis, Dept. of Computer Science, Univ. of Essex, 1990."},{"key":"13_CR22","unstructured":"J. Wang & S.H. Lavington, \u201cThe Wivenhoe Computational Model: in Search of More Parallelisms\u210d, Proc. of UK Association for Logic Programming 1990 Conference, Bristol, March, 1990."},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"C.J. Wang & S.H. Lavington, \u201cSIMD Parallelism for Symbol Mapping\u210d, International Workshop on VLSI for AI and Neural Networks, Oxford, Sept., 1990.","DOI":"10.1007\/978-1-4615-3752-6_7"},{"key":"13_CR24","unstructured":"H. Yasuura. \u201cOn Parallel Computational Complexity of Unification\u210d, Proc. of the fifth generation computer systems 1984, pp. 235\u2013243."}],"container-title":["Lecture Notes in Computer Science","Parallelization in Inference Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55425-4_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:45Z","timestamp":1605646725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55425-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540554257","9783540470663"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-55425-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}