{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:19Z","timestamp":1725663919889},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540540090"},{"type":"electronic","value":"9783540473480"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54009-1_15","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:21:32Z","timestamp":1330208492000},"page":"201-215","source":"Crossref","is-referenced-by-count":0,"title":["On the monotonicity of (LDL) logic programs with set"],"prefix":"10.1007","author":[{"given":"G.","family":"Dong","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"15_CR1","unstructured":"S. Abiteboul and S. Grumbach. COL: A language for complex objects based on recursive rules. In Proc. Int's Workshop on Theory and Applications of Nested Relations and Complex Objects, 1987."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and S. Grumbach. COL: A logic-based language for complex objects. In Advances in Database Technology \u2014 EDBT, LNCS, 1988.","DOI":"10.1007\/3-540-19074-0_58"},{"issue":"2","key":"15_CR3","first-page":"326","volume":"38","author":"F. Bancilhon","year":"1989","unstructured":"F. Bancilhon and S. Khoshafian. A calculus for complex objects. JCSS, 38(2):326\u2013340, 1989.","journal-title":"JCSS"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"C. Beeri, S. Naqvi, R. Ramakrishnan, O. Shmueli, and S. Tsur. Sets and negation in a logic database language (LDL1). In Proc. PODS, pages 21\u201337, 1987.","DOI":"10.1145\/28659.28662"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"R. Hull and J. Su. Untyped sets, inventions, and computable queries, In Proc. PODS, pages 347\u2013359, 1989.","DOI":"10.1145\/73721.73755"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"G. M. Kuper. Logic programming with sets. In Proc. PODS, pages 11\u201320, 1987.","DOI":"10.1145\/28659.28661"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"G. M. Kuper. On the expressive power of logic programming languages with sets. In Proc. PODS, pages 10\u201314, 1988.","DOI":"10.1145\/308386.308397"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-96826-6"},{"key":"15_CR9","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":"15_CR10","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"}],"container-title":["Lecture Notes in Computer Science","MFDBS 91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54009-1_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:51:57Z","timestamp":1605646317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54009-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540090","9783540473480"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-54009-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}