Transformation-based bottom-up computation of the well-founded model

DOI10.1007/BFB0023807zbMATH Open1547.68085MaRDI QIDQ6623799FDOQ6623799

Authors: Stefan Brass, Ulrich Zukowski, Burkhard Freitag 

Publication date: 24 October 2024

Recommendations

• Transformation-based bottom-up computation of the well-founded model
• Efficient Computation of the Well-Founded Model Using Update Propagation
• Bottom-up evaluation and query optimization of well-founded models
• On the problem of computing the well-founded semantics
• scientific article; zbMATH DE number 1696828

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15) Semantics in the theory of computing (68Q55)

Cites Work

• The well-founded semantics for general logic programs
• The alternating fixpoint of logic programs with negation
• Autoepistemic logic
• Characterizations of the stable semantics by partial evaluation
• Unfold⧸fold transformation of general logic programs for the well-founded semantics
• On the correctness of unfold/fold transformation of normal and extended logic programs
• Tabled evaluation with delaying for general logic programs
• Bottom-up evaluation and query optimization of well-founded models
• Efficient top-down computation of queries under the well-founded semantics
• Characterizing D-WFS: confluence and iterated GCWA

This page was built for publication: Transformation-based bottom-up computation of the well-founded model

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