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 as 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 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
