64 search results - page 13 / 13 » Computability of Countable Subshifts |
ICDT
2010
ACM
14 years 2 months ago
2010
ACM
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
JSYML
2010
13 years 3 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
PAMI
2010
13 years 3 months ago
2010
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...