ALLPAD: approximate learning of logic programs with annotated disjunctions

DOI10.1007/s10994-007-5032-8zbMath1470.68163WikidataQ58063864 ScholiaQ58063864MaRDI QIDQ1009241

Fabrizio Riguzzi

Publication date: 31 March 2009

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-007-5032-8

zbMATH Keywords

inductive logic programming; statistical relational learning; probabilistic logic programming; logic programs with annotated disjunctions

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68N17: Logic programming

Related Items

Structure learning of probabilistic logic programs by searching the clause space, Applying the information bottleneck to statistical relational learning, Bandit-based Monte-Carlo structure learning of probabilistic logic programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The independent choice logic for modelling multiple agents under uncertainty
• The well-founded semantics for general logic programs
• Logic Programming
• Inductive Logic Programming
• Machine Learning: ECML 2004
• CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge
• Inductive Logic Programming
• The effect of relational background knowledge on learning of protein three-dimensional fold signatures