1717 search results - page 337 / 344 » A Computable Spectral Theorem |
66
Voted
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
There are many situations where an agent can perform one of several sets of actions in responses to changes in its environment, and the agent chooses to perform the set of actions...
104
click to vote
CONCUR
2004
Springer
15 years 5 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
106
Voted
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
88
Voted
LICS
2002
IEEE
15 years 5 months ago
2002
IEEE
The automated construction of mathematical proof is a basic activity in computing. Since the dawn of the field of automated reasoning, there have been two divergent schools of tho...
88
Voted
CHARME
2001
Springer
15 years 4 months ago
2001
Springer
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...