Logic programming semantics using a compact data structure
Melvin Fitting · 1986
A fixpoint semantics is given for logic programming using domain theory, with undefined as one truth value, allowing negation, and arbitrary data structures. This generalizes the conventional semantics, and agrees with it on 'successes' for Horn clause programs. Consequences of requiring the data structure to be a compact topological space and the given relations to be continuous are investigated, extending results in the last chapter of Lloyd's book.