Computing the JTH solution of a first-order query

Guillaume Bagan (1) , Arnaud Durand (2) , Etienne Grandjean (3) , Frédéric Olive (4)

1 GREYC - Groupe de Recherche en Informatique, Image et Instrumentation de Caen
2 ELM - Équipe de Logique Mathématique
3 Equipe AMACC - Laboratoire GREYC - UMR6072
4 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166

We design algorithms of "optimal" data complexity for several natural problems about first-order queries on structures of bounded degree. For that purpose, we first introduce a framework to deal with logical or combinatorial problems R ⊂ I × O whose instances x 2 I may admit of several solutions R(x) = {y 2 O : (x, y) 2 R}.

Domaines: Algorithme et structure de données [cs.DS]

Guillaume Bagan, Arnaud Durand, Etienne Grandjean, Frédéric Olive. Computing the JTH solution of a first-order query. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2008, 42, pp.147-164. ⟨hal-00221730⟩