A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
From MaRDI portal
Publication:5958767
DOI10.1016/S0304-3975(00)00201-2zbMath0992.68138MaRDI QIDQ5958767
No author found.
Publication date: 3 March 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A non-ground realization of the stable and well-founded semantics
- The alternating fixpoint of logic programs with negation
- Properties of substitutions and unifications
- On the relations between stable and well-founded semantics of logic programs
- Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning
- SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
- A sound and complete semantics for a version of negation as failure
- Efficient top-down computation of queries under the well-founded semantics
- Extending negation as failure by abduction: A three-valued stable model semantics
- A procedural semantics for well-founded negation in logic programs
- Short note preferred extensions are partial stable models
- A goal-oriented approach to computing the well-founded semantics
- The well-founded semantics for general logic programs
- On the equivalence of semantics for normal logic programs
- An argumentation-theoretic foundation for logic programming
- Tabled evaluation with delaying for general logic programs
- Computing argumentation in logic programming
- Abductive Logic Programming
This page was built for publication: A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
