4 search results - page 1 / 1 » Learning Horn Expressions with LogAn-H |
ICML
2000
IEEE
14 years 6 months ago
2000
IEEE
EUROCOLT
1999
Springer
13 years 9 months ago
1999
Springer
We study the learnability of first order Horn expressions from equivalence and membership queries. We show that the class of expressions where every term in the consequent of a c...
IANDC
2006
13 years 5 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
ILP
2003
Springer
13 years 10 months ago
2003
Springer
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...