146 search results - page 9 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
157
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
161
click to vote
CIE
2009
Springer
16 years 19 days ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
168
click to vote
COLT
1992
Springer
15 years 10 months ago
1992
Springer
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
131
click to vote
DCC
2001
IEEE
16 years 5 months ago
2001
IEEE
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
160
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...