8228 search results - page 276 / 1646 » Structural Logical Relations |
177
Voted
STACS
1999
Springer
15 years 10 months ago
1999
Springer
The paper gives a logical characterisation of the class NTIME(n) of problems that can be solved on a nondeterministic Turing machine in linear time. It is shown that a set L of str...
181
click to vote
FOSSACS
2005
Springer
15 years 11 months ago
2005
Springer
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
112
click to vote
FSKD
2005
Springer
15 years 11 months ago
2005
Springer
It is important nowadays to provide guidance for individuals or organizations to improve their knowledge according to their objectives, especially in the case of incomplete cogniti...
153
click to vote
IDA
2001
Springer
15 years 10 months ago
2001
Springer
Fluents are logical descriptions of situations that persist, andcompositefluents are statistically significant temporal relationships(nearlyidentical withthosein Allen’stemporal...
176
Voted
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...