01428nas a2200229 4500008004100000245006400041210006400105300001400169490000700183520074500190653002700935653002500962653003500987653002201022653001701044653002001061653001301081653001801094100002201112700002001134856004401154 2010 eng d00aGeneralized Distance Functions in the Theory of Computation0 aGeneralized Distance Functions in the Theory of Computation a443–4640 v533 a

We discuss a number of distance functions encountered in the theory of computation, including metrics, ultra-metrics, quasi-metrics, generalized ultra-metrics, partial metrics, d-ultra-metrics and generalized metrics. We consider their properties, associated fixed-point theorems and some general applications they have within the theory of computation. We consider in detail the applications of generalized distance functions in giving a uniform treatment of several important semantics for logic programs, including acceptable programs and natural generalizations of them, and also the supported model and the stable model in the context of locally stratified extended disjunctive logic programs and databases.

10adenotational semantics10afixed-point theorems10ageneralized distance functions10aLogic Programming10astable model10asupported model10atopology10aultra-metrics1 aSeda, Anthony, K.1 aHitzler, Pascal uhttp://dx.doi.org/10.1093/comjnl/bxm108