BIROn - Birkbeck Institutional Research Online

    On the equivalence and range of applicability of graph-based representations of logic programs

    Costantini, S. and D' Antona, O.M. and Provetti, Alessandro (2002) On the equivalence and range of applicability of graph-based representations of logic programs. Information Processing Letters 84 (5), pp. 241-249. ISSN 0020-0190.

    Full text not available from this repository.

    Abstract

    Logic programs under Answer Sets semantics can be studied, and actual computation can be carried out, by means of representing them by directed graphs. Several reductions of logic programs to directed graphs are now available. We compare our proposed representation, called Extended Dependency Graph, to the Block Graph representation recently defined by Linke [Proc. IJCAI-2001, 2001, pp. 641–648]. On the relevant fragment of well-founded irreducible programs, extended dependency and block graph turns out to be isomorphic. So, we argue that graph representation of general logic programs should be abandoned in favor of graph representation of well-founded irreducible programs, which are more concise, more uniform in structure while being equally expressive.

    Metadata

    Item Type: Article
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 03 Aug 2021 15:50
    Last Modified: 03 Aug 2021 15:50
    URI: https://eprints.bbk.ac.uk/id/eprint/45346

    Statistics

    Downloads
    Activity Overview
    0Downloads
    7Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item