Semantics of input-consuming logic programs

A. Bossi, S. Etalle, S. Rossi

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (Scopus)

    Abstract

    Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. This class of programs arguably allows to model logic programs employing a dynamic selection rule and constructs such as delay declarations: as shown also in [5], a large number of them are actually input-consuming. In this paper we show that - under some syntactic restrictions - the S-semantics of a program is correct and fully abstract also for input-consuming programs. This allows us to conclude that for a large class of programs employing delay declarations there exists a model-theoretic semantics which is equivalent to the operational one. Loading... Computational Logic — CL 2000Computational Logic — CL 2000Look Inside
    Original languageEnglish
    Title of host publicationComputational logic - CL 2000 : proceedings 1st international conference, London, UK, 24-28 july, 2000
    EditorsJ.W. Lloyd, xx et al
    PublisherSpringer
    Pages194-208
    ISBN (Print)3-540-67797-6
    DOIs
    Publication statusPublished - 2000

    Publication series

    NameLecture Notes in Computer Science
    Volume1861
    ISSN (Print)0302-9743

    Fingerprint

    Dive into the research topics of 'Semantics of input-consuming logic programs'. Together they form a unique fingerprint.

    Cite this