SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 177828 (Why is no real title available?)
- scientific article; zbMATH DE number 4185011 (Why is no real title available?)
- A kripke-kleene semantics for logic programs*
- A sound and complete semantics for a version of negation as failure
- Abductive Logic Programming
- Bottom-up dataflow analysis of normal logic programs
- Declarative modeling of the operational behavior of logic languages
- Negation as failure. II
- Negation in logic programming
- Properties of substitutions and unifications
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- The well-founded semantics for general logic programs
Cited in
(7)- scientific article; zbMATH DE number 2053218 (Why is no real title available?)
- SLR inference: An inference system for fixed-mode logic programs, based on SLR parsing
- A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
- A new definition of SLDNF-resolution
- A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete
- On SLDNF-resolution in logic programming with negation
- Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
This page was built for publication: SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350529)