The following pages link to Strict completion of logic programs (Q751309):
Displaying 14 items.
- Bottom-up evaluation and query optimization of well-founded models (Q673130) (← links)
- A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses (Q1193863) (← links)
- Completions of perpetual logic programs (Q1193890) (← links)
- Equivalence-preserving first-order unfold/fold transformation systems (Q1200980) (← links)
- What is failure? An approach to constructive negation (Q1346220) (← links)
- On strictly arithmetical completeness in logics of programs (Q2277248) (← links)
- The completeness of SLDNF-resolution with respect to modal completion (Q2735348) (← links)
- A Complete Axiomatization of the Three valued Completion of Logic Programs (Q3988059) (← links)
- Tight, consistent, and computable completions for unrestricted logic programs (Q4036289) (← links)
- Predicate Completion for non-Horn Clause Sets (Q5200033) (← links)
- Completion of first-order clauses with equality by strict superposition (Q5881276) (← links)
- On Signings and the Well-Founded Semantics (Q6063875) (← links)
- On correctness of normal logic programs (Q6103020) (← links)
- Soundness and completeness versus lifting property (Q6560386) (← links)
