文章基本信息

标题：A Strategy for Dynamic Programs: Start over and Muddle Through
本地全文：下载
作者：Samir Datta ; Anish Mukherjee ; Thomas Schwentick 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：80
页码：98:1-98:14
DOI：10.4230/LIPIcs.ICALP.2017.98
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：A strategy for constructing dynamic programs is introduced that utilises periodic computation of auxiliary data from scratch and the ability to maintain a query for a limited number of change steps. It is established 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) and guarded second-order logic (GSO) formulas are in DynFO, if only change sequences that produce graphs of bounded treewidth are allowed. To establish this result, Feferman-Vaught-type composition theorems for MSO and GSO are established that might be useful in their own right.
关键词：dynamic complexity; treewidth; monadic second order logic