18. Jahrestagung der GI-Fachgruppe
Logik in der Informatik

Die 18. Jahrestagung der GI-Fachgruppe Logik in der Informatik der Gesellschaft für Informatik fand am 4. und 5. November 2011 in Ilmenau statt.

Freitag
13:30-14:30	Isolde Adler	The VC dimension of definable sets in graph classes	Folien
14:30-15:10	Thomas Schneider	The modular structure of an ontology: Atomic decomposition	Folien
15:45-16:45	Martin Mundhenk	A survey of complexity results for temporal logics	Folien
16:45-17:25	Martin Huschenbett	Word automaticity of tree automatic ordinals is decidable	Folien
17:25-18:00	Fachgruppensitzung
ab 19:00 Uhr	gemeinsames Abendessen im Hotel Tanne
Samstag
9:30-10:30	Lutz Strüngmann	Finite automata presentable Abelian groups	Folien
10:30-11:10	Markus Lohrey	Isomorphism of regular trees and words	Folien
11:20-12:00	Manfred Schmidt-Schauß	On Conservativity of pure Haskell in Concurrent Haskell	Folien

Isolde Adler (Uni Frankfurt): The VC dimension of definable sets in graph classes

In machine learning, the problem of "concept learning" is to identify an unknown set from a given collection of sets. In the model of "probably approximately correct" (PAC) learning, the learner receives a number of samples and must be able to identify the unknown set approximately, in a probabilistic sense. It is well-known the the sample size for PAC learning is of the same order of magnitude as the Vapnik-Cervonenkis (VC) dimension of the given collection of sets.
We study the VC dimension of sets that are definable in some logic on graph classes. We show that for every subgraph closed graph class C,
- monadic second-order definable sets have bounded VC dimension on C if and