{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:25Z","timestamp":1725663565341},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564546"},{"type":"electronic","value":"9783540475620"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56454-3_8","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:11:05Z","timestamp":1330254665000},"page":"150-167","source":"Crossref","is-referenced-by-count":5,"title":["Embedding finite sets in a logic programming language"],"prefix":"10.1007","author":[{"given":"Agostino","family":"Dovier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugenio G.","family":"Omodeo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianfranco","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"8_CR1","volume-title":"Vol.14, Lecture Notes","author":"P. Aczel","year":"1988","unstructured":"P.Aczel. Non-well-founded sets. Vol.14, Lecture Notes, Center for the study of Language and Information, Stanford, 1988."},{"key":"8_CR2","unstructured":"A.Aho, J.Hopcroft, J.Ullman. The design and analysis of computer algorithms. Addison-Wesley, 1975."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"C.Beeri, S.Naqvi et al. Set and negation in a Logic Database Language (LDL1). Proceedings 6th ACM SIGMOD Symposium, 1987.","DOI":"10.1145\/28659.28662"},{"key":"8_CR4","unstructured":"D.Cantone, A.Ferro, E.G.Omodeo. Computable set Theory. Oxford University Press, International Series of Monographs on Computer Science, 1989."},{"key":"8_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-94710-9","volume-title":"Software Prototyping mit SETL","author":"E. E. Doberkat","year":"1989","unstructured":"E.E.Doberkat, D.Fox. Software Prototyping mit SETL. B.G.Teubner Stuttgart, 1989."},{"key":"8_CR6","unstructured":"A.Dovier, E.G.Omodeo, E.Pontelli, G.F.Rossi. {log}: A Logic Programming Language with Finite Sets, in Logic Programming: Proceedings of the Eighth International Conference (K.Furukawa, ed.), The MIT Press, 1991."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"A.Dovier, E.G.Omodeo, E.Pontelli, G.F.Rossi. {log}: A Language for Programming in Logic with Finite Sets, Research Report, in preparation.","DOI":"10.1016\/0743-1066(95)00147-6"},{"key":"8_CR8","unstructured":"H.B.Enderton. A mathematical introduction to logic. Academic Press, 2nd printing, 1973."},{"key":"8_CR9","unstructured":"B.Jayaraman, D.A.Plaisted. Programming with Equations, Subsets and Relations. Proceedings of NACLP89, Cleveland, 1989."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"J.Jaffar, J.L.Lassez. From Unification to Constraints. Proceedings Fifth Conference on Logic Programming, Tokyo, 1987.","DOI":"10.1145\/41625.41635"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"G.M.Kuper. Logic Programming with Sets. Proceedings 6th ACM SIGMOD Symposium, 1987.","DOI":"10.1145\/28659.28661"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"G.M.Kuper. On the Expressive Power of Logic Programming with Sets. Proceedings 7th ACM SIGMOD Symposium, 1988.","DOI":"10.1145\/308386.308397"},{"key":"8_CR13","volume-title":"CLPS: A Set Constraints Logic Programming Language. Research Report","author":"B. Legeard","year":"1991","unstructured":"B.Legeard, E.Legros. CLPS: A Set Constraints Logic Programming Language. Research Report, Laboratoire d'Automatique de Besan\u00e7on, Institut de Productique, Besan\u00e7on, France, Feb. 1991."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"J.W.Lloyd Foundations of logic programming. Springer Verlag, 2nd edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"8_CR15","unstructured":"J.L.Lassez, M.J.Maher, K.Marriot. Unification revisited. Lecture Notes in Computer Science, Vol. 306, Springer Verlag, 1986."},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"A.Martelli, U.Montanari. An efficient unification algorithm. ACM TOPLAS, 4, April 1982.","DOI":"10.1145\/357162.357169"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"A.Martelli, C.Moiso, G.F.Rossi. Lazy Unification Algorithms for Canonical Rewrite Systems, in Resolution of Equations in Algebraic Structures, vol II (H.Ait-Kaci and M.Nivat, eds), Academic Press, 1989.","DOI":"10.1016\/B978-0-12-046371-8.50014-6"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"M.Naftalin. An experiment in practical semantics. ESOP 86 \u2014Lecture Notes in Computer Science, Vol. 213, Springer Verlag, 1986.","DOI":"10.1007\/3-540-16442-1_11"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"F.Parlamento, A.Policriti. Decision procedures for elementary sublanguages of set theory. IX. Unsolvability of the decision problem for a restricted subclass of \u03940-formulas in set theory. Communications of Pure and Applied Mathematics, 41, 1988.","DOI":"10.1002\/cpa.3160410206"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"F.Parlamento, A.Policriti. Expressing infinity without foundation. Journal of Symbolic Logic, 56(3), 1991.","DOI":"10.2307\/2275470"},{"key":"8_CR21","volume-title":"Foundations of deductive databases and Logic Programming","author":"J. C. Shepherdson","year":"1987","unstructured":"J.C.Shepherdson. Negation in Logic Programming. In Foundations of deductive databases and Logic Programming (J.Minker, ed). Morgan Kaufmann, Los Altos, CA, 1987."},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"J.H.Siekmann. Unification Theory. Journal of Symbolic Computation, 7, 1989.","DOI":"10.1016\/S0747-7171(89)80012-4"},{"key":"8_CR23","unstructured":"R.Sigal. Desiderata for Logic Programming with sets. Proceedings GULP89: Fourth National Conference on Logic Programming, Bologna, 1989."},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"J.T.Schwartz, R.B.K.Dewar, E.Dubinsky, E.Schonberg. Programming with sets, an introduction to SETL. Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4613-9575-1"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"D.Turner. An overview of Miranda. SIGPLAN Notices, Vol.21, n.12, 1986.","DOI":"10.1145\/15042.15053"},{"key":"8_CR26","unstructured":"Z handbook, Oxford University Computing Laboratory, Oxford 1986."}],"container-title":["Lecture Notes in Computer Science","Extensions of Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56454-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:53Z","timestamp":1605647033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56454-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540564546","9783540475620"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-56454-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}