181 search results - page 6 / 37 » Effective characterizations of tree logics |
FSKD
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents an investigation into the combination of different classifiers for toxicity prediction. These classification methods involved in generating classifiers for comb...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
AML
2010
13 years 7 months ago
2010
We investigate the development of terms during cut-elimination in first-order logic and Peano arithmetic for proofs of existential formulas. The form of witness terms in cut-free p...
ICDT
2005
ACM
14 years 1 months ago
2005
ACM
We give two sufficient conditions on XPath like languages for having first order expressivity, meaning that every first order definable set of paths in an ordered node-labeled t...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
We define an extension of forest algebra for -forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To ...