2303 search results - page 359 / 461 » On the logic of argumentation theory |
166
click to vote
CSL
2007
Springer
16 years 18 days ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
164
click to vote
MKM
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. There are many styles for the narrative structure of a mathematical document. Each mathematician has its own conventions and traditions about labeling portions of texts (...
175
click to vote
ICFP
2005
ACM
15 years 12 months ago
2005
ACM
Narrowing-driven partial evaluation is a powerful technique for the specialization of (first-order) functional and functional logic programs. However, although it gives good resu...
147
click to vote
CHES
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. It has recently been shown that logic circuits in the implementation of cryptographic algorithms, although protected by “secure” random masking schemes, leak side-cha...
160
click to vote
DALT
2005
Springer
15 years 12 months ago
2005
Springer
Agents need to be able to change their beliefs; in particular, they should be able to contract or remove a certain belief in order to restore consistency to their set of beliefs, a...