Logical and Relational Learning
From MaRDI portal
Publication:3514981
DOI10.1007/978-3-540-68856-3zbMath1203.68145OpenAlexW4293249558MaRDI QIDQ3514981
Publication date: 23 July 2008
Published in: Cognitive Technologies (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/245012
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05) Logic programming (68N17)
Related Items (51)
Inductive logic programming at 30 ⋮ Relational and Semantic Data Mining ⋮ Relational concept analysis: mining concept lattices from multi-relational data ⋮ Unnamed Item ⋮ The effect of combination functions on the complexity of relational Bayesian networks ⋮ A Comprehensive Framework for Learning Declarative Action Models ⋮ Machine learning and logic: a new frontier in artificial intelligence ⋮ Fuzzy OWL-Boost: learning fuzzy concept inclusions via real-valued boosting ⋮ Inference and learning in probabilistic logic programs using weighted Boolean formulas ⋮ Online learning of event definitions ⋮ Effective feature construction by maximum common subgraph sampling ⋮ Relational information gain ⋮ Semi-supervised online structure learning for composite event recognition ⋮ Online probabilistic theory revision from examples with ProPPR ⋮ Rule Induction and Reasoning over Knowledge Graphs ⋮ An expressive dissimilarity measure for relational clustering using neighbourhood trees ⋮ Relational data factorization ⋮ kProbLog: an algebraic Prolog for machine learning ⋮ Inductive general game playing ⋮ Propositionalization and embeddings: two sides of the same coin ⋮ Reference classes and relational learning ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ ILP turns 20. Biography and future challenges ⋮ Information systems in modeling interactive computations on granules ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ Unnamed Item ⋮ Using the bottom clause and mode declarations in FOL theory revision from examples ⋮ Cluster-grouping: from subgroup discovery to clustering ⋮ Fast learning of relational kernels ⋮ Association discovery from relational data via granular computing ⋮ kLog: a language for logical and relational learning with kernels ⋮ Type extension trees for feature construction and learning in relational domains ⋮ Some thoughts on knowledge-enhanced machine learning ⋮ Making sense of sensory input ⋮ Relational linear programming ⋮ Constraint acquisition ⋮ On the complexity of propositional and relational credal networks ⋮ Mining closed patterns in relational, graph and network data ⋮ A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics ⋮ Speeding up parameter and rule learning for acyclic probabilistic logic programs ⋮ Unnamed Item ⋮ Interactive information systems: toward perception based computing ⋮ The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws ⋮ Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games ⋮ Predicting the Evolution of Communities with Online Inductive Logic Programming ⋮ Learning programs by learning from failures ⋮ Complexity results for probabilistic answer set programming ⋮ Unnamed Item ⋮ On distinguishing sets of structures by first-order sentences of minimal quantifier rank ⋮ Unnamed Item ⋮ Lifted graphical models: a survey
This page was built for publication: Logical and Relational Learning
