3552 search results - page 587 / 711 » Proof theory in the abstract |
174
click to vote
ACISP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
174
click to vote
ICCBR
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Planning the ongoing care of Alzheimer's Disease (AD) patients is a complex task, marked by cases that change over time, multiple perspectives, and ethical issues. G...
169
click to vote
CADE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
191
click to vote
ICS
2010
Tsinghua U.
15 years 10 months ago
2010
Tsinghua U.
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
177
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...