A Complete Axiomatization of the Three valued Completion of Logic Programs
From MaRDI portal
Recommendations
- A class of programs for which SLDNF resolution and NAF rule are complete
- Intuitionistic three-valued logic and logic programming
- Three-valued completion for abductive logic programs
- Strict completion of logic programs
- A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses
Cited in
(17)- A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses
- The role of standardising apart in logic programming
- TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic
- Encoding transition systems in sequent calculus
- First-order theories for pure Prolog programs with negation
- Completeness criterion for the enumeration closure operator in three-valued logic
- A simple sequent calculus for partial functions
- What is a paraconsistent logic?
- scientific article; zbMATH DE number 5696770 (Why is no real title available?)
- scientific article; zbMATH DE number 956484 (Why is no real title available?)
- Intuitionistic three-valued logic and logic programming
- scientific article; zbMATH DE number 517069 (Why is no real title available?)
- scientific article; zbMATH DE number 515746 (Why is no real title available?)
- scientific article; zbMATH DE number 1761893 (Why is no real title available?)
- scientific article; zbMATH DE number 3993546 (Why is no real title available?)
- Proof-theoretic notions for software maintenance
- Three-valued completion for abductive logic programs
This page was built for publication: A Complete Axiomatization of the Three valued Completion of Logic Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988059)
