{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T02:50:39Z","timestamp":1781059839797,"version":"3.54.1"},"reference-count":55,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":6227,"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,7]]},"DOI":"10.1016\/0743-1066(95)00147-6","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"1-44","source":"Crossref","is-referenced-by-count":63,"title":["{log}: A language for programming in logic with finite sets"],"prefix":"10.1016","volume":"28","author":[{"given":"Agostino","family":"Dovier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eugenio G.","family":"Omodeo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gianfranco","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0743-1066(95)00147-6_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/103140.103141","article-title":"A Rule-Based Language with Functions and Sets","volume":"16","author":"Abiteboul","year":"1991","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/0743-1066(95)00147-6_BIB2","article-title":"Non-Well-Founded Sets","volume":"Vol. 14","author":"Aczel","year":"1988"},{"key":"10.1016\/0743-1066(95)00147-6_BIB3","series-title":"Proc. of the Intl. Symp. DISCO'90","article-title":"AC-Unification Race: The System Solving Approach and Its Implementation","volume":"Vol. 429","author":"Adi","year":"1990"},{"key":"10.1016\/0743-1066(95)00147-6_BIB4","series-title":"Warren's Abstract Machine\u2014A Tutorial Reconstruction","author":"A\u00eft-Kaci","year":"1991"},{"issue":"4","key":"10.1016\/0743-1066(95)00147-6_BIB5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF03028340","article-title":"Hypersets","volume":"13","author":"Barwise","year":"1991","journal-title":"The Mathematical Intelligencer"},{"key":"10.1016\/0743-1066(95)00147-6_BIB6","series-title":"Proceedings of the 6th ACM SIGMOD Symposium","article-title":"Sets and Negation in a Logic Database Language (LDL1)","author":"Beeri","year":"1987"},{"issue":"3","key":"10.1016\/0743-1066(95)00147-6_BIB7","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)00147-6_BIB8","series-title":"Proceeding of the 11th International Conference on Logic Programming","article-title":"Compiling Intensional Sets in CLP","author":"Bruscoli","year":"1994"},{"key":"10.1016\/0743-1066(95)00147-6_BIB9","series-title":"A Resolution Principle for a Logic with Restricted Quantifiers","author":"Burckert","year":"1991"},{"key":"10.1016\/0743-1066(95)00147-6_BIB10","series-title":"Proceedings of the 8th International Conference on Automated Deduction","article-title":"Unification in the datastructure sets","volume":"Vol. 230","author":"B\u00fcttner","year":"1986"},{"key":"10.1016\/0743-1066(95)00147-6_BIB11","volume":"Vol. 1","author":"Cantone","year":"1989"},{"issue":"3","key":"10.1016\/0743-1066(95)00147-6_BIB12","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0743-1066(89)90020-4","article-title":"A completeness Theorem for SLDNF-Resolution","volume":"7","author":"Cavedon","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(95)00147-6_BIB13","series-title":"Proceedings of the North American Conference on Logic Programming'89","article-title":"Constructive Negation Based on the Completed Database","author":"Chan","year":"1989"},{"key":"10.1016\/0743-1066(95)00147-6_BIB14","series-title":"Logic and Data Bases","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/0743-1066(95)00147-6_BIB15","series-title":"Proceedings of the 2nd International Conference on Fifth Generation Computer Systems","article-title":"The Constraint Logic Programming Language CHIP","author":"Dincbas","year":"1988"},{"key":"10.1016\/0743-1066(95)00147-6_BIB16","series-title":"Proceedings of the 8th International Conference on Logic Programming","article-title":"{log}: A Logic Programming Language with Finite Sets","author":"Dovier","year":"1991"},{"key":"10.1016\/0743-1066(95)00147-6_BIB17","series-title":"Proceedings of the 3rd Workshop on Extensions of Logic Programming 1992","article-title":"Embedding Finite Sets in a Logic Programming Language","volume":"Vol. 660","author":"Dovier","year":"1993"},{"key":"10.1016\/0743-1066(95)00147-6_BIB18","series-title":"GULP-PRODE'94: Joint Conference on Declarative Programming","article-title":"Solving Systems of Equations Over Hypersets","author":"Dovier","year":"1994"},{"key":"10.1016\/0743-1066(95)00147-6_BIB19","article-title":"La Programmazione Logica con Insiemi","author":"Dovier","year":"1991"},{"key":"10.1016\/0743-1066(95)00147-6_BIB20","series-title":"Proceedings of the Programming Language Implementations and Logic Programming'93","article-title":"A WAM Implementation of a Logic Programming Language with Sets","volume":"Vol. 714","author":"Dovier","year":"1993"},{"key":"10.1016\/0743-1066(95)00147-6_BIB21","article-title":"The CLP Language {log}, and the Relation Between Intensional Sets and Negation","author":"Dovier","year":"1995"},{"key":"10.1016\/0743-1066(95)00147-6_BIB22","series-title":"Proceedings of the 4th International Logic Programming Symposium","article-title":"Embedding Extensional Finite Sets in CLP","author":"Dovier","year":"1993"},{"key":"10.1016\/0743-1066(95)00147-6_BIB23","series-title":"A Mathematical Introduction to Logic","author":"Enderton","year":"1973"},{"key":"10.1016\/0743-1066(95)00147-6_BIB24","series-title":"Presented at the workshop on programming in G\u00f6del","article-title":"Adding Sets and Multisets to G\u00f6del","author":"Fogli","year":"1994"},{"key":"10.1016\/0743-1066(95)00147-6_BIB25","series-title":"Proceedings of the 1994 International Symposium on Logic Programming","article-title":"Conjunto: Constraint Logic Programming with Finite Set Domains","author":"Gervet","year":"1994"},{"key":"10.1016\/0743-1066(95)00147-6_BIB26","series-title":"The G\u00f6del Programming Language","author":"Hill","year":"1994"},{"key":"10.1016\/0743-1066(95)00147-6_BIB27","series-title":"Proceedings of the 5th Conference on Logic Programming","article-title":"From Unification to Constraints","author":"Jaffar","year":"1987"},{"key":"10.1016\/0743-1066(95)00147-6_BIB28","series-title":"Proceedings of the North American Conference on Logic Programming'89","article-title":"Programming with Equations, Subsets and Relations","author":"Jayaraman","year":"1989"},{"issue":"4","key":"10.1016\/0743-1066(95)00147-6_BIB29","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)00147-6_BIB30","series-title":"Set Theory","author":"Jech","year":"1978"},{"key":"10.1016\/0743-1066(95)00147-6_BIB31","series-title":"Proceedings of the 8th International Conference on Automated Deduction","article-title":"NP-Completeness of the Set Unification and Matching Problems","volume":"Vol. 230","author":"Kapur","year":"1986"},{"key":"10.1016\/0743-1066(95)00147-6_BIB32","series-title":"Proceedings of the 7th ACM SIGMOD Symposium","article-title":"On the Expressive Power of Logic Programming with Sets","author":"Kuper","year":"1988"},{"issue":"1","key":"10.1016\/0743-1066(95)00147-6_BIB33","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. Comput. Syst. Sci."},{"key":"10.1016\/0743-1066(95)00147-6_BIB34","series-title":"Foundations of Logic and Functional Programming","article-title":"Unification Revisited","volume":"Vol. 306","author":"Lassez","year":"1986"},{"key":"10.1016\/0743-1066(95)00147-6_BIB35","article-title":"CLPS: A Set Constraints Logic Programming Language","author":"Legeard","year":"1991"},{"key":"10.1016\/0743-1066(95)00147-6_BIB36","article-title":"Tests de Satisfiabilit\u00e9 dans un Language de Programmation en Logique avec Contraintes Ensemblistes","author":"Legros","year":"1993"},{"key":"10.1016\/0743-1066(95)00147-6_BIB37","article-title":"Unification of Sets and Multisets","author":"Livesey","year":"1976"},{"key":"10.1016\/0743-1066(95)00147-6_BIB38","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(95)00147-6_BIB39","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An Efficient Unification Algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM TOPLAS"},{"issue":"3","key":"10.1016\/0743-1066(95)00147-6_BIB40","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/131295.131300","article-title":"Notes on Implementing Sets in Prolog","volume":"35","author":"Munakata","year":"1992","journal-title":"Communications of the ACM"},{"key":"10.1016\/0743-1066(95)00147-6_BIB41","article-title":"An Experiment in Practical Semantics","volume":"Vol. 213","author":"Naftalin","year":"1986"},{"key":"10.1016\/0743-1066(95)00147-6_BIB42","series-title":"A Logical Language for Data and Knowledge Bases","author":"Naqvi","year":"1989"},{"key":"10.1016\/0743-1066(95)00147-6_BIB43","series-title":"Linear Unification","author":"Paterson","year":"1976"},{"key":"10.1016\/0743-1066(95)00147-6_BIB44","article-title":"Logic Programming with Sets: Theory and Implementation","author":"Pontelli","year":"1992"},{"key":"10.1016\/0743-1066(95)00147-6_BIB45","series-title":"An Introduction to SETL","article-title":"Programming with Sets","author":"Schwartz","year":"1986"},{"key":"10.1016\/0743-1066(95)00147-6_BIB46","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Negation in Logic Programming","author":"Shepherdson","year":"1987"},{"issue":"1","key":"10.1016\/0743-1066(95)00147-6_BIB47","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)00147-6_BIB48","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 Comput."},{"key":"10.1016\/0743-1066(95)00147-6_BIB49","series-title":"Proceedings of the GULP89: 4th National Conference on Logic Programming","article-title":"Desiderata for Logic Programming with Sets","author":"Sigal","year":"1989"},{"key":"10.1016\/0743-1066(95)00147-6_BIB50","author":"Spivey","year":"1992"},{"issue":"3","key":"10.1016\/0743-1066(95)00147-6_BIB51","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. of the ACM"},{"key":"10.1016\/0743-1066(95)00147-6_BIB52","series-title":"Proceedings of the 6th IEEE Symposium on Logic in Computer Science","article-title":"Constructive Negation for Constraint Logic Programming","author":"Stuckey","year":"1991"},{"issue":"12","key":"10.1016\/0743-1066(95)00147-6_BIB53","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/15042.15053","article-title":"An Overview of Miranda","volume":"21","author":"Turner","year":"1986","journal-title":"SIGPLAN Not."},{"key":"10.1016\/0743-1066(95)00147-6_BIB54","volume":"Vols. 1 and 2","author":"Ullman","year":"1989"},{"issue":"3","key":"10.1016\/0743-1066(95)00147-6_BIB55","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/131295.131299","article-title":"Memoing for Logic Programs","volume":"35","author":"Warren","year":"1992","journal-title":"Communications of the ACM"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106695001476?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106695001476?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T10:21:57Z","timestamp":1555410117000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106695001476"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0743106695001476"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(95)00147-6","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}