scientific article; zbMATH DE number 3349329
From MaRDI portal
Publication:5624681
zbMath0219.68045MaRDI QIDQ5624681
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (93)
Higher-order pattern anti-unification in linear time ⋮ Semantic analysis of inductive reasoning ⋮ Evolution of rule-based programs ⋮ Generating rules with predicates, terms and variables from the pruned neural networks ⋮ Inclusion of domain-knowledge into GNNs using mode-directed inverse entailment ⋮ A New Algorithm for Computing Least Generalization of a Set of Atoms ⋮ Metaphors and heuristic-driven theory projection (HDTP) ⋮ Constructing simply recursive programs from a finite set of good examples ⋮ Order-sorted equational generalization algorithm revisited ⋮ The learnability of description logics with equality constraints ⋮ Collaborative vs. Conflicting Learning, Evolution and Argumentation ⋮ Generalized subsumption and its applications to induction and redundancy ⋮ Theory blending: extended algorithmic aspects and examples ⋮ Unranked second-order anti-unification ⋮ A Library of Anti-unification Algorithms ⋮ ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance ⋮ On inductive inference of cyclic structures ⋮ Schema induction for logic program synthesis ⋮ Abstracting symbolic matrices ⋮ Learning unions of tree patterns using queries ⋮ Inductive reasoning on recursive equations ⋮ Automatic refinement to efficient data structures: a comparison of two approaches ⋮ On the generation of quantified lemmas ⋮ Existential type systems between Church and Curry style (type-free style) ⋮ Inductive constraint logic ⋮ Symbolic Specialization of Rewriting Logic Theories with Presto ⋮ Concolic testing in logic programming ⋮ Analogical logic program synthesis algorithm that can refute inappropriate similarities ⋮ Maximal closed set and half-space separations in finite closure systems ⋮ Anti-unification in Constraint Logic Programming ⋮ Learning efficient logic programs ⋮ Multilevel counterfactuals for generalizations of relational concepts and productions ⋮ Learning failure-free PRISM programs ⋮ Variant-based equational anti-unification ⋮ Similarity measures over refinement graphs ⋮ First order random forests: Learning relational classifiers with complex aggregates ⋮ ILP turns 20. Biography and future challenges ⋮ A modular order-sorted equational generalization algorithm ⋮ Brave induction: a logical framework for learning from incomplete information ⋮ Rule Calculus: Semantics, Axioms and Applications ⋮ Anti-unification and the theory of semirings ⋮ Developments from enquiries into the learnability of the pattern languages from positive data ⋮ Term-Graph Anti-Unification ⋮ A Model to Study Phase Transition and Plateaus in Relational Learning ⋮ Brave Induction ⋮ E-generalization using grammars ⋮ Reduction rules for resolution-based systems ⋮ GENEX: a tool for testing in ILP ⋮ Learning concepts and their unions from positive data with refinement operators ⋮ Learning unions of tree patterns using queries ⋮ Mining closed patterns in relational, graph and network data ⋮ A note on the parallel complexity of anti-unification ⋮ Efficient parallel term matching and anti-unification ⋮ Meta-interpretive learning: application to grammatical inference ⋮ Learning from interpretation transition ⋮ The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types ⋮ From analogical proportion to logical proportions ⋮ Heuristic-Driven Theory Projection: An Overview ⋮ Learning logic programs with structured background knowledge ⋮ Mind change efficient learning ⋮ Pac-learning non-recursive Prolog clauses ⋮ Proof Relevant Corecursive Resolution ⋮ Probabilistic Inductive Logic Programming ⋮ On Generalization and Subsumption for Ordered Clauses ⋮ A Modular Equational Generalization Algorithm ⋮ Analytical Inductive Functional Programming ⋮ Pac-learning non-recursive Prolog clauses ⋮ A partial evaluation framework for order-sorted equational programs modulo axioms ⋮ Programming by examples ⋮ A new application for explanation-based generalisation within automated deduction ⋮ Analogical program derivation based on type theory ⋮ A certifying square root and division elimination ⋮ On the connection between the phase transition of the covering test and the learning success rate in ILP ⋮ Structured machine learning: the next ten years ⋮ Top program construction and reduction for polynomial time meta-interpretive learning ⋮ Synthesis of rewrite programs by higher-order and semantic unification ⋮ A Generic Framework for Higher-Order Generalizations. ⋮ Top-down induction of first-order logical decision trees ⋮ Learning Inference by Induction ⋮ Order-Sorted Generalization ⋮ Precedence-inclusion patterns and relational learning ⋮ Toward effective knowledge acquisition with first-order logic induction. ⋮ Speeding up operations on feature terms using constraint programming and variable symmetry ⋮ Learning closed Horn expressions ⋮ The subsumption lattice and query learning ⋮ A framework for approximate generalization in quantitative theories ⋮ Mixtus: An automatic partial evaluator for full Prolog ⋮ A compositional semantics for logic programs ⋮ Sound and complete partial deduction with unfolding based on well-founded measures ⋮ Classificatory filtering in decision systems ⋮ The complexity of theory revision ⋮ Anti-unification for unranked terms and hedges ⋮ Logic program synthesis from incomplete specifications
This page was built for publication:
