360 search results - page 15 / 72 » Explanations and Proof Trees |
DAM
1998
13 years 7 months ago
1998
We give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, l − 1, n − 1). The number P(k, l, n) counts noncrossing partitions of {1, 2, . . ...
LPAR
2012
Springer
12 years 3 months ago
2012
Springer
We motivate and introduce a query language PrQL designed for inspecting machine representations of proofs. PrQL natively supports hiproofs which express proof structure using hiera...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
State-of-the-art automated theorem provers (ATPs) are today able to solve relatively complicated mathematical problems. But as ATPs become stronger and more used by mathematicians...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We present a fully probabilistic stick-figure model that uses a nonparametric Bayesian distribution over trees for its structure prior. Sticks are represented by nodes in a tree i...
CSDA
2004
13 years 7 months ago
2004
A common approach to split selection in classification trees is to search through all possible splits generated by predictor variables. A splitting criterion is then used to evalu...