Computing the JTH solution of a first-order query - GREYC amacc Access content directly
Journal Articles RAIRO - Theoretical Informatics and Applications (RAIRO: ITA) Year : 2008

Computing the JTH solution of a first-order query

Abstract

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}.
Fichier principal
Vignette du fichier
bdgo.pdf (250.47 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00221730 , version 1 (29-01-2008)

Identifiers

  • HAL Id : hal-00221730 , version 1

Cite

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⟩
163 View
302 Download

Share

Gmail Facebook X LinkedIn More