A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Computing thejth solution of a first-order query

2008
*
RAIRO - Theoretical Informatics and Applications
*

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 ∈ I may admit of several solutions R(x) = {y ∈ O : (x, y) ∈ R}. One associates to such a problem several specific tasks : compute a random (for the uniform probability distribution) solution y ∈ R(x); enumerate without repetition each

doi:10.1051/ita:2007046
fatcat:ab3ki2rkufa4hbk5l7bej7fmoy