Tabulated resolution for the well-founded semantics

DOI10.1016/S0743-1066(97)00073-3MaRDI QIDQ3841100zbMATH OpenFDO

Authors Roland N. Bol, Lars Degerstedt

Publication date 5 November 1998

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0743-1066(97)00073-3

zbMATH Keywords

search forestsearch space

Mathematics Subject Classification ID

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

Recommendations

• SLT-resolution for the well-founded semantics
• Tabled evaluation with delaying for general logic programs
• A goal-oriented approach to computing the well-founded semantics
• An abstract machine for efficiently computing queries to well-founded models

Cited in

(9)

• What is failure? An approach to constructive negation
• SLT-resolution for the well-founded semantics
• Logic programming and knowledge representation---The A-Prolog perspective
• Dynamic reordering of alternatives for definite logic programs
• A logic programming system for nonmonotonic reasoning
• The limits of fixed-order computation
• Loop checks for logic programs with functions
• Enhancing global SLS-resolution with loop cutting and tabling mechanisms
• Tabulation proof procedures for fuzzy linguistic logic programming

This page was built for publication: Tabulated resolution for the well-founded semantics

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