{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:33:48Z","timestamp":1725478428637},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540692232"},{"type":"electronic","value":"9783540692249"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11964810_5","type":"book-chapter","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T13:12:54Z","timestamp":1169557974000},"page":"89-104","source":"Crossref","is-referenced-by-count":4,"title":["An Environment for Specifying Properties of Dyadic Relations and Reasoning About Them II: Relational Presentation of Non-classical Logics"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Formisano","sequence":"first","affiliation":[]},{"given":"Eugenio G.","family":"Omodeo","sequence":"additional","affiliation":[]},{"given":"Ewa","family":"Or\u0142owska","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1093\/logcom\/7.2.251","volume":"7","author":"J.F.A.K. Benthem van","year":"1997","unstructured":"van Benthem, J.F.A.K., D\u2019Agostino, G., Montanari, A., Policriti, A.: Modal deduction in second-order logic and set theory-I. Journal of Logic and Computation\u00a07(2), 251\u2013265 (1997)","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0304-3975(01)00355-3","volume":"293","author":"D. Cantone","year":"2003","unstructured":"Cantone, D., Formisano, A., Omodeo, E.G., Zarba, C.G.: Compiling dyadic first-order specifications into map algebra. Theoretical Computer Science\u00a0293(2), 447\u2013475 (2003)","journal-title":"Theoretical Computer Science"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-24615-2_5","volume-title":"Theory and Applications of Relational Structures as Knowledge Instruments","author":"P. Caianiello","year":"2003","unstructured":"Caianiello, P., Costantini, S., Omodeo, E.G.: An Environment for Specifying Properties of Dyadic Relations and Reasoning about Them. I: Language Extension Mechanisms. In: de Swart, H., Or\u0142owska, E., Schmidt, G., Roubens, M. (eds.) Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol.\u00a02929, pp. 87\u2013106. Springer, Heidelberg (2003)"},{"issue":"15","key":"5_CR4","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF00881803","volume":"3","author":"G. D\u2019Agostino","year":"1995","unstructured":"D\u2019Agostino, G., Montanari, A., Policriti, A.: A set-theoretic translation method for polymodal logics. Journal of Automated Reasoning\u00a03(15), 317\u2013337 (1995)","journal-title":"Journal of Automated Reasoning"},{"key":"5_CR5","series-title":"EATCS Monographs in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04997-6","volume-title":"Incomplete Information: Structure, Inference, Complexity","author":"S. Demri","year":"2002","unstructured":"Demri, S., Or\u0142owska, E.: Incomplete Information: Structure, Inference, Complexity. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (2002)"},{"key":"5_CR6","first-page":"277","volume-title":"Relational Methods in Computer Science Applications","author":"I. D\u00fcntsch","year":"2000","unstructured":"D\u00fcntsch, I., Or\u0142owska, E.: Beyond modalities: sufficiency and mixed algebras. In: Or\u0142owska, E., Szalas, A. (eds.) Relational Methods in Computer Science Applications, pp. 277\u2013299. Physica-Verlag, Heidelberg (2000)"},{"key":"5_CR7","first-page":"132","volume":"1","author":"I. D\u00fcntsch","year":"2004","unstructured":"D\u00fcntsch, I., Or\u0142owska, E., Radzikowska, A.M., Vakarelov, D.: Relational Representation Theorems for Some Lattice-Based Structures. Journal on Relational Methods in Computer Science\u00a01, 132\u2013160 (2004)","journal-title":"Journal on Relational Methods in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Formisano, A., Nicolosi Asmundo, M.: An efficient relational deductive system for propositional non-classical logics. Journal of Applied Non-Classical Logics (to appear) (A draft version is available as report 8\/06 of the Dipartimento di Informatica, Universit\u00e0 di L\u2019Aquila, 2006)","key":"5_CR8","DOI":"10.3166\/jancl.16.367-408"},{"unstructured":"Formisano, A., Omodeo, E., Or\u0142owska, E., Policriti, A.: Uniform relational frameworks for modal inferences. In: D\u00fcntsch, I., Winter, M. (eds.) Proceedings of the 8th International Conference on Relational Methods in Computer Science (RelMiCS\u00a08) (2005)","key":"5_CR9"},{"key":"5_CR10","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"A graphical approach to relational reasoning","author":"A. Formisano","year":"2001","unstructured":"Formisano, A., Omodeo, E., Simeoni, M.: A graphical approach to relational reasoning. Electronic Notes in Theoretical Computer Science, vol.\u00a044(3). Elsevier, Amsterdam (2001)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","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 Set-Reasoning with Otter. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol.\u00a02083, pp. 152\u2013167. Springer, Heidelberg (2001)"},{"key":"5_CR12","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Layered map reasoning: An experimental approach put to trial on sets","author":"A. Formisano","year":"2001","unstructured":"Formisano, A., Omodeo, E.G., Temperini, M.: Layered map reasoning: An experimental approach put to trial on sets. Electronic Notes in Theoretical Computer Science, vol.\u00a048. Elsevier, Amsterdam (2001)"},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1023\/A:1006170514174","volume":"22","author":"A. Formisano","year":"1999","unstructured":"Formisano, A., Policriti, A.: T-Resolution: Refinements and Model Elimination. Journal of Automated Reasoning\u00a022(4), 433\u2013483 (1999)","journal-title":"Journal of Automated Reasoning"},{"issue":"1-2","key":"5_CR14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1080\/11663081.1998.10510932","volume":"8","author":"M. Frias","year":"1998","unstructured":"Frias, M., Or\u0142owska, E.: Equational reasoning in nonclassical logics. Journal of Applied Non-Classical Logics\u00a08(1-2), 27\u201366 (1998)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1305\/ndjfl\/1093635335","volume":"31","author":"V. Goranko","year":"1990","unstructured":"Goranko, V.: Modal definability in enriched languages. Notre Dame Journal of Formal Logic\u00a031, 81\u2013105 (1990)","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-63172-0_40","volume-title":"Computer Science Logic","author":"R. Gor\u00e9","year":"1997","unstructured":"Gor\u00e9, R.: Cut-free display calculi for relation algebras. In: van Dalen, D., Bezem, M. (eds.) CSL 1996. LNCS, vol.\u00a01258, pp. 198\u2013210. Springer, Heidelberg (1997)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-0000(80)90007-0","volume":"20","author":"M.C.B. Hennessy","year":"1980","unstructured":"Hennessy, M.C.B.: A proof system for the first order relational calculus. Journal of Computer and System Sciences\u00a020, 96\u2013110 (1980)","journal-title":"Journal of Computer and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R., Jifeng, H.: The weakest prespecification. Fundamenta Informaticae\u00a0IX, 51\u201384, Part II ibidem IX, 217\u2013252 (1986)","key":"5_CR18","DOI":"10.3233\/FI-1986-9104"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1305\/ndjfl\/1093870378","volume":"24","author":"I.L. Humberstone","year":"1983","unstructured":"Humberstone, I.L.: Inaccessible worlds. Notre Dame Journal of Formal Logic\u00a024, 346\u2013352 (1983)","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/11734673_11","volume-title":"Relational Methods in Computer Science","author":"J. J\u00e4rvinen","year":"2006","unstructured":"J\u00e4rvinen, J., Or\u0142owska, E.: Relational correspondences for lattices with operators. In: MacCaull, W., Winter, M., D\u00fcntsch, I. (eds.) RelMiCS 2005. LNCS, vol.\u00a03929, pp. 111\u2013118. Springer, Heidelberg (2006)"},{"unstructured":"Kwatinetz, M.K.: Problems of expressibility in finite languages. PhD thesis, University of California, Berkeley (1981)","key":"5_CR21"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0168-0072(83)90055-6","volume":"25","author":"R. Maddux","year":"1983","unstructured":"Maddux, R.: A sequent calculus for relation algebras. Annals of Pure and Applied Logic\u00a025, 73\u2013101 (1983)","journal-title":"Annals of Pure and Applied Logic"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1016\/B978-044450813-3\/50023-0","volume-title":"Handbook of Automated Reasoning","author":"H.J. Ohlbach","year":"2001","unstructured":"Ohlbach, H.J., Nonnengart, A., de Rijke, M., Gabbay, D.: Encoding Two-Valued Nonclassical Logics in Classical Logic. In: Handbook of Automated Reasoning, vol.\u00a0II, pp. 1403\u20131486. Elsevier, Amsterdam (2001)"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0020-0190(88)90218-9","volume":"27","author":"E. Or\u0142owska","year":"1988","unstructured":"Or\u0142owska, E.: Proof system for weakest prespecification. Information Processing Letters\u00a027, 309\u2013313 (1988)","journal-title":"Information Processing Letters"},{"key":"5_CR25","series-title":"Colloquia Mathematica Societatis Janos Bolyai","first-page":"443","volume-title":"Algebraic Logic","author":"E. Or\u0142owska","year":"1998","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 (1998)"},{"key":"5_CR26","doi-asserted-by":"crossref","first-page":"167","DOI":"10.2307\/2275375","volume":"57","author":"E. Or\u0142owska","year":"1992","unstructured":"Or\u0142owska, E.: Relational proof systems for relevant logics. Journal of Symbolic Logic\u00a057, 167\u2013186 (1992)","journal-title":"Journal of Symbolic Logic"},{"key":"5_CR27","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-94-015-8273-5_11","volume-title":"Philosophical Logic in Poland","author":"E. Or\u0142owska","year":"1994","unstructured":"Or\u0142owska, E.: Relational semantics for nonclassical logics: formulas are relations. In: Wolenski, J. (ed.) Philosophical Logic in Poland, pp. 167\u2013186. Kluwer, Dordrecht (1994)"},{"doi-asserted-by":"crossref","unstructured":"Or\u0142owska, E.: Temporal logics in a relational framework. Time and Logic\u2014A computational Approach, pp. 227\u2013249. University College London Press (1995)","key":"5_CR28","DOI":"10.4324\/9780429321047-6"},{"key":"5_CR29","series-title":"Applied logic series","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-94-017-2798-3_5","volume-title":"Proof theory of modal logic","author":"E. Or\u0142owska","year":"1996","unstructured":"Or\u0142owska, E.: Relational proof systems for modal logics. In: Wansing, H. (ed.) Proof theory of modal logic. Applied logic series, vol.\u00a02, pp. 55\u201378. Kluwer, Dordrecht (1996)"},{"key":"5_CR30","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-7091-6510-2_6","volume-title":"Relational Methods in Computer Science","author":"E. Or\u0142owska","year":"1997","unstructured":"Or\u0142owska, E.: Relational formalization of nonclassical logics. In: Brink, C., Kahl, W., Schmidt, G. (eds.) Relational Methods in Computer Science, pp. 90\u2013105. Springer, Heidelberg (1997)"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","first-page":"215","volume-title":"Proceedings 7th International Conference on Relational Methods in Computer Science (RelMiCS\u00a07)","author":"E.G. Omodeo","year":"2003","unstructured":"Omodeo, E.G., Or\u0142owska, E., Policriti, A.: Rasiowa-Sikorski style relational elementary set theory. In: Berghammer, R., Moeller, B. (eds.) Proceedings 7th International Conference on Relational Methods in Computer Science (RelMiCS\u00a07) LNCS, vol.\u00a03051, pp. 215\u2013226. Springer, Heidelberg (2003)"},{"unstructured":"Or\u0142owska, E., Vakarelov, D.: Lattice-based modal algebras and modal logics. In: Hajek, P., Vald\u00e9s-Villanueva, L.M., Westerstahl, D. (eds.) Logic, Methodology and Philosophy of Science. Proceedings of the 12th International Congress, pp. 147\u2013170. KCL Puplications (2005)","key":"5_CR32"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-540-24615-2_3","volume-title":"Theory and Applications of Relational Structures as Knowledge Instruments","author":"R. Schmidt","year":"2003","unstructured":"Schmidt, R., Hustadt, U.: Mechanized reasoning and model generation for extended modal logics. In: de Swart, H., Or\u0142owska, E., Schmidt, G., Roubens, M. (eds.) Theory and Applications of Relational Structures as Knowledge Instruments. LNCS, vol.\u00a02929, pp. 38\u201367. Springer, Heidelberg (2003)"},{"key":"5_CR34","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1002\/malq.19820281408","volume":"28","author":"W. Schoenfeld","year":"1982","unstructured":"Schoenfeld, W.: Upper bounds for a proof search in a sequent calculus for relational equations. Zeitschrift fuer Mathematische Logic und Grundlagen der Mathematik\u00a028, 239\u2013246 (1982)","journal-title":"Zeitschrift fuer Mathematische Logic und Grundlagen der Mathematik"},{"doi-asserted-by":"crossref","unstructured":"Tarski, A., Givant, S.: A formalization of Set Theory without variables, Colloquium Publications. American Mathematical Society, vol.\u00a041. Colloquium Publications (1987)","key":"5_CR35","DOI":"10.1090\/coll\/041"},{"unstructured":"Web resources for the Tcl\/Tk toolkit, http:\/\/tcl.sourceforge.net","key":"5_CR36"},{"unstructured":"Web reference for SICStus Prolog, http:\/\/www.sics.se\/sicstus","key":"5_CR37"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Relational Structures as Knowledge Instruments II"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11964810_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,8]],"date-time":"2021-08-08T00:59:48Z","timestamp":1628384388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11964810_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540692232","9783540692249"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/11964810_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}