57 search results - page 10 / 12 » Backtracking the rat way |
AAAI
1994
13 years 9 months ago
1994
We present a new property called constraint looseness and show how it can be used to estimate the level of local consistency of a binary constraint network. Speci cally, we presen...
APAL
2010
13 years 7 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
CL
1999
Springer
13 years 7 months ago
1999
Springer
Van Emden's incremental queries address the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. In the co...
BMCBI
2008
13 years 7 months ago
2008
Background: Recently, microarray data analyses using functional pathway information, e.g., gene set enrichment analysis (GSEA) and significance analysis of function and expression...
BMCBI
2008
13 years 7 months ago
2008
teps. First, we abstracted protein interactions onto orthologous cluster links. For a given source interaction, if both proteins belonged to a cluster, we constructed a link betwee...