{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:27:25Z","timestamp":1772242045091,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T00:00:00Z","timestamp":1557273600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T00:00:00Z","timestamp":1557273600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T00:00:00Z","timestamp":1557273600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>In the setting of DynFO, dynamic programs update the stored result of a query whenever the underlying data changes. This update is expressed in terms of first-order logic. We introduce a strategy for constructing dynamic programs that utilises periodic computation of auxiliary data from scratch and the ability to maintain a query for a limited number of change steps. We show that if some program can maintain a query for log n change steps after an AC$^1$-computable initialisation, it can be maintained by a first-order dynamic program as well, i.e., in DynFO. As an application, it is shown that decision and optimisation problems defined by monadic second-order (MSO) formulas are in DynFO, if only change sequences that produce graphs of bounded treewidth are allowed. To establish this result, a Feferman-Vaught-type composition theorem for MSO is established that might be useful in its own right.<\/jats:p>","DOI":"10.23638\/lmcs-15(2:12)2019","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:38:09Z","timestamp":1743687489000},"source":"Crossref","is-referenced-by-count":0,"title":["A Strategy for Dynamic Programs: Start over and Muddle through"],"prefix":"10.23638","volume":"Volume 15, Issue 2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2196-2308","authenticated-orcid":false,"given":"Samir","family":"Datta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5857-9778","authenticated-orcid":false,"given":"Anish","family":"Mukherjee","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Schwentick","sequence":"additional","affiliation":[]},{"given":"Nils","family":"Vortmeier","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Zeume","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2019,5,8]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1704.07998v5","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1704.07998v5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:38:09Z","timestamp":1743687489000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-15(2:12)2019","relation":{"has-preprint":[{"id-type":"arxiv","id":"1704.07998v3","asserted-by":"subject"},{"id-type":"arxiv","id":"1704.07998v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1704.07998","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1704.07998","asserted-by":"subject"}],"is-cited-by":[{"id-type":"doi","id":"10.1007\/978-3-030-86838-3_18","asserted-by":"object"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,8]]},"article-number":"4515"}}