8 search results - page 2 / 2 » lfcs 1992 |
LFCS
1992
Springer
13 years 9 months ago
1992
Springer
Among non-monotonic systems of reasoning, non-monotonic modal logics, and autoepistemic logic in particular, have had considerable success. The presence of explicit modal operator...
LFCS
1992
Springer
13 years 9 months ago
1992
Springer
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
LFCS
1992
Springer
13 years 9 months ago
1992
Springer
This paper proves that "promise classes" are so fragilely structured that they do not robustly (i.e. with respect to all oracles) possess Turinghard sets even in classes...