Tight, consistent, and computable completions for unrestricted logic programs (Q4036289)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Tight, consistent, and computable completions for unrestricted logic programs
scientific article

    Statements

    Tight, consistent, and computable completions for unrestricted logic programs (English)
    0 references
    16 May 1993
    0 references
    negation in logic programming
    0 references
    Clark's program completion
    0 references
    first-order semantics for logic programs
    0 references

    Identifiers