10568 search results - page 669 / 2114 » Computer Intelligence and Formalization |
201
click to vote
ENTCS
2008
15 years 7 months ago
2008
Normalization for the simply-typed -calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait'...
185
click to vote
APAL
2006
15 years 7 months ago
2006
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
168
click to vote
DCC
2007
IEEE
15 years 7 months ago
2007
IEEE
A sliding-window dynamic frameproof code is a scheme for discouraging the piracy of digital broadcasts through the use of digital fingerprinting. In this paper we formally defin...
148
click to vote
SIAMAM
2008
15 years 7 months ago
2008
In this paper we define a class of formal neuron models being computationally efficient and biologically plausible, i.e., able to reproduce a wide range of behaviors observed in in...
231
click to vote
TCS
1998
15 years 6 months ago
1998
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...