SLGAD resolution for inference on logic programs with annotated disjunctions

MaRDI QIDQ3005897zbMATH OpenFDO

Authors Fabrizio Riguzzi

Publication date 10 June 2011

Full work available at URL http://iospress.metapress.com/content/h284771xj3rv48v1/fulltext.html

zbMATH Keywords

probabilistic logic programmingwell-founded semanticslogic programs with annotated disjunctionsSLG resolution

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
• Approximate Inference for Logic Programs with Annotated Disjunctions
• Logic Programming
• ALLPAD: approximate learning of logic programs with annotated disjunctions
• Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions

Cited in

(8)

• Approximate Inference for Logic Programs with Annotated Disjunctions
• Logic Programming
• Applying the information bottleneck to statistical relational learning
• Towards Learning Non-recursive LPADs by Transforming Them into Bayesian Networks
• ALLPAD: approximate learning of logic programs with annotated disjunctions
• An OpenCL implementation of a forward sampling algorithm for CP-logic
• Structure learning of probabilistic logic programs by searching the clause space
• SLR inference: An inference system for fixed-mode logic programs, based on SLR parsing

This page was built for publication: SLGAD resolution for inference on logic programs with annotated disjunctions

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