1274 search results - page 112 / 255 » New Proofs for |
155
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, sev...
133
click to vote
IFM
2004
Springer
15 years 11 months ago
2004
Springer
Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express intera...
164
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
We show how a polynomial-time prover can commit to an arbitrary finite set Ë of strings so that, later on, he can, for any string Ü, reveal with a proof whether Ü ¾ Ë or Ü ...
155
click to vote
KR
2010
Springer
15 years 10 months ago
2010
Springer
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
169
click to vote
ECOOP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Component software means reuse and separate marketing of pre-manufactured binary components. This requires components from different vendors to be composed very late, pos...