Inductive Logic Programming: Theory and methods
From MaRDI portal
Publication:4305633
DOI10.1016/0743-1066(94)90035-3zbMath0816.68043OpenAlexW1987902506WikidataQ29396928 ScholiaQ29396928MaRDI QIDQ4305633
Luc De Raedt, Stephen H. Muggleton
Publication date: 13 October 1994
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(94)90035-3
Related Items
Inductive constraint logic, Incremental learning of logic programs, Fifty Years of Prolog and Beyond, Learning programs with magic values, From Reinforcement Learning to Deep Reinforcement Learning: An Overview, Explanatory and creative alternatives to the MDL principle, Learning logic programs with structured background knowledge, Synthesizing learners tolerating computable noisy data, Polynomial-time learnability of logic programs with local variables from entailment, Probabilistic Inductive Logic Programming, Relational Sequence Learning, The Independent Choice Logic and Beyond, Using ILP to Construct Features for Information Extraction from Semi-structured Text, Incremental reasoning on monadic second-order logics with logic programming, Robust logics, Unnamed Item, The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx, Learning from interpretation transition using differentiable logic programming semantics, Inductive logic programming at 30, Inclusion of domain-knowledge into GNNs using mode-directed inverse entailment, Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition, Unnamed Item, Iterative versionspaces, Logic programs, iterated function systems, and recurrent radial basis function networks, Using abduction and induction for operational requirements elaboration, Nonmonotonic abductive inductive learning, Prolog Technology Reinforcement Learning Prover, An incremental concept formation approach for learning from databases, First-order \(jk\)-clausal theories are PAC-learnable, Conceptual Navigation in Large Knowledge Graphs, Description and classification of complex structured objects by applying similarity measures, The appropriateness of predicate invention as bias shift operation in ILP, Counting for satisfiability by inverting resolution, Unnamed Item, From learning in the limit to stochastic finite learning, Learning a subclass of regular patterns in polynomial time, Generating contrastive explanations for inductive logic programming based on a near miss approach, A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424., An integrated framework for the diagnosis and correction of rule-based programs, Learning Through Hypothesis Refinement Using Answer Set Programming, Logical settings for concept-learning, Constructive reinforcement learning, A framework for incremental learning of logic programs, FS-FOIL: An inductive learning method for extracting interpretable fuzzy descriptions, A logic programming approach to predict effective compiler settings for embedded software, Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited, All normalized anti-monotonic overlap graph measures are bounded, Online probabilistic theory revision from examples with ProPPR, Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model, An expressive dissimilarity measure for relational clustering using neighbourhood trees, Relational data factorization, Soft quantification in statistical relational learning, Relational IBL in classical music, Complexity parameters for first order classes, Application of abductive ILP to learning metabolic network inhibition from temporal data, Reference classes and relational learning, ILP turns 20. Biography and future challenges, Gradient-based boosting for statistical relational learning: the relational dependency network case, Applying the information bottleneck to statistical relational learning, Inverse subsumption for complete explanatory induction, Semiring programming: a semantic framework for generalized sum product problems, Unnamed Item, Unnamed Item, Brave induction: a logical framework for learning from incomplete information, Using the bottom clause and mode declarations in FOL theory revision from examples, An investigation into feature construction to assist word sense disambiguation, Fast learning of relational kernels, Unnamed Item, Learnability of quantified formulas., Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview, A Comparison between Two Statistical Relational Models, Learning hierarchical task network domains from partially observed plan traces, A strategy for quantum algorithm design assisted by machine learning, Sequential inference with reliable observations: Learning to construct force-dynamic models, Formulating the template ILP consistency problem as a constraint satisfaction problem, Inductive Logic Programming: Issues, results and the challenge of Learning Language in Logic, Learning customized and optimized lists of rules with mathematical programming, Some thoughts on knowledge-enhanced machine learning, Structure learning for relational logistic regression: an ensemble approach, Induction in linear logic, Variable Neighborhood Programming as a Tool of Machine Learning, Mining closed patterns in relational, graph and network data, Improving inductive logic programming by using simulated annealing, TeLEx: learning signal temporal logic from positive examples using tightness metric, Distribution-based aggregation for relational learning with identifier attributes, Reducing one class of machine learning algorithms to logical operations of plausible reasoning, Generalized median graphs and applications, On the complexity of entailment in existential conjunctive first-order logic with atomic negation, Unnamed Item, Graph-FCA: an extension of formal concept analysis to knowledge graphs, Analytical Inductive Functional Programming, Learning probabilistic logic models from probabilistic examples, Structured machine learning: the next ten years, Incremental learning of event definitions with inductive logic programming, Performance-friendly rule extraction in large water data-sets with AOC posets and relational concept analysis, Predictive spreadsheet autocompletion with constraints, Rethinking epistemic logic with belief bases, Abduction-Based Search for Cooperative Answers, Analyzing differentiable fuzzy logic operators, Non-parametric learning of lifted restricted Boltzmann machines, Top-down induction of first-order logical decision trees, Statistical Relational Learning with Soft Quantifiers, Introducing possibilistic logic in ILP for dealing with exceptions, Knowledge representation analysis of graph mining, Beyond graph neural networks with lifted relational neural networks, Some classes of Prolog programs inferable from positive data, Any-world assumptions in logic programming, On distinguishing sets of structures by first-order sentences of minimal quantifier rank, Frequent mining of subgraph structures, A Proposal for Extending Formal Concept Analysis to Knowledge Graphs, The synthesis of language learners., Learning closed Horn expressions, Unnamed Item, Unnamed Item, Meta-interpretive learning as metarule specialisation, Lifted graphical models: a survey, Mind change complexity of learning logic programs
