Approximate Inference for Logic Programs with Annotated Disjunctions

DOI10.1007/978-3-642-21295-6_7MaRDI QIDQ3007594zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Stefano Bragaglia, Fabrizio Riguzzi

Publication date 17 June 2011

Published in Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21295-6_7

zbMATH Keywords

ProbLogprobabilistic inductive logic programminglogic programs with annotated disjunctions

Mathematics Subject Classification ID

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

Recommendations

• Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
• Inductive Logic Programming
• Logic Programming
• Determining inference semantics for disjunctive logic programs
• ALLPAD: approximate learning of logic programs with annotated disjunctions
• scientific article; zbMATH DE number 2089453
• An abductive approach to disjunctive logic programming
• SLGAD resolution for inference on logic programs with annotated disjunctions

Cited in

(15)

• The magic of logical inference in probabilistic programming
• Probabilistic abstract argumentation frameworks, a possible world view
• Towards Learning Non-recursive LPADs by Transforming Them into Bayesian Networks
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
• ALLPAD: approximate learning of logic programs with annotated disjunctions
• Probabilistic (logic) programming concepts
• An OpenCL implementation of a forward sampling algorithm for CP-logic
• SLGAD resolution for inference on logic programs with annotated disjunctions
• Structure learning of probabilistic logic programs by searching the clause space
• Constraint-based inference in probabilistic logic programs
• Computing \(\mathrm{LP}^{\mathrm{MLN}}\) using ASP and MLN solvers
• Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions
• Inductive Logic Programming
• k-optimal: a novel approximate inference algorithm for ProbLog

This page was built for publication: Approximate Inference for Logic Programs with Annotated Disjunctions

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