Graph properties for normal logic programs (Q1208418): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4132480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A completeness theorem for SLDNF resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial models and logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completed logic programs and their consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348436 / rank
 
Normal rank

Revision as of 15:24, 17 May 2024

scientific article
Language Label Description Also known as
English
Graph properties for normal logic programs
scientific article

    Statements

    Graph properties for normal logic programs (English)
    0 references
    0 references
    0 references
    16 May 1993
    0 references
    normal logic programs
    0 references
    declarative semantics
    0 references
    negation
    0 references
    resolution
    0 references
    consistent completion
    0 references
    Herbrand basis
    0 references

    Identifiers