884 search results - page 137 / 177 » A Proof Theory for DL-Lite |
WWW
2007
ACM
16 years 14 days ago
2007
ACM
Cryptographic protocols are useful for trust engineering in Web transactions. The Cryptographic Protocol Programming Language (CPPL) provides a model wherein trust management anno...
STOC
2009
ACM
16 years 12 days ago
2009
ACM
An affine disperser over Fn 2 for sources of dimension d is a function f : Fn 2 F2 such that for any affine space S Fn 2 of dimension at least d, we have {f(s) : s S} = F2. Aff...
100
click to vote
KDD
2008
ACM
16 years 6 days ago
2008
ACM
We propose a family of novel cost-sensitive boosting methods for multi-class classification by applying the theory of gradient boosting to p-norm based cost functionals. We establ...
173
click to vote
POPL
2008
ACM
16 years 3 days ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
199
click to vote
POPL
2007
ACM
16 years 3 days ago
2007
ACM
Separation Logic, Ambient Logic and Context Logic are based on a similar style of reasoning about structured data. They each consist of a structural (separating) composition for r...