WELL!: An evaluation procedure for all logic programs

DOI10.1007/3-540-53507-1_87MaRDI QIDQ4694697zbMATH OpenFDO

Authors Nicole Bidoit, P. Legay

Publication date 29 June 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53507-1_87

zbMATH Keywords

evaluationlogic programsSLD resolutionSLS resolution

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A procedural semantics for well-founded negation in logic programs
• A goal-oriented approach to computing the well-founded semantics
• The well-founded semantics for general logic programs
• SLT-resolution for the well-founded semantics
• A tutorial on the well-founded semantics

Cited in

(7)

• Towards an efficient evaluation of recursive aggregates in deductive databases
• A logic programming system for nonmonotonic reasoning
• A paraconsistent logic programming approach for querying inconsistent databases
• A procedural semantics for well-founded negation in logic programs
• A goal-oriented approach to computing the well-founded semantics
• An algebraic construction of the well-founded model
• Bottom-up evaluation and query optimization of well-founded models

This page was built for publication: WELL!: An evaluation procedure for all logic programs

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