360 search results - page 20 / 72 » Explanations and Proof Trees |
154
Voted
LICS
2003
IEEE
15 years 10 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
133
click to vote
AAAI
2010
15 years 6 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
161
click to vote
JAR
2010
15 years 5 days ago
2010
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
140
click to vote
ICLP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
134
Voted
IWMM
2000
Springer
15 years 9 months ago
2000
Springer
A new variant algorithm for distributed acyclic garbage detection is presented for use in hybrid garbage collectors. The existing fault-tolerance of Piquer's Indirect Referen...