The following pages link to Włodzimierz Drabent (Q511026):
Displaying 25 items.
- Proving completeness of logic programs with the cut (Q511027) (← links)
- (Q751308) (redirect page) (← links)
- Strict completion of logic programs (Q751309) (← links)
- Proving properties of Pascal programs in MIZAR 2 (Q1058285) (← links)
- Erratum to: Proving properties of Pascal programs in MIZAR 2 (Q1074337) (← links)
- Inductive assertion method for logic pograms (Q1105352) (← links)
- What is failure? An approach to constructive negation (Q1346220) (← links)
- On Completeness of Logic Programs (Q2949713) (← links)
- On negation as instantiation (Q2956710) (← links)
- (Q3040509) (← links)
- Completeness of SLDNF-resolution for nonfloundering queries (Q3129497) (← links)
- (Q3776674) (← links)
- Using parametric set constraints for locating errors in CLP programs (Q4452608) (← links)
- (Q4499276) (← links)
- On definite program answers and least Herbrand models (Q4593038) (← links)
- Logic + control: On program construction and verification (Q4603427) (← links)
- (Q4736519) (← links)
- A simple correctness proof for magic transformation (Q4897705) (← links)
- The Prolog Debugger and Declarative Programming (Q5097636) (← links)
- Correctness and Completeness of Logic Programs (Q5277919) (← links)
- Logic + control: An example (Q5398068) (← links)
- Proving correctness and completeness of normal programs – a declarative approach (Q5715449) (← links)
- On Correctness and Completeness of an <i>n</i> Queens Program (Q6063871) (← links)
- A relaxed condition for avoiding the occur-check (Q6076347) (← links)
- A note on occur-check (Q6647307) (← links)
