{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:37:57Z","timestamp":1752460677644},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672814"},{"type":"electronic","value":"9783540464211"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10720084_18","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T14:36:30Z","timestamp":1167402990000},"page":"275-289","source":"Crossref","is-referenced-by-count":2,"title":["Comparing Expressiveness of Set Constructor Symbols"],"prefix":"10.1007","author":[{"given":"Agostino","family":"Dovier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla","family":"Piazza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"18_CR1","first-page":"1","volume":"1999","author":"D. Aliffi","year":"1999","unstructured":"Aliffi, D., Dovier, A., Rossi, G.: From set to hyperset unification. Journal of Functional and Logic Programming\u00a01999(10), 1\u201348 (1999)","journal-title":"Journal of Functional and Logic Programming"},{"key":"18_CR2","unstructured":"Arenas-S\u00e1nchez, P., Dovier, A.: A minimality study for set unification. Journal of Functional and Logic Programming\u00a01997(7), 1\u201349 (1997)"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0304-3975(88)90140-5","volume":"56","author":"F. Baader","year":"1988","unstructured":"Baader, F., B\u00fattner, W.: Unification in commutative and idempotent monoids. Theoretical Computer Science\u00a056, 345\u2013352 (1988)","journal-title":"Theoretical Computer Science"},{"key":"18_CR4","unstructured":"Baader, F., Schulz, K.U.: Unification theory. In: Bibel, W., Schmidt, P.H. (eds.) Automated Deduction: A Basis for Applications. Foundations: Calculi and Methods, vol.\u00a01. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.2307\/2268862","volume":"2","author":"P. Bernays","year":"1937","unstructured":"Bernays, P.: A system of axiomatic set theory. Part I. The Journal of symbolic logic\u00a02, 65\u201377 (1937)","journal-title":"The Journal of symbolic logic"},{"key":"18_CR6","series-title":"Int\u2019l Series of Monographs on Computer Science","volume-title":"Computable Set Theory","author":"D. Cantone","year":"1989","unstructured":"Cantone, D., Ferro, A., Omodeo, E.G.: Computable Set Theory. Int\u2019l Series of Monographs on Computer Science, vol.\u00a01. Clarendon Press, Oxford (1989)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/3-540-49019-1_13","volume-title":"Foundations of Software Science and Computation Structures","author":"E. Dantsin","year":"1999","unstructured":"Dantsin, E., Voronkov, A.: A nondeterministic polynomial-time unification algorithm for bags, sets and trees. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol.\u00a01578, pp. 180\u2013196. Springer, Heidelberg (1999)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-58025-5_51","volume-title":"Extensions of Logic Programming","author":"A. Dovier","year":"1994","unstructured":"Dovier, A.: A Language with Finite Sets Embedded in the CLP Scheme. In: Dyckhoff, R. (ed.) ELP 1993. LNCS, vol.\u00a0798, pp. 77\u201393. Springer, Heidelberg (1994)"},{"key":"18_CR9","unstructured":"Dovier, A.: Computable Set Theory and Logic Programming. PhD thesis, Universit\u00e1 degli Studi di Pisa, TD-1\/96 (March 1996)"},{"issue":"1","key":"18_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(95)00147-6","volume":"28","author":"A. Dovier","year":"1996","unstructured":"Dovier, A., Omodeo, E.G., Pontelli, E., Rossi, G.: {log} : A Language for Programming in Logic with Finite Sets. J. of Logic Programming\u00a028(1), 1\u201344 (1996)","journal-title":"J. of Logic Programming"},{"key":"18_CR11","first-page":"40","volume-title":"Proc. of 1998 Joint Int\u2019l Conf. and Symp. on Logic Programming","author":"A. Dovier","year":"1998","unstructured":"Dovier, A., Piazza, C., Pontelli, E., Rossi, G.: On the Representation and Management of Finite Sets in CLP-languages. In: Jaffar, J. (ed.) Proc. of 1998 Joint Int\u2019l Conf. and Symp. on Logic Programming, pp. 40\u201354. The MIT Press, Cambridge (1998)"},{"key":"18_CR12","first-page":"573","volume-title":"ICLP 1999, 16th International Conference on Logic Programming","author":"A. Dovier","year":"1999","unstructured":"Dovier, A., Piazza, C., Pontelli, E., Rossi, G.: ACI1 constraints. In: De Schreye, D. (ed.) ICLP 1999, 16th International Conference on Logic Programming, pp. 573\u2013587. The MIT Press, Cambridge (1999)"},{"issue":"2\/3","key":"18_CR13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.3233\/FI-1998-36235","volume":"36","author":"A. Dovier","year":"1998","unstructured":"Dovier, A., Policriti, A., Rossi, G.: A uniform axiomatic view of lists, multisets and the relevant unification algorithms. Fundamenta Informaticae\u00a036(2\/3), 201\u2013234 (1998)","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1006\/jcss.1996.0042","volume":"52","author":"S. Grumbach","year":"1996","unstructured":"Grumbach, S., Milo, T.: Towards tractable algebras for bags. Journal of Computer and System Sciences\u00a052(3), 570\u2013588 (1996)","journal-title":"Journal of Computer and System Sciences"},{"issue":"37","key":"18_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(98)10002-X","volume":"1-3","author":"J. Jaffar","year":"1998","unstructured":"Jaffar, J., Maher, M., Marriott, K., Stuckey, P.: The semantics of constraint logic programs. Journal of Logic Programming\u00a01-3(37), 1\u201346 (1998)","journal-title":"Journal of Logic Programming"},{"key":"18_CR16","unstructured":"Kunen, K.: Set Theory. An Introduction to Independence Proofs. In: Studies in Logic. North Holland, Amsterdam (1980)"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1002\/cpa.3160480908","volume":"9-10","author":"E.G. Omodeo","year":"1995","unstructured":"Omodeo, E.G., Policriti, A.: Solvable set\/hyperset contexts: I. some decision procedures for the pure, finite case. Communication on Pure and Applied Mathematics\u00a09-10, 1123\u20131155 (1995)","journal-title":"Communication on Pure and Applied Mathematics"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1090\/S0002-9939-1988-0938682-2","volume":"103","author":"F. Parlamento","year":"1988","unstructured":"Parlamento, F., Policriti, A.: The logically simplest form of the infinity axiom. American Mathematical Society\u00a0103, 274\u2013276 (1988)","journal-title":"American Mathematical Society"},{"issue":"1-2","key":"18_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0743-1066(92)90040-A","volume":"12","author":"O. Shmueli","year":"1992","unstructured":"Shmueli, O., Tsur, S., Zaniolo, C.: Compilation of set terms in the logic data language (LDL). Journal of Logic Programming\u00a012(1-2), 89\u2013119 (1992)","journal-title":"Journal of Logic Programming"},{"key":"18_CR20","volume-title":"Mathematical Logic","author":"J.R. Shoenfield","year":"1967","unstructured":"Shoenfield, J.R.: Mathematical Logic. Addison-Wesley, Reading (1967)"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Stolzenburg, F.: An algorithm for general set unification and its complexity. Journal of Automated Reasoning\u00a022 (1999)","DOI":"10.1023\/A:1006019227709"},{"key":"18_CR22","first-page":"14","volume-title":"Proceedings of the 1960 International Congress","author":"R.L. Vaught","year":"1962","unstructured":"Vaught, R.L.: On a Theorem of Cobham Concerning Undecidable Theories. In: Nagel, E., Suppes, P., Tarski, A. (eds.) Proceedings of the 1960 International Congress, pp. 14\u201325. Stanford University Press, Stanford (1962)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10720084_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T15:15:43Z","timestamp":1587309343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10720084_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672814","9783540464211"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/10720084_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}