The following pages link to Learning closed Horn expressions (Q1854564):
Displaying 13 items.
- Construction and learnability of canonical Horn formulas (Q415621) (← links)
- Learning definite Horn formulas from closure queries (Q507524) (← links)
- Learning conditional preference networks (Q991013) (← links)
- Learning orthogonal F-Horn formulas (Q1390949) (← links)
- Learning a subclass of \(k\)-quasi-Horn formulas with membership queries (Q1944948) (← links)
- Learning function-free Horn expressions (Q1969319) (← links)
- Probably approximately correct learning of Horn envelopes from queries (Q2286380) (← links)
- Complexity parameters for first order classes (Q2433181) (← links)
- Polynomial certificates for propositional classes (Q2495655) (← links)
- The subsumption lattice and query learning (Q2581757) (← links)
- (Q4558528) (← links)
- (Q5381121) (← links)
- On the non-efficient PAC learnability of conjunctive queries (Q6072217) (← links)
