The following pages link to On Completeness of Logic Programs (Q2949713):
Displaying 13 items.
- Proving completeness of logic programs with the cut (Q511027) (← links)
- Strict completion of logic programs (Q751309) (← links)
- Completeness for ancestral logic via a computationally-meaningful semantics (Q1694469) (← links)
- On strictly arithmetical completeness in logics of programs (Q2277248) (← links)
- Expressive completeness and decidability (Q2277437) (← links)
- Completeness and counter-example generations of a basic protocol logic (extended abstract) (Q2863872) (← links)
- On Completeness of Logic Programs (Q2949713) (← links)
- Completeness and Decidability in Sequence Logic (Q3498460) (← links)
- (Q4029601) (← links)
- Tight, consistent, and computable completions for unrestricted logic programs (Q4036289) (← links)
- (Q4353623) (← links)
- Logic + control: On program construction and verification (Q4603427) (← links)
- Some Completeness Results for Propositional Conditional Logics (Q4834298) (← links)
