{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:11:04Z","timestamp":1737349864033,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651413"},{"type":"electronic","value":"9783540495451"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49545-2_19","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T18:41:28Z","timestamp":1186425688000},"page":"279-293","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Relative Similarity Logics are Decidable: Reduction to FO2 with Equality"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Demri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beata","family":"Konikowska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,2,26]]},"reference":[{"key":"19_CR1","first-page":"553","volume-title":"Incomplete Information: Rough Set Analysis","author":"Ph. Balbiani","year":"1997","unstructured":"Ph. Balbiani. Axiomatization of logics based on Kripke models with relative accessibility relations. In [Oe97], pages 553\u2013578, 1997."},{"key":"19_CR2","unstructured":"J. van Benthem. Modal logic and classical logic. Bibliopolis, 1983."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"J. van Benthem. The range of modal logic-An essay in memory of George Gargov. Journal of Applied Non-Classical Logics, 1998. To appear.","DOI":"10.1080\/11663081.1999.10510976"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1305\/ndjfl\/1093634564","volume":"34","author":"P. Blackburn","year":"1993","unstructured":"P. Blackburn. Nominal tense logic. Notre Dame Journal of Formal Logic, 34(1):56\u201383, 1993.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"19_CR5","unstructured":"S. Demri. A logic with relative knowledge operators. Journal of Logic, Language and Information, 1998. To appear."},{"key":"19_CR6","unstructured":"S. Demri and E. Or\u0142owska. Informational representability: Abstract models versus concrete models. In D. Dubois and H. Prade, editors, Linz Seminar on Fuzzy Sets, Logics and Artificial Intelligence, Linz, Austria. Kluwer Academic Publishers, February 1996. To appear."},{"key":"19_CR7","unstructured":"L. Fari\u00f1as del Cerro and E. Or\u0142owska. DAL-A logic for data analysis. In T. O\u2019Shea, editor, ECAI-6, pages 285\u2013294, September 1984."},{"issue":"6","key":"19_CR8","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/BF01054038","volume":"22","author":"G. Gargov","year":"1993","unstructured":"G. Gargov and V. Goranko. Modal logic with names. Journal of Philosophical Logic, 22(6):607\u2013636, December 1993.","journal-title":"Journal of Philosophical Logic"},{"issue":"1","key":"19_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/421196","volume":"3","author":"E. Gr\u00e4del","year":"1997","unstructured":"E. Gr\u00e4del, Ph. Kolaitis, and M. Vardi. On the decision problem for two-variable first-order logic. Bulletin of Symbolic Logic, 3(1):53\u201369, 1997.","journal-title":"Bulletin of Symbolic Logic"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"G. Gargov and S. Passy. A note on boolean modal logic. In P. Petkov, editor, Summer School and Conference on Mathematical Logic\u2019 88, pages 299\u2013309. Plenum Press, 1990.","DOI":"10.1007\/978-1-4613-0609-2_21"},{"issue":"2","key":"19_CR11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1305\/ndjfl\/1040046086","volume":"37","author":"E. Hemaspaandra","year":"1996","unstructured":"E. Hemaspaandra. The price of universality. Notre Dame Journal of Formal Logic, 37(2):173\u2013203, 1996.","journal-title":"Notre Dame Journal of Formal Logic"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1023\/A:1004952317628","volume":"58","author":"B. Konikowska","year":"1997","unstructured":"B. Konikowska. A logic for reasoning about relative similarity. Studia Logica, 58(1):185\u2013226, 1997.","journal-title":"Studia Logica"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0022-0000(80)90027-6","volume":"21","author":"H. Lewis","year":"1980","unstructured":"H. Lewis. Complexity results for classes of quanticational formulas. Journal of Computer and System Sciences, 21:317\u2013353, 1980.","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/malq.19750210118","volume":"21","author":"M. Mortimer","year":"1975","unstructured":"M. Mortimer. On language with two variables. Zeit. f\u00fcr Math. Logik and Grund. der Math., 21:135\u2013140, 1975.","journal-title":"Zeit. f\u00fcr Math. Logik and Grund. der Math."},{"volume-title":"Incomplete Information: Rough Set Analysis","year":"1997","key":"19_CR15","unstructured":"E. Orlowska (ed.). Incomplete Information: Rough Set Analysis. Studies in Fuzziness and Soft Computing. Physica-Verlag, Heidelberg, 1997."},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(84)90010-0","volume":"29","author":"E. Or\u0142owska","year":"1984","unstructured":"E. Or\u0142owska and Z. Pawlak. Representation of nondeterministic information. Theoretical Computer Science, 29:27\u201339, 1984.","journal-title":"Theoretical Computer Science"},{"key":"19_CR17","series-title":"Lect Notes Comput Sci","first-page":"177","volume-title":"5th Symposium on Computation Theory, Zabor\u00f3w, Poland","author":"E. Or\u0142owska","year":"1984","unstructured":"E. Or\u0142owska. Logic of indiscernibility relations. In A. Skowron, editor, 5th Symposium on Computation Theory, Zabor\u00f3w, Poland, pages 177\u2013186. LNCS 208, Springer-Verlag, 1984."},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/malq.19840301305","volume":"30","author":"E. Or\u0142owska","year":"1984","unstructured":"E. Or\u0142owska. Modal logics in the theory of information systems. Zeitschr. f. Math. Logik und Grundlagen d. Math., 30(1):213\u2013222, 1984.","journal-title":"Zeitschr. f. Math. Logik und Grundlagen d. Math."},{"issue":"3","key":"19_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0306-4379(81)90023-5","volume":"6","author":"Z. Pawlak","year":"1981","unstructured":"Z. Pawlak. Information systems theoretical foundations. Information Systems, 6(3):205\u2013218, 1981.","journal-title":"Information Systems"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"L. Pacholski, W. Szwast, and L. Tendera. Complexity of two-variable logic with counting. In LICS, pages 318\u2013327. IEEE, July 1997.","DOI":"10.1109\/LICS.1997.614958"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0890-5401(91)90026-X","volume":"93","author":"S. Passy","year":"1991","unstructured":"S. Passy and T. Tinchev. An essay in combinatory dynamic logic. Information and Computation, 93:263\u2013332, 1991.","journal-title":"Information and Computation"},{"key":"19_CR22","unstructured":"D. Vakarelov. Logical analysis of positive and negative similarity relations in property systems. In M. de Glas and D. Gabbay, editors, First World Conference on the Fundamentals of Artificial Intelligence, 1991."},{"key":"19_CR23","doi-asserted-by":"crossref","first-page":"61","DOI":"10.3233\/FI-1991-15105","volume":"15","author":"D. Vakarelov","year":"1991","unstructured":"D. Vakarelov. A modal logic for similarity relations in Pawlak knowledge representation systems. Fundamenta Informaticae, 15:61\u201379, 1991.","journal-title":"Fundamenta Informaticae"},{"key":"19_CR24","first-page":"433","volume":"90","author":"D. Vakarelov","year":"1991","unstructured":"D. Vakarelov. Modal logics for knowledge representation systems. Theoretical Computer Science, 90:433\u2013456, 1991.","journal-title":"Theoretical Computer Science"},{"key":"19_CR25","unstructured":"M. Vardi. Why is modal logic so robustly decidable? In Descriptive complexity and finite models, A.M.S., 1997."}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49545-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T04:40:50Z","timestamp":1737348050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49545-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651413","9783540495451"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-49545-2_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 February 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}