scientific article; zbMATH DE number 1149414

zbMATH Open0900.68132MaRDI QIDQ4386935FDOQ4386935

Authors: W. W. Cohen 

Publication date: 10 May 1998

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1149415
• Pac-learning non-recursive Prolog clauses
• Learning logic programs with structured background knowledge
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• Polynomial-time learnability of logic programs with local variables from entailment

Mathematics Subject Classification ID

Logic programming (68N17) Parallel algorithms in computer science (68W10)

Cited In (17)

• Complexity parameters for first order classes
• The complexity of theory revision
• Prediction-hardness of acyclic conjunctive queries
• Title not available (Why is that?)
• Title not available (Why is that?)
• Learning closed Horn expressions
• Pac-learning non-recursive Prolog clauses
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• Polynomial-time learnability of logic programs with local variables from entailment
• Title not available (Why is that?)
• Mind change complexity of learning logic programs
• Some classes of Prolog programs inferable from positive data
• A framework for incremental learning of logic programs
• Pac-learning non-recursive Prolog clauses
• Learning logic programs with structured background knowledge
• WHIRL: A word-based information representation language
• LARS: a learning algorithm for rewriting systems

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 Q4386935)