Pages that link to "Item:Q3031954"
From MaRDI portal
The following pages link to A completeness theorem for SLDNF resolution (Q3031954):
Displaying 21 items.
- A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete (Q689290) (← links)
- Strict completion of logic programs (Q751309) (← links)
- First order compiler: A deterministic logic program synthesis algorithm (Q908686) (← links)
- Protected completions of first-order general logic programs (Q911800) (← links)
- Acyclic logic programs and the completeness of SLDNF-resolution (Q1177925) (← links)
- Unfold/fold transformation of stratified programs (Q1177929) (← links)
- SLDNF-resolution with equality (Q1189731) (← links)
- A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses (Q1193863) (← links)
- Equivalence-preserving first-order unfold/fold transformation systems (Q1200980) (← links)
- Graph properties for normal logic programs (Q1208418) (← links)
- A transformation system for deductive database modules with perfect model semantics (Q1208734) (← links)
- SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs (Q1350529) (← links)
- SLT-resolution for the well-founded semantics (Q1598446) (← links)
- On the completeness of SLDENF-resolution (Q1815857) (← links)
- A sound and complete semantics for a version of negation as failure (Q1824413) (← links)
- Generalising unit-refutation completeness and SLUR via nested input resolution (Q2352484) (← links)
- The completeness of SLDNF-resolution with respect to modal completion (Q2735348) (← links)
- A direct proof of the completeness of SLDNF-resolution (Q4238483) (← links)
- A new definition of SLDNF-resolution (Q4285644) (← links)
- Levationis Laus (Q4286221) (← links)
- A note on SLDNF-resolution (Q4399716) (← links)
