{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:27:54Z","timestamp":1725456474907},"publisher-location":"Berlin\/Heidelberg","reference-count":26,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354057235X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013178","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:23:18Z","timestamp":1132730598000},"page":"192-215","source":"Crossref","is-referenced-by-count":2,"title":["Decision procedures for set\/hyperset contexts"],"prefix":"10.1007","author":[{"given":"Eugenio G.","family":"Omodeo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Vol 14, Lecture Notes","volume-title":"Non-well-founded sets","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":"16_CR2","unstructured":"J. Barwise, J. Etchemendy. The liar: an essay on truth and circular propositions. Oxford University Press, 1987."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(88)90115-6","volume":"60","author":"M. Beeson","year":"1988","unstructured":"M. Beeson. Towards a computation system based on set theory. Theoretical Computer Science 60, 297\u2013340, 1988.","journal-title":"Theoretical Computer Science"},{"key":"16_CR4","unstructured":"S. Baratella, R. Ferro. A theory of sets with the negation of the axiom of infinity. AILA preprints n.8, 1991."},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/cpa.3160340203","volume":"34","author":"M. Breban","year":"1981","unstructured":"M. Breban, A. Ferro, E.G. Omodeo, J.T. Schwartz. Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions. Comm. on Pure and Appl. Mathematics, 34, 177\u2013195, 1981.","journal-title":"Comm. on Pure and Appl. Mathematics"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF02328452","volume":"2","author":"R. Boyer","year":"1986","unstructured":"R. Boyer, E. Lusk, W. McCune, R. Overbeek, M. Stickel, L. Wos. Set theory in first-order logic: Clauses for G\u00f6del's axioms. J. of Automated Reasoning, 2, 289\u2013327, 1986.","journal-title":"J. of Automated Reasoning"},{"key":"16_CR7","series-title":"International Series of Monographs on Computer Science","volume-title":"Computable set theory","author":"D. Cantone","year":"1989","unstructured":"D. Cantone, A. Ferro, E.G. Omodeo. Computable set theory, 1st vol. Clarendon Press, Oxford, International Series of Monographs on Computer Science, 1989."},{"issue":"1","key":"16_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0747-7171(88)80023-3","volume":"6","author":"D. Cantone","year":"1988","unstructured":"D. Cantone, S. Ghelfo, E.G. Omodeo. The automation of syllogistic. I. Syllogistic normal forms. J. of Symbolic Computation, 6(1), 83\u201398, 1988.","journal-title":"J. of Symbolic Computation"},{"issue":"2","key":"16_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00245817","volume":"6","author":"D. Cantone","year":"1990","unstructured":"D. Cantone, E.G. Omodeo, A. Policriti. The automation of syllogistic. II. Optimization and complexity issues. J. of Automated Reasoning, Kluwer Academic Publishers, 6(2), 173\u2013187, 1990.","journal-title":"J. of Automated Reasoning, Kluwer Academic Publishers"},{"key":"16_CR10","unstructured":"B. Dreben, W. D. Goldfarb. The decision problem: solvable classes of quantificational formulas. Addison-Wesley, 1979."},{"key":"16_CR11","unstructured":"R. Dionne, E. Mays, F.J. Oles. A non-well-founded approach to terminological cycles. Proceedings of AAAI-92, San Jose, Cal."},{"key":"16_CR12","unstructured":"R. Dionne, E. Mays, F.J. Oles. The equivalence of model-theoretic and structural subsumption in description logics. To appear in the proceedings of IJCAI-93."},{"key":"16_CR13","first-page":"111","volume-title":"ICLP'91","author":"A. Dovier","year":"1991","unstructured":"A. Dovier, E.G. Omodeo, E. Pontelli, G. Rossi. {log}: a logic programming language with finite sets. In K. Furukawa ed., Logic Programming, Proceedings of the Eighth International Conference (ICLP'91, Paris), The MIT Press, 111\u2013124, 1991."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"A. Dovier, E.G. Omodeo, E. Pontelli, G.-F. Rossi. Embedding finite sets in a logic programming language. In E. Lamma, P. Mello eds, Extensions of Logic Programming, Volume 660 of Lecture Notes in Artificial Intelligence, 150\u2013167, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56454-3_8"},{"key":"16_CR15","first-page":"493","volume":"10","author":"M. Forti","year":"1983","unstructured":"M. Forti, F. Honsell. Set theory with free construction principles. Annali Scuola Normale Superiore di Pisa, Cl. Sc. (IV)10, 493\u2013522, 1983.","journal-title":"Annali Scuola Normale Superiore di Pisa, Cl. Sc. (IV)"},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1002\/cpa.3160330503","volume":"33","author":"A. Ferro","year":"1980","unstructured":"A. Ferro, E.G. Omodeo, J.T. Schwartz. Decision procedures for elementary sublanguages of set theory. I. Multi-level syllogistic and some extensions. Communications on Pure and Applied Mathematics, 33, 599\u2013608, 1980.","journal-title":"Communications on Pure and Applied Mathematics"},{"key":"16_CR17","volume-title":"A series of books in the mathematical sciences","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey, D.S. Johnson. Computers and intractability \u2014 A Guide to the theory of NP-Completeness. W.H. Freeman and Co., New York, A series of books in the mathematical sciences, 1979."},{"key":"16_CR18","unstructured":"J. v. Heijenoort, editor. From Frege to G\u00f6del \u2014 A source book in mathematical logic, 1879\u20131931. Harvard University Press, Source books in the history of the sciences, 3rd printing, 1977."},{"key":"16_CR19","unstructured":"J.P. Jouannaud, C. Kirchner. Solving equations in abstract algebras: a rule-based survey of unification. In J.-L. Lassez, G. Plotkin eds., Alan Robinson's anniversary book, 1991."},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag series Symbolic Computation \u2014 Artificial Intelligence, 2nd edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"16_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4385-2","volume-title":"A course in mathematical logic","author":"Y. Manin","year":"1977","unstructured":"Yu.I. Manin. A course in mathematical logic. Springer-Verlag, New York, 1977."},{"issue":"2","key":"16_CR22","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"A. Martelli, U. Montanari. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(2), 258\u2013282, 1982.","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"16_CR23","unstructured":"E.G. Omodeo, F. Parlamento, A. Policriti. Decidability of \u2203*\u2200-sentences in membership theories. University of Udine Research Report Nr.6, May 1992."},{"key":"16_CR24","unstructured":"E.G. Omodeo, F. Parlamento, A. Policriti. A derived algorithm for evaluating \u03b5-expressions over sets. Univ. of Rome \u201cLa Sapienza\u201d-D.I.S., Rep.07.92 May 1992. (To appear on the J. of Symbolic Computation, special issue on automatic programming)."},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"J.T. Schwartz, R.K.B. Dewar, E. Dubinsky, E. Schonberg. Programming with sets- An introduction to SETL. Texts and Monographs in Computer Science, Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4613-9575-1"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"J.H. Siekmann. Unification Theory. A Survey. J. of Simbolic Computation, 1989. Special Issue on Unification. 7(3,4) 8(1\u20135).","DOI":"10.1016\/S0747-7171(89)80012-4"}],"container-title":["Lecture Notes in Computer Science","Design and Implementation of Symbolic Computation Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:31:59Z","timestamp":1586579519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354057235X"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0013178","relation":{},"subject":[]}}