1717 search results - page 199 / 344 » A Computable Spectral Theorem |
147
click to vote
LICS
2008
IEEE
16 years 12 days ago
2008
IEEE
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
174
click to vote
LICS
2006
IEEE
16 years 15 hour ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
154
click to vote
ICPADS
2005
IEEE
15 years 11 months ago
2005
IEEE
Peer-to-Peer (P2P) applications typically use overlay networks to forward the content queries. However, due to the distributed fashion of the overlay establishment, the overlay ne...
140
click to vote
SAT
2004
Springer
15 years 11 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...
158
click to vote
OOPSLA
2001
Springer
15 years 10 months ago
2001
Springer
Checking pre- and post-conditions of procedures and methods at runtime helps improve software reliability. In the procedural world, pre- and post-conditions have a straightforward...