scientific article; zbMATH DE number 1104356

MaRDI QIDQ4370231zbMATH OpenFDO

Authors Hiroki Arimura

Publication date 14 January 1998

zbMATH Keywords

active learningacyclic constrained Horn programsfirst-order Horn sentenceHorn clauseslearning from entailmentleast general generalizationpolynomial time learning algorithm

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning closed Horn expressions
• Learning function-free Horn expressions
• Learning conjunctions of Horn clauses
• scientific article; zbMATH DE number 1759243
• Probably approximately correct learning of Horn envelopes from queries

Cited in

(10)

• Learning closed Horn expressions
• Learning elementary formal systems with queries.
• Complexity parameters for first order classes
• Polynomial certificates for propositional classes
• Prediction-hardness of acyclic conjunctive queries
• The subsumption lattice and query learning
• Exact learning of lightweight description logic ontologies
• Learning logic programs with structured background knowledge
• Polynomial-time learnability of logic programs with local variables from entailment
• Hypothesis finding with proof theoretical appropriateness criteria

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370231)