Document Type

Report

Date

6-1987

Embargo Period

4-25-2012

Keywords

logic, programming

Language

English

Disciplines

Computer Sciences

Description/Abstract

We construct Scott domains well suited to use in an abstract implementation of logic programming, and perhaps to the modelling of other first-order data structures. The domain elements, which we call ‘grafts’, are in effect a sort of directed graphs. The approximation order in the domains corresponds to the relation between tuples of terms, “has a substitution instance”; the price to be paid is that one equivalence class of (tuples of) terms under renaming of variables is represented by many grafts. Graft domains come in two flavors—plain and ‘acyclic’—for modelling on an equal footing logic programming without and with the ‘occur check’. The least-fixed-point semantics of logic programming re-emerges gracefully from our development in the form of an assignment to each predicate letter belonging to a logic program of an open subset of a graft domain as its denotation.

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.