Sciweavers

360 search results - page 13 / 72
» Explanations and Proof Trees
Sort
View
AAAI
2010
13 years 9 months ago
Parallel Depth First Proof Number Search
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
Tomoyuki Kaneko
AMAST
2004
Springer
14 years 29 days ago
A Generic Software Safety Document Generator
Abstract. Formal certification is based on the idea that a mathematical proof of some property of a piece of software can be regarded as a certificate of correctness which, in pr...
Ewen Denney, Ram Prasad Venkatesan
AAAI
2004
13 years 9 months ago
On the Optimality of Probability Estimation by Random Decision Trees
Random decision tree is an ensemble of decision trees. The feature at any node of a tree in the ensemble is chosen randomly from remaining features. A chosen discrete feature on a...
Wei Fan
SAS
2007
Springer
140views Formal Methods» more  SAS 2007»
14 years 1 months ago
Formalised Inductive Reasoning in the Logic of Bunched Implications
We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framewo...
James Brotherston
ICALP
2009
Springer
14 years 7 months ago
On Cartesian Trees and Range Minimum Queries
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
Erik D. Demaine, Gad M. Landau, Oren Weimann