Logic programming semantics using a compact data structure

Authors:
M Fitting
Affiliations:
The Graduate School and University Center (CUNY), and Herbert H. Lehman College (CUNY), Department of Mathematics and Computer Science, Bedford Park, Boulevard West, Bronx, New York
Venue:
ISMIS '86 Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems
Year:
1986

Citing 3
Cited 0

The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming

Journal of the ACM (JACM)
Logic Programs and Many-Valued Logic

STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.