Efficient Computation of the Well-Founded Model Using Update Propagation

DOI10.1007/3-540-45653-8_29MaRDI QIDQ2996181zbMATH OpenOpenAlexFDO

Authors Andreas Behrend

Publication date 6 May 2011

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45653-8_29

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Recommendations

• A comparison of updating algorithms for large \(N\) reduced models
• Foundations of tree-like local model updates
• Computationally efficient methods for estimating the updated-observations SUR models
• Fast model updating coupling Bayesian inference and PGD model reduction
• Efficient local updates for undirected graphical models
• Transformation-based bottom-up computation of the well-founded model
• Fast update of conditional simulation ensembles
• Alternating projection method for sparse model updating problems
• Model updating using constrained optimization

Cited in

(7)

• scientific article; zbMATH DE number 1696828 (Why is no real title available?)
• Transformation-based bottom-up computation of the well-founded model
• On the problem of computing the well-founded semantics
• Computing the well-founded semantics faster
• Advances in Databases and Information Systems
• Layerings of logic programs -- layer decomposable semantics and incremental model computation
• Transformation-based bottom-up computation of the well-founded model

This page was built for publication: Efficient Computation of the Well-Founded Model Using Update Propagation

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