419 search results - page 4 / 84 » First Order Paths in Ordered Trees |
ILP
2004
Springer
14 years 1 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
DATESO
2004
13 years 10 months ago
2004
In this paper we present a storage method for sets of first order logic terms in a relational database using function symbols based indexing method of Discrimination trees. This is...
KDD
1995
ACM
14 years 2 days ago
1995
ACM
This paper introduces a newalgorithm called SIAO1 for learning first order logic rules withgenetic algorithms. SIAO1uses the covering principle developed in AQwhereseed examplesar...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
JAR
2010
13 years 3 months 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...