1076 search results - page 52 / 216 » Operations on proofs and labels |
130
Voted
AIML
2006
15 years 2 months ago
2006
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference ...
109
click to vote
RSA
2011
14 years 3 months ago
2011
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
NIPS
2004
15 years 2 months ago
2004
We provide a principle for semi-supervised learning based on optimizing the rate of communicating labels for unlabeled points with side information. The side information is expres...
CADE
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...
151
click to vote
CL
2000
Springer
15 years 5 months ago
2000
Springer
We describe a system for the synthesis of logic programs from specifications based on higher-order logical descriptions of appropriate refinement operations. The system has been ...