Wolf, R. de

clause program specialization example problem specialization problem subsumption theorem subsumption theorem resolution nite program type 1 program t fgg input clause uds-specialization instance resolvent p f 2 tj +1 subsumption step sld-tree ud 1-specialization g 0j +1 llo 87 specialization problems nition input w.r.t herbrand nite number ground instances ud 2-specialization section solution nite programs number logic p f 3 gj +1 program t 0 ground proposition herbrand model completeness unconstrained resolution sld-refutation program t 2-specialization refutation type 2 program subsume inductive tj nfc g approach generalization clause deletion programming horn clauses su ciently result program specialization 1-specialization model proof c 2 tj p x 1 ground atoms subsumes c nite goal mt 0 mt nite program clause fp f xg specialization technique sld-resolution specialization t 0 2 0 predicate deletion member nite clauses