The following pages link to (Q3727360):
Displaying 11 items.
- A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete (Q689290) (← links)
- Strict completion of logic programs (Q751309) (← links)
- Protected completions of first-order general logic programs (Q911800) (← links)
- Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions (Q1101250) (← links)
- Acyclic logic programs and the completeness of SLDNF-resolution (Q1177925) (← links)
- Paraconsistent logic programming (Q1262746) (← links)
- Stratified least fixpoint logic (Q1331926) (← links)
- SLT-resolution for the well-founded semantics (Q1598446) (← links)
- Generalising unit-refutation completeness and SLUR via nested input resolution (Q2352484) (← links)
- A completeness theorem for SLDNF resolution (Q3031954) (← links)
- (Q3486879) (← links)
