On the problem of computing the well-founded semantics

DOI10.1017/S1471068401001053zbMATH Open1105.68348MaRDI QIDQ4452642FDOQ4452642

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)

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

zbMATH Keywords

alternating fixpoint

Mathematics Subject Classification ID

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

Cited In (9)

• Title not available (Why is that?)
• Safe computation of the well-founded semantics of datalog queries
• The alternating fixpoint of logic programs with negation
• Transformation-based bottom-up computation of the well-founded model
• Enhancing global SLS-resolution with loop cutting and tabling mechanisms
• A tutorial on the well-founded semantics
• Off-line parsability and the well-foundedness of subsumption
• Computing the well-founded semantics faster
• Transformation-based bottom-up computation of the well-founded model

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)