Seminar 28 Aug 15:00, 2012

Deciding MSO over Languages of Hypergraphs


The description of sets of words (called languages) is a well known fieldof research. However a less popular extension of this concept is formed by languages of relational structures like hypergraphs. For hypergraphs one possibility is given by hyperedge replacement grammars. In analogy to context free string grammars they form a system of nonterminal hyperedges(symbols), hypergraphs(words) and production rules that specify 

how nonterminal hyperedges can be replace in order to derive different hypergraphs. As for strings we can describe properties of hypergraphs by first oder logic (FO) and monadic second order logic (MSO). Both include quantification over vertices and predication about hyperedges. MSO extends FO by the quantification over subsets of vertices. Deciding properties for a single hypergraph is mostly trivial while checking properties for languages of structures is not decidable in general. However the decidability of MSO-formulas over hypergraphs was proven by B. Courcelle for languages described by hyperedge replacement grammars, but no applicable algorithm to decide this problem was given. 

I present the results of my thesis where I develop an algorithm to decide if a property given as a MSO formula is fulfilled by a set of hypergraphs defined by a hyperedge replacement grammar and thereby provide a different, constructive proof of the decidability.