Ions and local definitions in logic programming

  • M. A. Nait Abdallah
Contributed Papers

DOI: 10.1007/3-540-16078-7_65

Part of the Lecture Notes in Computer Science book series (LNCS, volume 210)
Cite this paper as:
Nait Abdallah M.A. (1986) Ions and local definitions in logic programming. In: Monien B., Vidal-Naquet G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg

Abstract

In [1] Bowen and Kowalski suggest amalgamating language and metalanguage in logic programming in order to be able to explicitly refer to theories (i.e. collections of clauses), and discuss derivability from these theories. In particular, they use amalgamation in order to give a solution to the locality of definition problem. In this paper we reconsider this locality of definition problem, and present a new approach for solving it, whithout calling upon language and metalanguage amalgamation. To this end we introduce the notion of an ion, and extend to logic programming with ions various results from "classical" logic programming. We give a least fixpoint semantics, a set-theoretic characterization of successful derivations, and a skylight theorem characterizing approximations to the result computed by a given derivation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • M. A. Nait Abdallah
    • 1
  1. 1.Department of Computer ScienceUniversity of Western OntarioLondonCanada

Personalised recommendations