265 search results - page 21 / 53 » Weakly Algebraizable Logics |
FIDJI
2004
Springer
14 years 2 months ago
2004
Springer
We present a calculus for establishing non-interference of several Java threads running in parallel. The proof system is built atop an implemented sequential Java Dynamic Logic cal...
ICLP
2005
Springer
14 years 2 months ago
2005
Springer
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
WOLLIC
2010
Springer
14 years 1 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
We consider the supervised learning of a binary classifier from noisy observations. We use smooth boosting to linearly combine abstaining hypotheses, each of which maps a subcube...
TCS
2010
13 years 7 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...