Programs Without Failures

@inproceedings{Bossi1997ProgramsWF,
  title={Programs Without Failures},
  author={Annalisa Bossi and Nicoletta Cocco},
  booktitle={LOPSTR},
  year={1997}
}
We try to formalize the intuitive reasoning which we normally use to get convinced that a query has successful LD-derivations in a program. To this purpose we deene the class of programs and queries without failures which have the property of not having nitely failing derivations. Such property is simple to verify, it is preserved through leftmost unfolding and it can be useful both in verifying properties of logic programs and in program transformation. The class of programs without failures… CONTINUE READING

Topic