{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:53:29Z","timestamp":1725551609361},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540305538"},{"type":"electronic","value":"9783540316503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11591191_45","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T04:44:25Z","timestamp":1132634665000},"page":"651-665","source":"Crossref","is-referenced-by-count":8,"title":["Comparative Similarity, Tree Automata, and Diophantine Equations"],"prefix":"10.1007","author":[{"given":"Mikhail","family":"Sheremet","sequence":"first","affiliation":[]},{"given":"Dmitry","family":"Tishkovsky","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Wolter","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Zakharyaschev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","first-page":"2","volume":"43","author":"A. Cohn","year":"2001","unstructured":"Cohn, A., Hazarika, S.: Qualitative spatial representation and reasoning: an overview. Fundamenta Informaticae\u00a043, 2\u201332 (2001)","journal-title":"Fundamenta Informaticae"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/S0049-237X(08)71115-7","volume-title":"Handbook of Mathematical Logic","author":"M. Davis","year":"1977","unstructured":"Davis, M.: Unsolvable problems. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 567\u2013594. North-Holland, Amsterdam (1977)"},{"key":"45_CR3","unstructured":"Delgrande, J.P.: Preliminary considerations on the modelling of belief change operators by metric spaces. In: NMR, pp. 118\u2013125 (2004)"},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539793304741","volume":"29","author":"E. Emerson","year":"1999","unstructured":"Emerson, E., Jutla, C.: The complexity of tree automata and logics of programs. SIAM Journal of Computing\u00a029, 132\u2013158 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Friedman, N., Halpern, J.: On the complexity of conditional logics. In: Proceedings of KR 1994, pp. 202\u2013213 (1994)","DOI":"10.1016\/B978-1-4832-1452-8.50115-9"},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/635499.635504","volume":"4","author":"O. Kutz","year":"2003","unstructured":"Kutz, O., Sturm, H., Suzuki, N.-Y., Wolter, F., Zakharyaschev, M.: Logics of metric spaces. ACM Transactions on Computational Logic\u00a04, 260\u2013294 (2003)","journal-title":"ACM Transactions on Computational Logic"},{"key":"45_CR7","volume-title":"Counterfactuals","author":"D. Lewis","year":"1973","unstructured":"Lewis, D.: Counterfactuals. Blackwell, Oxford (1973)"},{"key":"45_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-45206-5_12","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"C. Lutz","year":"2003","unstructured":"Lutz, C., Wolter, F., Zakharyaschev, M.: A tableau algorithm for reasoning about concepts and similarity. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol.\u00a02796, pp. 134\u2013149. Springer, Heidelberg (2003)"},{"key":"45_CR9","first-page":"354","volume":"11","author":"Y.V. Matiyasevich","year":"1970","unstructured":"Matiyasevich, Y.V.: Enumerable sets are Diophantine. Soviet Mathematics Doklady\u00a011, 354\u2013358 (1970)","journal-title":"Soviet Mathematics Doklady"},{"key":"45_CR10","volume-title":"Coherent Systems","author":"K. Schlechta","year":"2004","unstructured":"Schlechta, K.: Coherent Systems. Elsevier, Amsterdam (2004)"},{"key":"45_CR11","unstructured":"Sheremet, M., Tishkovsky, D., Wolter, F., Zakharyaschev, M.: Comparative similarity, tree automata, and diophantine equations (2005), Available at, \n                  \n                    http:\/\/www.csc.liv.ac.uk\/frank\/publ\/publ.html"},{"key":"45_CR12","unstructured":"Spaan, E.: Complexity of Modal Logics. PhD thesis, University of Amsterdam (1993)"},{"key":"45_CR13","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013191. Elsevier, Amsterdam (1990)"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1037\/0033-295X.84.4.327","volume":"84","author":"A. Tversky","year":"1977","unstructured":"Tversky, A.: Features of similarity. Psychological Review\u00a084, 327\u2013352 (1977)","journal-title":"Psychological Review"},{"key":"45_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M. Vardi","year":"1986","unstructured":"Vardi, M., Wolper, P.: Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Sciences\u00a032, 183\u2013221 (1986)","journal-title":"Journal of Computer and System Sciences"},{"key":"45_CR16","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1305\/ndjfl\/1093638012","volume":"29","author":"T. Williamson","year":"1988","unstructured":"Williamson, T.: First-order logics for comparative similarity. Notre Dame Journal of Formal Logic\u00a029, 457\u2013481 (1988)","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"45_CR17","first-page":"1275","volume-title":"Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003)","author":"F. Wolter","year":"2003","unstructured":"Wolter, F., Zakharyaschev, M.: Reasoning about distances. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), pp. 1275\u20131280. Morgan Kaufmann, San Francisco (2003)"},{"key":"45_CR18","doi-asserted-by":"publisher","first-page":"795","DOI":"10.2178\/jsl\/1122038915","volume":"70","author":"F. Wolter","year":"2005","unstructured":"Wolter, F., Zakharyaschev, M.: A logic for metric and topology. Journal of Symbolic Logic\u00a070, 795\u2013828 (2005)","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11591191_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:51:36Z","timestamp":1619491896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11591191_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540305538","9783540316503"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11591191_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}