|Title||Acceptable Programs Revisited|
|Publication Type||Conference Paper|
|Year of Publication||1999|
|Authors||Anthony K. Seda, Pascal Hitzler|
|Publisher||Workshop on Verification in Logic Programming, 16th International Conference on Logic Programming (ICLP'99),|
|Keywords||l and o and g and i and c and and p and r and o and g and r and a and m and s|
Acceptable logic programs have been studied extensively in the context of proving termination of Prolog programs. It is difficult, however, to establish acceptability from the definition since this depends on finding a suitable model, which need not be a Herbrand model in general, together with a suitable level mapping that one can use to check the conditions which characterize acceptability. In this paper, we will see that when working over a fixed but arbitrary preinterpretation, a method can be provided for obtaining both a suitable model and a canonical level mapping which are sufficient for this purpose. Furthermore, the canonical model and level mapping obtained will turn out to be sufficient for discussing termination of non-ground queries.
|Full Text|| |
Pascal Hitzler, Anthony K. Seda,'Acceptable Programs Revisited,' the Workshop on Verification in Logic Programming, 16th International Conference on Logic Programming (ICLP'99), Las Cruces, New Mexico, November 1999.