{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T14:42:32Z","timestamp":1648996952097},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,4,1]],"date-time":"1996-04-01T00:00:00Z","timestamp":828316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":6318,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1996,4]]},"DOI":"10.1016\/0743-1066(95)00146-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T01:04:03Z","timestamp":1027645443000},"page":"73-87","source":"Crossref","is-referenced-by-count":6,"title":["Matching of bounded set terms in the logic language LDL++"],"prefix":"10.1016","volume":"27","author":[{"given":"Natraj","family":"Arni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Greco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domenico","family":"Sacc\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(95)00146-8_BIB1","series-title":"Proceedings of the 4th International Conference on Database Theory","first-page":"436","article-title":"Set-Term Matching in Logic Programming","author":"Arni","year":"1992"},{"key":"10.1016\/0743-1066(95)00146-8_BIB2","series-title":"Proceedings of the International Conference on Extending Database Technology","first-page":"271","article-title":"COL: A Logic-Based Language for Complex Objects","author":"Abiteboul","year":"1988"},{"issue":"3&4","key":"10.1016\/0743-1066(95)00146-8_BIB3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0743-1066(91)90036-O","article-title":"Set Constructors in a Logic Database Language","volume":"10","author":"Beeri","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(95)00146-8_BIB4","series-title":"Proceedings of the 8th International Conference on Automated Deduction","first-page":"470","article-title":"Unification in the Data Structure Sets","author":"Buttner","year":"1986"},{"key":"10.1016\/0743-1066(95)00146-8_BIB5","series-title":"Proceedings of the 8th International Conference on Logic Programming","first-page":"121","article-title":"[log] A Logic Programming Language with Finite Sets","author":"Dovier","year":"1991"},{"key":"10.1016\/0743-1066(95)00146-8_BIB6","series-title":"Proceedings of the 8th International Conference on Automated Deduction","first-page":"416","article-title":"Associative-Commutative Unification","author":"Fages","year":"1986"},{"key":"10.1016\/0743-1066(95)00146-8_BIB7","series-title":"Proceedings of the Tenth ACM Symposium on Principles of Database Systems","first-page":"37","article-title":"The Expressiveness of a Family of Finite Set Languages","author":"Immerman","year":"1991"},{"key":"10.1016\/0743-1066(95)00146-8_BIB8","series-title":"Proceedings of the Third International Conference on Functional Programming Languages and Computer Architecture","first-page":"194","article-title":"Functional Programming with Sets","author":"Jayaraman","year":"1987"},{"key":"10.1016\/0743-1066(95)00146-8_BIB9","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0743-1066(92)90005-N","article-title":"Implementation of Subset-Equational Programs","volume":"12","author":"Jayaraman","year":"1992","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(95)00146-8_BIB10","series-title":"Proceedings of the 8th International Conference on Automated Deduction","first-page":"489","article-title":"NP-Completeness of the Set Unification and Matching Problems","author":"Kapur","year":"1986"},{"key":"10.1016\/0743-1066(95)00146-8_BIB11","series-title":"Proceedings of the 8th International Conference on Logic in Computer Science","first-page":"11","article-title":"Double-Exponential Complexity of Computing a Complete Set of AC-Unifiers","author":"Kapur","year":"1992"},{"key":"10.1016\/0743-1066(95)00146-8_BIB12","series-title":"Proceedings of the ACM SIGMOD Conference","first-page":"134","article-title":"F-Logic: A Higher-Order Language for Reasoning About Objects, Inheritance and Scheme","author":"Kifer","year":"1989"},{"issue":"1","key":"10.1016\/0743-1066(95)00146-8_BIB13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/62029.62030","article-title":"Unification: A Multidisciplinary Survey","volume":"21","author":"Knight","year":"1989","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0743-1066(95)00146-8_BIB14","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/0022-0000(90)90033-H","article-title":"Logic Programming with Sets","volume":"41","author":"Kuper","year":"1990","journal-title":"J. Computer System Sci."},{"key":"10.1016\/0743-1066(95)00146-8_BIB15","year":"1992","journal-title":"MCC Technical Report"},{"key":"10.1016\/0743-1066(95)00146-8_BIB16","volume":"Vol. 5","year":"1985"},{"key":"10.1016\/0743-1066(95)00146-8_BIB17","series-title":"Proceedings of the 9th International Conference on Automated Deduction","first-page":"358","article-title":"Adventures in Associative-Commutative Unification","author":"Lincoln","year":"1988"},{"key":"10.1016\/0743-1066(95)00146-8_BIB18","article-title":"Unification of A+C-Terms (Bags) and A+C+I-Terms (Sets)","author":"Livesey","year":"1976"},{"key":"10.1016\/0743-1066(95)00146-8_BIB19","series-title":"Foundation of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(95)00146-8_BIB20","series-title":"A Logical Language for Data and Knowledge Bases","author":"Naqvi","year":"1989"},{"key":"10.1016\/0743-1066(95)00146-8_BIB21","series-title":"Proceedings of 18th Conference on Very Large Data Bases","first-page":"238","article-title":"CORAL\u2014Control, Relations and Logic","author":"Ramakrisnhan","year":"1992"},{"issue":"1&2","key":"10.1016\/0743-1066(95)00146-8_BIB22","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0743-1066(92)90040-A","article-title":"Compilation of Set Terms in the Logic Data Language (LDL)","volume":"12","author":"Shmueli","year":"1992","journal-title":"J. Logic Programming"},{"issue":"1","key":"10.1016\/0743-1066(95)00146-8_BIB23","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0747-7171(89)80012-4","article-title":"Unification Theory","volume":"7","author":"Siekmann","year":"1989","journal-title":"J. Symbolic Computation"},{"issue":"3","key":"10.1016\/0743-1066(95)00146-8_BIB24","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/322261.322262","article-title":"A Unification Algorithm for Associative-Commutative Functions","volume":"28","author":"Stickel","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0743-1066(95)00146-8_BIB25","series-title":"Workshop on Logic Programming with Sets","article-title":"An Algorithm for General Set Unification and its Complexity","author":"Stolzenburg","year":"1993"},{"key":"10.1016\/0743-1066(95)00146-8_BIB26","series-title":"Principles of Database and Knowledge-Base Systems","author":"Ullman","year":"1988"},{"key":"10.1016\/0743-1066(95)00146-8_BIB27","series-title":"Proceedings of the 10th ACM Symposium on Principles of Database Systems","first-page":"26","article-title":"On the Power of Rule-Based Languages with Sets","author":"Vadaparty","year":"1991"},{"key":"10.1016\/0743-1066(95)00146-8_BIB28","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0890-5401(92)90075-Q","article-title":"Tight Complexity Bound for Term Matching Problems","volume":"101","author":"Verma","year":"1992","journal-title":"Information and Computation"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106695001468?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106695001468?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T05:26:00Z","timestamp":1555392360000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106695001468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,4]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,4]]}},"alternative-id":["0743106695001468"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(95)00146-8","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1996,4]]}}}