Inductive Logic Programming

DOI10.1007/11536314zbMath1134.68507OpenAlexW2770134670MaRDI QIDQ5394642

Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe, Jan Ramon

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11536314

zbMATH Keywords

Bayesian networksknowledge representationBayesian Logic ProgramsProbabilistic Relational ModelsProbabilistic-logical models

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17)

Related Items (16)

Learning directed probabilistic logical models: Ordering-search versus structure-search ⋮ Learning first-order probabilistic models with combining rules ⋮ Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence ⋮ Probabilistic (logic) programming concepts ⋮ Nearly exact mining of frequent trees in large networks ⋮ The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference ⋮ Gradient-based boosting for statistical relational learning: the relational dependency network case ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ Graph sampling with applications to estimating the number of pattern embeddings and the parameters of a statistical relational model ⋮ A Survey of First-Order Probabilistic Models ⋮ A Survey of Directed Entity-Relation--Based First-Order Probabilistic Languages ⋮ PRL: a probabilistic relational language ⋮ New Advances in Logic-Based Probabilistic Modeling by PRISM ⋮ ALLPAD: approximate learning of logic programs with annotated disjunctions ⋮ Generalized ordering-search for learning directed probabilistic logical models ⋮ Learning relational dependency networks in hybrid domains

This page was built for publication: Inductive Logic Programming