The following pages link to (Q5624681):
Displaying 50 items.
- Generating rules with predicates, terms and variables from the pruned neural networks (Q280332) (← links)
- Constructing simply recursive programs from a finite set of good examples (Q293131) (← links)
- Existential type systems between Church and Curry style (type-free style) (Q402117) (← links)
- Similarity measures over refinement graphs (Q420926) (← links)
- ILP turns 20. Biography and future challenges (Q439010) (← links)
- Learning concepts and their unions from positive data with refinement operators (Q513348) (← links)
- A note on the parallel complexity of anti-unification (Q688579) (← links)
- Efficient parallel term matching and anti-unification (Q688582) (← links)
- The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types (Q690505) (← links)
- Synthesis of rewrite programs by higher-order and semantic unification (Q749216) (← links)
- Learning failure-free PRISM programs (Q900370) (← links)
- Developments from enquiries into the learnability of the pattern languages from positive data (Q924175) (← links)
- On the connection between the phase transition of the covering test and the learning success rate in ILP (Q1009240) (← links)
- Structured machine learning: the next ten years (Q1009285) (← links)
- Semantic analysis of inductive reasoning (Q1081317) (← links)
- Generalized subsumption and its applications to induction and redundancy (Q1110345) (← links)
- Schema induction for logic program synthesis (Q1128483) (← links)
- Inductive reasoning on recursive equations (Q1136246) (← links)
- Multilevel counterfactuals for generalizations of relational concepts and productions (Q1145515) (← links)
- Reduction rules for resolution-based systems (Q1187214) (← links)
- Programming by examples (Q1255776) (← links)
- Top-down induction of first-order logical decision trees (Q1274285) (← links)
- Mixtus: An automatic partial evaluator for full Prolog (Q1313369) (← links)
- A compositional semantics for logic programs (Q1314414) (← links)
- Sound and complete partial deduction with unfolding based on well-founded measures (Q1314419) (← links)
- Logic program synthesis from incomplete specifications (Q1322854) (← links)
- The learnability of description logics with equality constraints (Q1342732) (← links)
- Learning unions of tree patterns using queries (Q1390942) (← links)
- Classificatory filtering in decision systems (Q1606224) (← links)
- The complexity of theory revision (Q1606294) (← links)
- Analogical program derivation based on type theory (Q1802072) (← links)
- Toward effective knowledge acquisition with first-order logic induction. (Q1850683) (← links)
- Learning closed Horn expressions (Q1854564) (← links)
- Evolution of rule-based programs (Q1878711) (← links)
- On inductive inference of cyclic structures (Q1924733) (← links)
- Abstracting symbolic matrices (Q1926589) (← links)
- Brave induction: a logical framework for learning from incomplete information (Q1959490) (← links)
- Top program construction and reduction for polynomial time meta-interpretive learning (Q2051277) (← links)
- A framework for approximate generalization in quantitative theories (Q2104546) (← links)
- Inclusion of domain-knowledge into GNNs using mode-directed inverse entailment (Q2127250) (← links)
- Order-sorted equational generalization algorithm revisited (Q2134938) (← links)
- Anti-unification and the theory of semirings (Q2215964) (← links)
- Mining closed patterns in relational, graph and network data (Q2248524) (← links)
- Meta-interpretive learning: application to grammatical inference (Q2251448) (← links)
- Learning from interpretation transition (Q2251449) (← links)
- From analogical proportion to logical proportions (Q2254553) (← links)
- A partial evaluation framework for order-sorted equational programs modulo axioms (Q2291823) (← links)
- Speeding up operations on feature terms using constraint programming and variable symmetry (Q2341834) (← links)
- Anti-unification for unranked terms and hedges (Q2352488) (← links)
- Higher-order pattern anti-unification in linear time (Q2362208) (← links)
