{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:36:38Z","timestamp":1648553798804},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf01556352","type":"journal-article","created":{"date-parts":[[2005,4,21]],"date-time":"2005-04-21T07:00:24Z","timestamp":1114066824000},"page":"107-127","source":"Crossref","is-referenced-by-count":0,"title":["On the monotonicity of (LDL) logic programs with set"],"prefix":"10.1007","volume":"7","author":[{"given":"G.","family":"Dong","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"S. Abiteboul and S. Grumbach, COL: A language for complex objects based on recursive rules, in:Proc. Int. Workshop on Theory and Applications of Nested Relations and Complex Objects (1987)."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and S. Grumbach, COL: A logic-based language for complex objects, in:Advances in Database Technology ? EDBT '88, Lecture Notes in Computer Science (Springer, 1988).","DOI":"10.1007\/3-540-19074-0_58"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0022-0000(89)90005-6","volume":"38","author":"F. Bancilhon","year":"1989","unstructured":"F. Bancilhon and S. Khoshafian, A calculus for complex objects, J. Comput. Syst. Sci. 38(1989)326?340.","journal-title":"J. Comput. Syst. Sci."},{"key":"CR4","unstructured":"C. Beeri, S. Naqvi, R. Ramakrishnan, O. Shmueli and S. Tsur, Sets and negation in a logic database language (LDL1), in:Proc. PODS (1987) pp. 21?37."},{"key":"CR5","unstructured":"G. Dong and S. Ginsburg, On decomposing chain datalog programs into P (left-)linear sequences of chain rules, Technical report, Melbourne University (1991)."},{"key":"CR6","volume-title":"Introduction to Formal Language Theory","author":"M.A. Harrison","year":"1978","unstructured":"M.A. Harrison,Introduction to Formal Language Theory (Addison-Wesley, Reading, MA, 1978)"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"R. Hull and J. Su, Untyped sets, inventions, and computable queries, a preliminary version of the paper appeared in:Proc. 1989 ACM Symp. on Principles of Database Systems, pp. 347?359; Technical Report, University of Southern California (1989).","DOI":"10.1145\/73721.73755"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"G.M. Kuper, Logic programming with sets, in:Proc. PODS (1987) pp. 11?20; complete version, ref. [10].","DOI":"10.1145\/28659.28661"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"G.M. Kuper, On the expressive power of logic programming languages with sets, in:Proc. PODS (1988) pp. 10?14.","DOI":"10.1145\/308386.308397"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/0022-0000(90)90033-H","volume":"41","author":"G.M. Kuper","year":"1990","unstructured":"G.M. Kuper, Logic programming with sets, J. Comput. Syst. Sci. 41(1990)44?64; extended abstract, ref. [8].","journal-title":"J. Comput. Syst. Sci."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd,Foundations of Logic Programming, 2nd ed. (Springer, 1987).","DOI":"10.1007\/978-3-642-83189-8"},{"key":"CR12","volume-title":"A Logical Language for Data and Knowledge Bases","author":"S. Naqvi","year":"1989","unstructured":"S. Naqvi and S. Tsur,A Logical Language for Data and Knowledge Bases (Computer Science Press, New York, 1989)."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"O. Shmueli, S. Tsur and C. Zaniolo, Rewriting of rules containing set terms in a logic data language (LDL), in:Proc. PODS (1988).","DOI":"10.1145\/308386.308400"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01762108","volume":"3","author":"J.D. Ullman","year":"1988","unstructured":"J.D. Ullman and A. Van Gelder, Parallel complexity of logical query programs, Algorithmica 3(1988)5?42.","journal-title":"Algorithmica"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01556352.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01556352\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01556352","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T01:22:54Z","timestamp":1586222574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01556352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":14,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01556352"],"URL":"https:\/\/doi.org\/10.1007\/bf01556352","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}