01279nas a2200133 4500008004100000245003400041210003400075260011700109520076200226653008200988100002201070700002001092856003301112 1999 eng d00aAcceptable Programs Revisited0 aAcceptable Programs Revisited bWorkshop on Verification in Logic Programming, 16th International Conference on Logic Programming (ICLP'99),3 aAcceptable 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.10al and o and g and i and c and and p and r and o and g and r and a and m and s1 aSeda, Anthony, K.1 aHitzler, Pascal uhttp://knoesis.org/node/1799