A Fixed-Point Theorem for Multi-valued Functions with an Application to Multilattice-Based Logic Programming

摘要

This paper presents a computability theorem for fixed points of multi-valued functions defined on multilattices, which is later used in order to obtain conditions which ensure that the immediate consequence operator computes minimal models of multilattice-based logic programs in at most ω iterations.