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}.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00221730
Contributor : Hal System <>
Submitted on : Tuesday, January 29, 2008 - 9:13:42 AM
Last modification on : Tuesday, April 2, 2019 - 2:35:20 AM
Long-term archiving on : Thursday, September 27, 2012 - 5:45:56 PM

File

bdgo.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00221730, version 1

Citation

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), EDP Sciences, 2008, pp.147-164. ⟨hal-00221730⟩

Share

Metrics

Record views

256

Files downloads

325