5378 search results - page 92 / 1076 » Base Logics in Argumentation |
133
click to vote
WETICE
1996
IEEE
15 years 10 months ago
1996
IEEE
This paper explores generating and conveying confidence in enterprise security. An enterprise assurance framework provides a structure enterprise assurance evidence that strengthe...
156
click to vote
ENTCS
2008
15 years 6 months ago
2008
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...
175
click to vote
JACM
2006
15 years 6 months ago
2006
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
137
click to vote
IPL
2007
15 years 5 months ago
2007
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
186
click to vote
COGSCI
2010
15 years 4 months ago
2010
Natural language is full of patterns that appear to fit with general linguistic rules but are ungrammatical. There has been much debate over how children acquire these ‘‘ling...