Logical and Relational Learning
From MaRDI portal
Publication:3514981
DOI10.1007/978-3-540-68856-3zbMath1203.68145MaRDI 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
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68T05: Learning and adaptive systems in artificial intelligence
68P05: Data structures
68N17: Logic programming
Related Items
Unnamed Item, Unnamed Item, Inference and learning in probabilistic logic programs using weighted Boolean formulas, Online learning of event definitions, Unnamed Item, Relational concept analysis: mining concept lattices from multi-relational data, Effective feature construction by maximum common subgraph sampling, Relational information gain, Reference classes and relational learning, ILP turns 20. Biography and future challenges, kLog: a language for logical and relational learning with kernels, Type extension trees for feature construction and learning in relational domains, Relational linear programming, Constraint acquisition, On the complexity of propositional and relational credal networks, Information systems in modeling interactive computations on granules, Interactive information systems: toward perception based computing, An expressive dissimilarity measure for relational clustering using neighbourhood trees, Relational data factorization, kProbLog: an algebraic Prolog for machine learning, The complexity of Bayesian networks specified by propositional and relational languages, 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, Speeding up parameter and rule learning for acyclic probabilistic logic programs, Learning programs by learning from failures, Inductive general game playing, Propositionalization and embeddings: two sides of the same coin, The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference, Some thoughts on knowledge-enhanced machine learning, Making sense of sensory input, Mining closed patterns in relational, graph and network data, A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics, 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, Complexity results for probabilistic answer set programming, On distinguishing sets of structures by first-order sentences of minimal quantifier rank, Lifted graphical models: a survey, The effect of combination functions on the complexity of relational Bayesian networks, Semi-supervised online structure learning for composite event recognition, Online probabilistic theory revision from examples with ProPPR, Association discovery from relational data via granular computing, Unnamed Item, Relational and Semantic Data Mining
