scientific article; zbMATH DE number 3980532
[For the entire collection see Zbl 0578.00004.] \textit{K. A. Bowen} and \textit{R. A. Kowalski} [Logic Programming, 153-172 (1982; Zbl 0569.68004)] 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, without 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.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745321)