{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:24:44Z","timestamp":1781893484753,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,9]]},"DOI":"10.1145\/3209108.3209203","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T08:14:43Z","timestamp":1530087283000},"page":"432-441","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Sequential Relational Decomposition"],"prefix":"10.1145","author":[{"given":"Dror","family":"Fried","sequence":"first","affiliation":[{"name":"Department of Computer Science, Rice University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Axel","family":"Legay","sequence":"additional","affiliation":[{"name":"Inria, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Software Systems, Saarland Informatics Campus, Germany, Department of Computer Science, Oxford University, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rice University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2014.08.013"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","unstructured":"J. L. Balc\u00e1zar A. Lozano and J. Tor\u00e1n. 1992. The complexity of algorithmic problems on succinct instances. In Computer Science. Springer 351--377.","DOI":"10.5555\/166961.167022"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2602458.2602477"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","unstructured":"A. Bouajjani B. Jonsson M. Nilsson and T. Touili. 2000. Regular model checking. In Int'l Conf. on Computer-Aided Verification. Springer 403--418.","DOI":"10.5555\/647769.734106"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"B. Das P. Scharpfenecker and J. Tor\u00e1n. 2016. CNF and DNF succinct graph encodings. Information and Computation (2016).","DOI":"10.1016\/j.ic.2016.06.009"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"J. Feigenbaum S. Kannan M. Y. Vardi and M. Viswanathan. 1999. The Complexity of Problems on Graphs Represented as OBDDs. Chicago J. Theor. Comput. Sci 1999 (1999).","DOI":"10.1007\/BFb0028563"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/111713.111720"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"D. Fried A. Legay J. Ouaknine and M.Y. Vardi. 2018. Sequential Relational Decomposition. Full version. (2018). https:\/\/www.cs.rice.edu\/~vardi\/papers\/index.html","DOI":"10.1145\/3209108.3209203"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. 28th Int'l Conf. on Computer Aided Verification. 402--421","author":"Fried D.","unstructured":"D. Fried, L.M. Tabajara, and M.Y. Vardi. 2016. BDD-based Boolean functional synthesis. In Proc. 28th Int'l Conf. on Computer Aided Verification. 402--421."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(83)80004-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","unstructured":"M. R. Garey and D. S. Johnson. 1979. Computers and intractability: A guide to the theory of NP-Completeness. W. H. Freeman.","DOI":"10.5555\/578533"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","unstructured":"J. E. Hopcroft R. Motwani and J. D. Ullman. 2003. Introduction to automata theory languages and computation - international edition (2. ed). Addison-Wesley.","DOI":"10.5555\/557657"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90043-5"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/648045.745192"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9586-5_6"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/871816.871850"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","unstructured":"E. Kushilevitz and N. Nisan. 1997. Communication complexity. Cambridge University Press.","DOI":"10.5555\/264772"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"D. Kuske and M. Lohrey. 2010. Some natural decision problems in automatic graphs. J. of Symbolic Logic (2010) 678--710.","DOI":"10.2178\/jsl\/1268917499"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. ICALP (LNCS)","volume":"8573","author":"Ouaknine J.","unstructured":"J. Ouaknine and J. Worrell. 2014. On the Positivity problem for simple linear recurrence sequences. In Proc. ICALP (LNCS), Vol. 8573. Springer."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766189.2766191"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80009-2"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/361598.361623"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89597"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1155\/1995\/74543"},{"key":"e_1_3_2_1_27_1","unstructured":"S. Rubin. 2004. Automatic structures. Ph.D. Dissertation. University of Auckland New Zealand."},{"key":"e_1_3_2_1_28_1","unstructured":"M. Soittola. 1976. On D0L Synthesis Problem. In Automata Languages Development. North-Holland."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00134-8"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1118178.1118215"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/VLHCC.2011.6070404"}],"event":{"name":"LICS '18: 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Oxford United Kingdom","acronym":"LICS '18","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","IEEE-CS\\DATC IEEE Computer Society","EACSL European Association for Computer Science Logic"]},"container-title":["Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209203","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T07:31:26Z","timestamp":1781854286000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":31,"alternative-id":["10.1145\/3209108.3209203","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209203","relation":{},"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"2018-07-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}