Logic for Programming, Artificial Intelligence, and Reasoning

DOI10.1007/b106931zbMath1109.68080MaRDI QIDQ5705923

Erich Grädel, Dietmar Berwanger

Publication date: 10 November 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b106931

Mathematics Subject Classification ID

91A43: Games involving graphs

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

68Q60: Specification and verification (program logics, model checking, etc.)

05C20: Directed graphs (digraphs), tournaments

68Q19: Descriptive complexity and finite models

Related Items

Polynomial-Time Under-Approximation of Winning Regions in Parity Games, Digraph Decompositions and Monotonicity in Digraph Searching, Undirected Graphs of Entanglement 2, An algorithmic metatheorem for directed treewidth, The dag-width of directed graphs, Parity games on undirected graphs, The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs, The variable hierarchy for the games \(\mu \)-calculus, Digraph decompositions and monotonicity in digraph searching, Graph operations on parity games and polynomial-time algorithms, Entanglement and the complexity of directed graphs, An extended tree-width notion for directed graphs related to the computation of permanents, Bounded treewidth as a key to tractability of knowledge representation and reasoning, Complexity of node coverage games, Digraph width measures in parameterized algorithmics, An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents, Finite Automata, Digraph Connectivity, and Regular Expression Size, The Descriptive Complexity of Parity Games, On Digraph Width Measures in Parameterized Algorithmics