{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:28:15Z","timestamp":1725564495941},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207801"},{"type":"electronic","value":"9783540246152"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24615-2_5","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T11:29:48Z","timestamp":1283686188000},"page":"87-106","source":"Crossref","is-referenced-by-count":1,"title":["An Environment for Specifying Properties of Dyadic Relations and Reasoning about Them I: Language Extension Mechanisms"],"prefix":"10.1007","author":[{"given":"Pasquale","family":"Caianiello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefania","family":"Costantini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugenio G.","family":"Omodeo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)"},{"key":"5_CR2","volume-title":"Compilers - Principles, techniques and tools","author":"A.V. Aho","year":"1986","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers - Principles, techniques and tools. Addison-Wesley, Reading (1986)(reprinted)"},{"key":"5_CR3","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7160.001.0001","volume-title":"Warren\u2019s Abstract Machine - A Tutorial Reconstruction","author":"H. A\u00eft Kaci","year":"1991","unstructured":"A\u00eft Kaci, H.: Warren\u2019s Abstract Machine - A Tutorial Reconstruction. The MIT Press, Cambridge (1991)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Formal Methods in Programming and Their Applications","year":"1993","unstructured":"Bj\u00f8rner, D., Broy, M., Pottosin, I.V. (eds.): FMP&TA 1993. LNCS, vol.\u00a0735. Springer, Heidelberg (1993)"},{"key":"5_CR5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-94-009-6259-0_2","volume-title":"Handbook of Philosophical Logic","author":"J.P. Burgess","year":"1984","unstructured":"Burgess, J.P.: Basic tense logic. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol.\u00a0II, pp. 89\u2013133. D. Reidel, Dordrecht (1984)"},{"key":"5_CR6","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Automated Deduction in Classical and Non-Classical Logics","year":"2000","unstructured":"Caferra, R., Salzer, G. (eds.): FTP 1998. LNCS (LNAI), vol.\u00a01761. Springer, Heidelberg (2000)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Cantone, D., Formisano, A., Omodeo, E.G., Zarba, C.G.: Compiling dyadic first-order specifications into map algebra. Theoretical Computer Science\u00a0303 (2002)","DOI":"10.1016\/S0304-3975(01)00355-3"},{"key":"5_CR8","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3452-2","volume-title":"Set Theory for Computing - From decision procedures to declarative programming with sets","author":"D. Cantone","year":"2001","unstructured":"Cantone, D., Omodeo, E.G., Policriti, A.: Set Theory for Computing - From decision procedures to declarative programming with sets. Texts and Monographs in Computer Science. Springer, Berlin (2001)"},{"issue":"2","key":"5_CR9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1093\/logcom\/12.2.301","volume":"12","author":"F. Corradini","year":"2002","unstructured":"Corradini, F., De Nicola, R., Labella, A.: An equational axiomatization of bisimulation over regular expressions. J. Logic and Comput.\u00a012(2), 89\u2013108 (2002)","journal-title":"J. Logic and Comput."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-36280-0_4","volume-title":"Relational Methods in Computer Science","author":"E.-E. Doberkat","year":"2002","unstructured":"Doberkat, E.-E., Omodeo, E.G.: Algebraic semantics of ER-models in the context of the calculus of relations. In: de Swart, H. (ed.) RelMiCS 2001. LNCS, vol.\u00a02561, pp. 50\u201365. Springer, Heidelberg (2002)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Doberkat, E.-E., Omodeo, E.G.: ER modelling from first relational principles. Theoretical Computer Science (to appear)","DOI":"10.1016\/j.tcs.2003.09.001"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Formisano, A., Omodeo, E.: An equational re-engineering of set theories. In: Caferra and Salzer [6], pp. 175\u2013190","DOI":"10.1007\/3-540-46508-1_12"},{"key":"5_CR13","unstructured":"Formisano, A., Omodeo, E.G., Simeoni, M.: A graphical approach to relational reasoning. In: Kahl, W., Parnas, D.L., Schmidt, G. (eds.) Proc. of Relational Methods in Software, RelMiS 2001, Bericht No.2001-02. Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t der Bundeswehr Muenchen (April 2001), To appear on Electronic Notes in Theoretical Computer Science 44(3)"},{"key":"#cr-split#-5_CR14.1","doi-asserted-by":"crossref","unstructured":"Formisano, A., Omodeo, E.G., Temperini, M.: Goals and benchmarks for automated map reasoning. J. Symb. Computation??29(2), 259???297 (2000);","DOI":"10.1006\/jsco.1999.0362"},{"key":"#cr-split#-5_CR14.2","unstructured":"Special issue on Bonacina, M.-P., Furbach, U. (eds.) Advances in First-order Theorem Proving"},{"key":"5_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-45744-5_12","volume-title":"Automated Reasoning","author":"A. Formisano","year":"2001","unstructured":"Formisano, A., Omodeo, E.G., Temperini, M.: Instructing equational setreasoning with Otter. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 152\u2013167. Springer, Heidelberg (2001)"},{"key":"5_CR16","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"1","volume-title":"Declarative Programming \u2013 Selected Papers from AGP 2000","author":"A. Formisano","year":"2001","unstructured":"Formisano, A., Omodeo, E.G., Temperini, M.: Layered map reasoning: An experimental approach put to trial on sets. In: Dovier, A., Meo, M.-C., Omicini, A. (eds.) Declarative Programming \u2013 Selected Papers from AGP 2000. Electronic Notes in Theoretical Computer Science, vol.\u00a048, pp. 1\u201328. Elsevier Science B. V., Amsterdam (2001)"},{"key":"5_CR17","doi-asserted-by":"publisher","DOI":"10.1142\/9789812777928","volume-title":"Fork algebras in Algebra, Logic, and Computer Science","author":"M.F. Frias","year":"2002","unstructured":"Frias, M.F.: Fork algebras in Algebra, Logic, and Computer Science. World Scientific Publishing Co., Singapore (2002)"},{"issue":"1-2","key":"5_CR18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/11663081.1998.10510932","volume":"8","author":"M.F. Frias","year":"1998","unstructured":"Frias, M.F., Or\u0142owska, E.: Equational reasoning in non cassical logics. Journal of Applied Non Classical Logics\u00a08(1-2), 27\u201366 (1998)","journal-title":"Journal of Applied Non Classical Logics"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Haeberer, A.M., Baum, G.A., Schmidt, G.: On the smooth calculation of relational recursive expressions out of first-order non-constructive specifications involving quantifiers. In: Bj\u00f8rner et al. [4], pp. 281\u2013298","DOI":"10.1007\/BFb0039715"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Knuth, D.E., Bendix, P.B.: Simple word problems for universal algebras. In: Leech, J. (ed.) Computational problems in abstract algebra, pp. 263\u2013297 (1970)","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"5_CR21","series-title":"Pure and Applied Mathematics","volume-title":"A Theory of Sets","author":"A.P. Morse","year":"1965","unstructured":"Morse, A.P.: A Theory of Sets. Pure and Applied Mathematics. Academic Press, New York (1965)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Omodeo, E.G., Doberkat, E.-E.: Algebraic semantics of ER-models in the context of the calculus of relations. I: Static view. In: Kahl, W., Parnas, D.L., Schmidt, G. (eds.) Proc. of Relational Methods in Software, RelMiS 2001, Bericht No.2001-02. Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t der Bundeswehr Muenchen (April 2001), To appear on Electronic Notes in Theoretical Computer Science 44(3)","DOI":"10.1016\/S1571-0661(04)80935-6"},{"key":"5_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-45632-5_9","volume-title":"Computational Logic: Logic Programming and Beyond","author":"E.G. Omodeo","year":"2002","unstructured":"Omodeo, E.G., Schwartz, J.T.: A \u2018theory\u2019 mechanism for a proof-verifier based on first-order set theory. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol.\u00a02408, pp. 214\u2013230. Springer, Heidelberg (2002)"},{"key":"5_CR24","first-page":"443","volume-title":"Algebraic Logic. Colloquia Mathematica Societatis Janos Bolyai","author":"E. Or\u0142owska","year":"1988","unstructured":"Or\u0142owska, E.: Relational interpretation of modal logics. In: Andreka, H., Monk, D., Nemeti, I. (eds.) Algebraic Logic. Colloquia Mathematica Societatis Janos Bolyai, vol.\u00a054, pp. 443\u2013471. North-Holland, Amsterdam (1988)"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Or\u0142owska, E.: Relational semantics for nonclassical logics: Formulas are relations. In: Wolenski, J. (ed.) Philosophical Logic in Poland, pp. 167\u2013186 (1994)","DOI":"10.1007\/978-94-015-8273-5_11"},{"key":"5_CR26","series-title":"PWN","volume-title":"The mathematics of metamathematics","author":"H. Rasiowa","year":"1963","unstructured":"Rasiowa, H., Sikorski, R.: The mathematics of metamathematics. PWN, vol.\u00a012. Polish Scientific Publishers, Warsaw (1963)"},{"key":"5_CR27","series-title":"Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-77968-8","volume-title":"Relations and graphs","author":"G. Schmidt","year":"1993","unstructured":"Schmidt, G., Str\u00f6hlein, T.: Relations and graphs. Monographs on Theoretical Computer Science. Springer, Berlin (1993)"},{"key":"5_CR28","series-title":"Colloquium Publications","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/041","volume-title":"A formalization of Set Theory without variables","author":"A. Tarski","year":"1987","unstructured":"Tarski, A., Givant, S.: A formalization of Set Theory without variables. Colloquium Publications, vol.\u00a041. American Mathematical Society, Providence (1987)"},{"key":"5_CR29","unstructured":"Ullman, J.D.: Database and Knowledge-base Systems. Principles of Computer Science, vol.\u00a01, vol. 49. Computer Science Press, Stanford University (1988)"},{"key":"5_CR30","unstructured":"Van Roy, P.L.: Can Logic Programming Execute as Fast as Imperative Programming? Ph.D. thesis, Univ. of California at Berkeley (1990)"},{"key":"5_CR31","first-page":"52","volume":"20","author":"P.A.S. Veloso","year":"1991","unstructured":"Veloso, P.A.S., Haeberer, A.M.: A finitary relational algebra for classical first-order logic. Bulletin of the Section of Logic\u00a020, 52\u201362 (1991)","journal-title":"Bulletin of the Section of Logic"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Relational Structures as Knowledge Instruments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24615-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T08:06:13Z","timestamp":1591862773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24615-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207801","9783540246152"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24615-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}