01262nas a2200133 4500008004100000245006200041210005900103260002600162300001200188520084600200100002201046700002001068856004001088 2000 eng d00aA New Fixed-point Theorem for Logic Programming Semantics0 aNew Fixedpoint Theorem for Logic Programming Semantics aOrlando, Florida, USA a418-4233 aWe present a new fixed-point theorem akin to the Banach contraction mapping theorem, but in the context of a novel notion of generalized metric space, and show how it can be applied to analyse the denotational semantics of certain logic programs. The theorem is obtained by generalizing a theorem of Priess-Crampe and Ribenboim, which grew out of applications within valuation theory, but is also inspired by a theorem of S.G. Matthews which grew out of applications to conventional programming language semantics. The class of programs to which we apply our theorem was defined previously by us in terms of operators using three-valued logics. However, the new treatment we provide here is short and intuitive, and provides further evidence that metriclike structures are an appropriate setting for the study of logic programming semantics.1 aSeda, Anthony, K.1 aHitzler, Pascal uhttp://knoesis.wright.edu/node/1186