{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:15Z","timestamp":1750306695192,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T00:00:00Z","timestamp":1405296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["DEC-2011\/03\/B\/ST6\/00346, DEC-2013\/09\/B\/ST6\/01535, DEC-2013\/09\/N\/ST6\/01170"],"award-info":[{"award-number":["DEC-2011\/03\/B\/ST6\/00346, DEC-2013\/09\/B\/ST6\/01535, DEC-2013\/09\/N\/ST6\/01170"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,14]]},"DOI":"10.1145\/2603088.2603134","type":"proceedings-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:45Z","timestamp":1406553705000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Decidability of weak logics with deterministic transitive closure"],"prefix":"10.1145","author":[{"given":"Witold","family":"Charatonik","sequence":"first","affiliation":[{"name":"University of Wroc\u0142aw, Wroc\u0142aw, Poland"}]},{"given":"Emanuel","family":"Kiero\u0144ski","sequence":"additional","affiliation":[{"name":"University of Wroc\u0142aw, Wroc\u0142aw, Poland"}]},{"given":"Filip","family":"Mazowiecki","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}]}],"member":"320","published-online":{"date-parts":[[2014,7,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90018-6"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_10"},{"key":"e_1_3_2_1_3_1","volume-title":"Controlling the depth, size, and number of subtrees for two-variable logic on trees. CoRR, abs\/1304.6925","author":"Benaim S.","year":"2013","unstructured":"S. Benaim , M. Benedikt , R. Lenhardt , and J. Worrell . Controlling the depth, size, and number of subtrees for two-variable logic on trees. CoRR, abs\/1304.6925 , 2013 . S. Benaim, M. Benedikt, R. Lenhardt, and J. Worrell. Controlling the depth, size, and number of subtrees for two-variable logic on trees. CoRR, abs\/1304.6925, 2013."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2011.12.003"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2013.12"},{"key":"e_1_3_2_1_6_1","volume-title":"Satisfiability of the two-variable fragment of first-order logic over trees. CoRR, abs\/1304.7204","author":"Charatonik W.","year":"2013","unstructured":"W. Charatonik , E. Kieronski , and F. Mazowiecki . Satisfiability of the two-variable fragment of first-order logic over trees. CoRR, abs\/1304.7204 , 2013 . W. Charatonik, E. Kieronski, and F. Mazowiecki. Satisfiability of the two-variable fragment of first-order logic over trees. CoRR, abs\/1304.7204, 2013."},{"key":"e_1_3_2_1_7_1","volume-title":"Unpublished","author":"Demri S.","year":"2014","unstructured":"S. Demri and M. Deters . Two-variable separation logic and its inner circle . Unpublished , 2014 . S. Demri and M. Deters. Two-variable separation logic and its inner circle. Unpublished, 2014."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.2307\/421196"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/788019.788870"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001530050130"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216051"},{"key":"e_1_3_2_1_12_1","series-title":"LNCS","first-page":"160","volume-title":"CSL","author":"Immerman N.","year":"2004","unstructured":"N. Immerman , A. Rabinovich , T. Reps , S. Sagiv , and G. Yorsh . The boundary between decidability and undecidability for transitive-closure logics . In CSL , volume 3210 of LNCS , pages 160 -- 174 , 2004 . N. Immerman, A. Rabinovich, T. Reps, S. Sagiv, and G. Yorsh. The boundary between decidability and undecidability for transitive-closure logics. In CSL, volume 3210 of LNCS, pages 160--174, 2004."},{"key":"e_1_3_2_1_14_1","series-title":"LNCS","first-page":"608","volume-title":"STACS","author":"Kiero\u0144ski E.","year":"2002","unstructured":"E. Kiero\u0144ski . EXPSPACE-complete variant of guarded fragment with transitivity . In STACS , volume 2285 of LNCS , pages 608 -- 619 , 2002 . E. Kiero\u0144ski. EXPSPACE-complete variant of guarded fragment with transitivity. In STACS, volume 2285 of LNCS, pages 608--619, 2002."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538363_22"},{"key":"e_1_3_2_1_16_1","series-title":"LIPIcs","first-page":"337","volume-title":"CSL","author":"Kiero\u0144ski E.","year":"2011","unstructured":"E. Kiero\u0144ski . Decidability issues for two-variable logics with several linear orders . In CSL , volume 12 of LIPIcs , pages 337 -- 351 , 2011 . E. Kiero\u0144ski. Decidability issues for two-variable logics with several linear orders. In CSL, volume 12 of LIPIcs, pages 337--351, 2011."},{"key":"e_1_3_2_1_17_1","series-title":"LIPIcs","first-page":"396","volume-title":"CSL","author":"Kieronski E.","year":"2012","unstructured":"E. Kieronski and J. Michaliszyn . Two-variable universal logic with transitive closure . In CSL , volume 16 of LIPIcs , pages 396 -- 410 , 2012 . E. Kieronski and J. Michaliszyn. Two-variable universal logic with transitive closure. In CSL, volume 16 of LIPIcs, pages 396--410, 2012."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1344862160"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.39"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.53"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90027-6"},{"key":"e_1_3_2_1_22_1","series-title":"LNCS","first-page":"513","volume-title":"MFCS","author":"Manuel A.","year":"2010","unstructured":"A. Manuel . Two variables and two successors . In MFCS , volume 6281 of LNCS , pages 513 -- 524 , 2010 . A. Manuel. Two variables and two successors. In MFCS, volume 6281 of LNCS, pages 513--524, 2010."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19750210118"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.2307\/2695037"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/788019.788868"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10849-005-5791-1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664578"},{"key":"e_1_3_2_1_29_1","volume-title":"Two-variable logic with two order relations. Logical Methods in Computer Science, 8(1)","author":"Schwentick T.","year":"2012","unstructured":"T. Schwentick and T. Zeume . Two-variable logic with two order relations. Logical Methods in Computer Science, 8(1) , 2012 . T. Schwentick and T. Zeume. Two-variable logic with two order relations. Logical Methods in Computer Science, 8(1), 2012."},{"key":"e_1_3_2_1_30_1","first-page":"477","article-title":"A decision method for validity of sentences in two variables","volume":"27","author":"Scott D.","year":"1962","unstructured":"D. Scott . A decision method for validity of sentences in two variables . Journal Symbolic Logic , 27 : 477 , 1962 . D. Scott. A decision method for validity of sentences in two variables. Journal Symbolic Logic, 27:477, 1962.","journal-title":"Journal Symbolic Logic"},{"key":"e_1_3_2_1_31_1","series-title":"LIPIcs","first-page":"317","volume-title":"STACS","author":"Szwast W.","year":"2013","unstructured":"W. Szwast and L. Tendera . FO2 with one transitive relation is decidable . In STACS , volume 20 of LIPIcs , pages 317 -- 328 , 2013 . W. Szwast and L. Tendera. FO2 with one transitive relation is decidable. In STACS, volume 20 of LIPIcs, pages 317--328, 2013."}],"event":{"name":"CSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vienna Austria","acronym":"CSL-LICS '14"},"container-title":["Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603134","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2603088.2603134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:41Z","timestamp":1750230101000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2603088.2603134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,14]]},"references-count":29,"alternative-id":["10.1145\/2603088.2603134","10.1145\/2603088"],"URL":"https:\/\/doi.org\/10.1145\/2603088.2603134","relation":{},"subject":[],"published":{"date-parts":[[2014,7,14]]},"assertion":[{"value":"2014-07-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}