Three-valued completion for abductive 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 25189 (Why is no real title available?)
- scientific article; zbMATH DE number 708499 (Why is no real title available?)
- scientific article; zbMATH DE number 1761893 (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*
- Abductive Logic Programming
- Model theory.
- Negation in logic programming
- On the Relationship Between Abduction and Deduction
- Representing Incomplete Knowledge in Abductive Logic Programming
- SLDNFA: An abductive procedure for abductive logic programs
- Short note preferred extensions are partial stable models
Cited in
(6)- A Complete Axiomatization of the Three valued Completion of Logic Programs
- Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
- A core method for the weak completion semantics with skeptical abduction
- scientific article; zbMATH DE number 820414 (Why is no real title available?)
- scientific article; zbMATH DE number 1761893 (Why is no real title available?)
- A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
This page was built for publication: Three-valued completion for abductive logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671511)