1 research outputs found

    Complete extension of general logic programs

    Get PDF
    AbstractWe define in this paper a system of axioms for any general logic program. With regard to this declarative semantics, as well as to the Clark's completed data bases one, the SLDNF procedural interpretation is sound. However, although the negation-as-failure rule is still not complete with regard to the introduced semantics, the latter is closer than the Clark's one to the procedural interpretation, both from the theoretical and from the practical point of view
    corecore