License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2017.98
URN: urn:nbn:de:0030-drops-74470
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7447/
Datta, Samir ;
Mukherjee, Anish ;
Schwentick, Thomas ;
Vortmeier, Nils ;
Zeume, Thomas
A Strategy for Dynamic Programs: Start over and Muddle Through
Abstract
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.
BibTeX - Entry
@InProceedings{datta_et_al:LIPIcs:2017:7447,
author = {Samir Datta and Anish Mukherjee and Thomas Schwentick and Nils Vortmeier and Thomas Zeume},
title = {{A Strategy for Dynamic Programs: Start over and Muddle Through}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {98:1--98:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7447},
URN = {urn:nbn:de:0030-drops-74470},
doi = {10.4230/LIPIcs.ICALP.2017.98},
annote = {Keywords: dynamic complexity, treewidth, monadic second order logic}
}
Keywords: |
|
dynamic complexity, treewidth, monadic second order logic |
Collection: |
|
44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) |
Issue Date: |
|
2017 |
Date of publication: |
|
07.07.2017 |