{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:36Z","timestamp":1725663036746},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164920"},{"type":"electronic","value":"9783540398318"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16492-8_104","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:49:40Z","timestamp":1330195780000},"page":"554-568","source":"Crossref","is-referenced-by-count":39,"title":["Design overview of the NAIL! System"],"prefix":"10.1007","author":[{"given":"Katherine","family":"Morris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey D.","family":"Ullman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allen","family":"Gelder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"F. Afrati, C. Papadimitriou, G. Papageorgiou, A. R. Roussou, Y. Sagiv, and J. D. Ullman, \u201cConvergence of Sideways Query Evaluation,\u201d Proc. Fifth ACM Symposium on Principles of Database Systems, pp. 24\u201330, 1986.","DOI":"10.1145\/6012.15400"},{"issue":"3","key":"44_CR2","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K. R. Apt","year":"1982","unstructured":"K. R. Apt and M. H. Van Emden, \u201cContributions to the theory of logic programming,\u201d J. ACM 29:3, pp. 841\u2013862, 1982.","journal-title":"J. ACM"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman, \u201cMagic sets and other strange ways to implement logic programs,\u201d Proc. Fifth ACM Symposium on Principles of Database Systems, pp. 1\u201315, 1986.","DOI":"10.1145\/6012.15399"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"F. Bancilhon and R. Ramakrishnan, \u201cAn amateur's introduction to recursive query processing strategies,\u201d to appear in the proceedings of the 1986 SIGMOD Conf. on Management of Data, May, 1986.","DOI":"10.1145\/16894.16859"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"A. K. Chandra and D. Harel, \u201cHorn clauses and the fixpoint hierarchy,\u201d Proc. Second ACM Symposium on Principles of Database Systems, pp. 158\u2013163, 1982.","DOI":"10.1145\/588136.588137"},{"issue":"1","key":"44_CR6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/2422.2423","volume":"31","author":"L. J. Henschen","year":"1984","unstructured":"L. J. Henschen and S. A. Naqvi, \u201cOn compiling queries in recursive firstorder databases,\u201d J. ACM 31:1, pp. 47\u201385, 1984.","journal-title":"J. ACM"},{"key":"44_CR7","unstructured":"Y. E. Ioannidis, \u201cBounded recursion in deductive databases,\u201d UCB\/ERL M85\/6, Dept. of EECS, UC Berkeley, Feb., 1985."},{"key":"44_CR8","volume-title":"Query optimization in logical databases","author":"M. Kifer","year":"1985","unstructured":"M. Kifer and E. L. Lozinskii, \u201cQuery optimization in logical databases,\u201d unpublished memorandum, Dept. of CS, SUNY, Stony Brook, NY, 1985."},{"key":"44_CR9","unstructured":"E. L. Lozinskii, \u201cInference by generating and structuring deductive databases,\u201d Proc. Ninth Intl. Joint Conf. on AI, pp. 173\u2013177, 1985."},{"key":"44_CR10","unstructured":"D. McKay and S. Shapiro, \u201cUsing active connection graphs for reasoning with recursive rules,\u201d Proc. Seventh Intl. Joint Conf. on AI, pp. 368\u2013374, 1981."},{"key":"44_CR11","unstructured":"L. Naish, \u201cNegation and control in Prolog,\u201d Ph. D. thesis, Univ. of Melbourne, 1985."},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"J. F. Naughton, \u201cData independent recursion in deductive databases,\u201d Proc. Fifth ACM Symposium on Principles of Database Systems, pp. 267\u2013279, 1986.","DOI":"10.1145\/6012.15420"},{"key":"44_CR13","unstructured":"J. F. Naughton, \u201cOptimizing function-free recursive inference rules,\u201d Dept. of CS, Stanford Univ., to appear."},{"key":"44_CR14","unstructured":"Y. Sagiv and J. D. Ullman, \u201cComplexity of a top-down capture rule,\u201d STAN-CS-84-1009, Stanford Univ., 1984."},{"key":"44_CR15","volume-title":"Principles of Database Systems","author":"J. D. Ullman","year":"1982","unstructured":"J. D. Ullman, Principles of Database Systems, Computer Science Press, Rockville, Md., 1982."},{"issue":"3","key":"44_CR16","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/3979.3980","volume":"10","author":"J. D. Ullman","year":"1985","unstructured":"J. D. Ullman, \u201cImplementation of logical query languages for databases,\u201d ACM Trans. on database Systems 10:3, pp. 289\u2013321, 1985","journal-title":"ACM Trans. on database Systems"},{"key":"44_CR17","unstructured":"J. D. Ullman and A. Van Gelder, \u201cTesting applicability of top-down capture rules,\u201d STAN-CS-1046, Stanford Univ., 1985."},{"key":"44_CR18","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, \u201cA message passing framework for logical query evaluation,\u201d to appear in the proceedings of the 1986 SIGMOD Conf. on Management of Data, May, 1986.","DOI":"10.1145\/16894.16870"},{"key":"44_CR19","unstructured":"A. Van Gelder, \u201cNegation as failure using tight derivations for general logic programs,\u201d unpublished memorandum, Stanford Univ., 1986."},{"issue":"4","key":"44_CR20","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M. H. Emden Van","year":"1976","unstructured":"M. H. Van Emden and R. A. Kowalski, \u201cThe semantics of predicate logic as a programming language,\u201d J. ACM 23:4, pp. 733\u2013742, 1976.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Third International Conference on Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16492-8_104.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:10:34Z","timestamp":1605643834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16492-8_104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164920","9783540398318"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-16492-8_104","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}