Learning to rank in PRISM

DOI10.1016/J.IJAR.2017.11.011MaRDI QIDQ1726418zbMATH OpenOpenAlexFDO

Authors Ryosuke Kojima, Taisuke Sato

Publication date 20 February 2019

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2017.11.011

zbMATH Keywords

learning to rankpreference learningPRISMprobabilistic logic programming languageranking

Mathematics Subject Classification ID

Logic programming (68N17) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Lifted discriminative learning of probabilistic logic programs
• New Advances in Logic-Based Probabilistic Modeling by PRISM
• Inferring from an Imprecise Plackett–Luce Model: Application to Label Ranking
• Learning failure-free PRISM programs
• Inference and learning in probabilistic logic programs using weighted Boolean formulas

Cites work

• 10.1162/1532443041827916
• scientific article; zbMATH DE number 1696801 (Why is no real title available?)
• scientific article; zbMATH DE number 1753155 (Why is no real title available?)
• Infinite probability computation by cyclic explanation graphs
• Learning to Rank for Information Retrieval
• Linear tabling strategies and optimizations
• Logic Programming
• Markov logic networks
• New Advances in Logic-Based Probabilistic Modeling by PRISM
• On the implementation of the probabilistic logic programming language ProbLog
• The Independent Choice Logic and Beyond
• Variational Bayes via propositionalized probability computation in PRISM
• Viterbi training in PRISM

Describes a project that uses

Uses Software

• ADADELTA
• ProbLog
• Adam

This page was built for publication: Learning to rank in PRISM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1726418)