scientific article; zbMATH DE number 3412190

From MaRDI portal
Publication:5677085

zbMath0261.68042MaRDI QIDQ5677085

Gordon D. Plotkin

Publication date: 1971


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (28)

Hypothesis finding based on upward refinement of residue hypotheses.FOLD-RM: A Scalable, Efficient, and Explainable Inductive Learning Algorithm for Multi-Category Classification of Mixed DataGenerating rules with predicates, terms and variables from the pruned neural networksESBL: An integrated method for learning from partial informationGeneralized subsumption and its applications to induction and redundancyFOLD-R++: a scalable toolset for automated inductive learning of default theories from mixed dataSchema induction for logic program synthesisInductive reasoning on recursive equationsOn the generation of quantified lemmasA new algorithm to automate inductive learning of default theoriesInductive equivalence in clausal logic and nonmonotonic logic programmingEffective feature construction by maximum common subgraph samplingLearning efficient logic programs\(\alpha\)ILP: thinking visual scenes as differentiable logic programsExploiting domain knowledge to detect outliersILP turns 20. Biography and future challengesUnnamed ItemThe lattice structure and refinement operators for the hypothesis space bounded by a bottom clauseWhite-box Induction From SVM Models: Explainable AI with Logic ProgrammingE-generalization using grammarsGENEX: a tool for testing in ILPEfficient parallel term matching and anti-unificationTotal complexity and the inference of best programsLearning logic programs with structured background knowledgeMind change efficient learningTop program construction and reduction for polynomial time meta-interpretive learningToward effective knowledge acquisition with first-order logic induction.Formal logics of discovery and hypothesis formation by machine




This page was built for publication: