Pages that link to "Item:Q5277919"
From MaRDI portal
The following pages link to Correctness and Completeness of Logic Programs (Q5277919):
Displaying 13 items.
- Proving completeness of logic programs with the cut (Q511027) (← links)
- Correctness of linear logic proof structures is NL-complete (Q534703) (← links)
- Strict completion of logic programs (Q751309) (← links)
- On Completeness of Logic Programs (Q2949713) (← links)
- (Q3325017) (← links)
- (Q4218844) (← links)
- Correctness of unification without occur check in prolog (Q4285641) (← links)
- On definite program answers and least Herbrand models (Q4593038) (← links)
- Logic + control: On program construction and verification (Q4603427) (← links)
- The Prolog Debugger and Declarative Programming (Q5097636) (← links)
- On Correctness and Completeness of an <i>n</i> Queens Program (Q6063871) (← links)
- S-semantics -- an example (Q6102251) (← links)
- On correctness of normal logic programs (Q6103020) (← links)