2013/05/30 by Bruno Courcelle, Courcelle, Bruno, Irène Durand +1
Computer Science · #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Machine Learning and Algorithms #Model-Driven Software Engineering Techniques
paper · doi:10.48550/arxiv.1305.7120
openalex publication_date 2013/05/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
We present logically based methods for constructing XP and FPT graph algorithms, parametrized by tree-width or clique-width. We will use fly-automata introduced in a previous article. They make possible to check properties that are not monadic second-order expressible because their states may include counters, so that their sets of states may be infinite. We equip these automata with output functions, so that they can compute values associated with terms or graphs. Rather than new algorithmic results we present tools for constructing easily certain dynamic programming algorithms by combining predefined automata for basic functions and properties.