Probabilistic inductive constraint logic
type: Item
instance of: scholarly article
title: Probabilistic inductive constraint logic
author: Fabrizio Riguzzi
author: Elena Bellodi
author: Riccardo Zese
author: Marco Alberti
author: Evelina Lamma
published in: Machine Learning
publication date: 2021-11-24T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 7432819
describes a project that uses: L-BFGS
describes a project that uses: ProbLog
describes a project that uses: SWI-Prolog
describes a project that uses: PRISM
describes a project that uses: SCIFF
MaRDI profile type: Publication
full work available at URL: s10994-020-05911-6
OpenAlex ID: W3103051011
cites work: Distributed Parameter Learning for Probabilistic Ontologies
cites work: Verifiable agent interaction in abductive logic programming
cites work: Q3983042
cites work: Structure learning of probabilistic logic programs by searching the clause space
cites work: Top-down induction of first-order logical decision trees
cites work: Q5604990
cites work: ProbLog Technology for Inference in a Probabilistic First Order Logic
cites work: Clausal discovery
cites work: First-order \(jk\)-clausal theories are PAC-learnable
cites work: Q4139463
cites work: Bandit-based Monte-Carlo structure learning of probabilistic logic programs
cites work: Naive Bayesian classification of structured data
cites work: Q4631194
cites work: A Survey of Fast Exponentiation Methods
cites work: Q3785940
cites work: Applying Inductive Logic Programming to Process Mining
cites work: Lifted discriminative learning of probabilistic logic programs
cites work: Updating Quasi-Newton Matrices with Limited Storage
cites work: Logic programming, abduction and probability. A top-down anytime algorithm for estimating prior and posterior probabilities
cites work: The independent choice logic for modelling multiple agents under uncertainty
cites work: Q4411158
cites work: Robust classification for imprecise environments
cites work: Markov logic networks
cites work: Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
cites work: Well–definedness and efficient inference for probabilistic logic programming under the distribution semantics
cites work: Logic Programming
cites work: SWI-Prolog
DOI: 10.1007/S10994-020-05911-6
description: scientific article; zbMATH DE number 7432819