<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anthony K. Seda</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Generalized Distance Functions in the Theory of Computation</style></title><secondary-title><style face="normal" font="default" size="100%">Computer Journal</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">denotational semantics</style></keyword><keyword><style  face="normal" font="default" size="100%">fixed-point theorems</style></keyword><keyword><style  face="normal" font="default" size="100%">generalized distance functions</style></keyword><keyword><style  face="normal" font="default" size="100%">Logic Programming</style></keyword><keyword><style  face="normal" font="default" size="100%">stable model</style></keyword><keyword><style  face="normal" font="default" size="100%">supported model</style></keyword><keyword><style  face="normal" font="default" size="100%">topology</style></keyword><keyword><style  face="normal" font="default" size="100%">ultra-metrics</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1093/comjnl/bxm108</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">53</style></volume><pages><style face="normal" font="default" size="100%">443–464</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;rtejustify&quot;&gt;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.&lt;/p&gt;
</style></abstract></record></records></xml>