Work

Logic programming semantics using a compact data structure

Year: 1986

Type: conference-paper

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.

Source: International Syposium on Methodologies for Intelligent Systems

DOI: 10.1145/12808.12835

Author: M Fitting

Institutions: The Graduate Center, CUNY, Lehman College, City University of New York

Language: English

Topic: Logic, Reasoning, and Knowledge

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2108953257

FWCI:

Cites: 8

Cited by:

Related to: 10