On the problem of computing the well-founded semantics

DOI10.1017/S1471068401001053MaRDI QIDQ4452642zbMATH OpenFDO

Authors Zbigniew Lonc, Mirosław Truszczyński

Publication date 1 March 2004

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S1471068401001053

zbMATH Keywords

alternating fixpoint

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1696828
• Efficient top-down computation of queries under the well-founded semantics
• Computing the well-founded semantics faster
• A tutorial on the well-founded semantics
• Efficient Computation of the Well-Founded Model Using Update Propagation

Cited in

(10)

• Safe computation of the well-founded semantics of datalog queries
• Off-line parsability and the well-foundedness of subsumption
• scientific article; zbMATH DE number 1696828 (Why is no real title available?)
• Efficient top-down computation of queries under the well-founded semantics
• Transformation-based bottom-up computation of the well-founded model
• Computing the well-founded semantics faster
• A tutorial on the well-founded semantics
• Transformation-based bottom-up computation of the well-founded model
• The alternating fixpoint of logic programs with negation
• Enhancing global SLS-resolution with loop cutting and tabling mechanisms

This page was built for publication: On the problem of computing the well-founded semantics

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