Pages that link to "Item:Q3988059"
From MaRDI portal
The following pages link to A Complete Axiomatization of the Three valued Completion of Logic Programs (Q3988059):
Displaying 14 items.
- Three-valued completion for abductive logic programs (Q671511) (← links)
- A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses (Q1193863) (← links)
- The role of standardising apart in logic programming (Q1329744) (← links)
- TMPR: A tree-structured modified problem reduction proof procedure and its extension to three-valued logic (Q1332639) (← links)
- Encoding transition systems in sequent calculus (Q1398474) (← links)
- First-order theories for pure Prolog programs with negation (Q1892097) (← links)
- Completeness criterion for the enumeration closure operator in three-valued logic (Q2295970) (← links)
- A simple sequent calculus for partial functions (Q2367544) (← links)
- What is a Paraconsistent Logic? (Q3305335) (← links)
- (Q3553860) (← links)
- Intuitionistic three-valued logic and logic programming (Q3991300) (← links)
- (Q4537512) (← links)
- (Q4722043) (← links)
- Proof-theoretic notions for software maintenance (Q4923374) (← links)