A goal-oriented approach to computing the well-founded semantics
From MaRDI portal
(Redirected from A goal-oriented approach to computing the well-founded semantics)
Recommendations
- A procedural semantics for well-founded negation in logic programs
- Efficient top-down computation of queries under the well-founded semantics
- SLT-resolution for the well-founded semantics
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms
- scientific article; zbMATH DE number 219215
Cited in
(14)- A framework for goal-directed query evaluation with negation
- Tabulated resolution for the well-founded semantics
- A procedural semantics for well-founded negation in logic programs
- scientific article; zbMATH DE number 1943847 (Why is no real title available?)
- scientific article; zbMATH DE number 1765676 (Why is no real title available?)
- Query answering in resource-based answer set semantics
- scientific article; zbMATH DE number 219215 (Why is no real title available?)
- An algebraic construction of the well-founded model
- Loop checking and the well-founded semantics
- About epistemic negation and world views in epistemic logic programs
- A tutorial on the well-founded semantics
- A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
- Prolegomena to logic programming for non-monotonic reasoning
- Enhancing global SLS-resolution with loop cutting and tabling mechanisms
This page was built for publication: A goal-oriented approach to computing the well-founded semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4275261)
