scientific article; zbMATH DE number 1696828

MaRDI QIDQ2767095zbMATH OpenFDO

Authors Zbigniew Lonc, Mirosław Truszczyński

Publication date 28 April 2002

Mathematics Subject Classification ID

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

Recommendations

• On the problem of computing 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
• The alternating fixpoint of logic programs with negation

Cited in

(15)

• Safe computation of the well-founded semantics of datalog queries
• Off-line parsability and the well-foundedness of subsumption
• A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs
• Efficient computation of the well-founded semantics over big data
• Efficient top-down computation of queries under the well-founded semantics
• SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
• Transformation-based bottom-up computation of the well-founded model
• On the problem of computing the well-founded semantics
• scientific article; zbMATH DE number 2090540 (Why is no real title available?)
• Computing the well-founded semantics faster
• A logic framework for P2P deductive databases
• A tutorial on the well-founded semantics
• On the computation of the disjunctive well-founded semantics
• Transformation-based bottom-up computation of the well-founded model
• The alternating fixpoint of logic programs with negation

This page was built for publication:

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