Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (Q910251): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3960112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship between circumscription and negation as failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak generalized closed world assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring negative information from disjunctive databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and definability with circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deduction in non-Horn databases / rank
 
Normal rank

Latest revision as of 13:50, 20 June 2024

scientific article
Language Label Description Also known as
English
Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
scientific article

    Statements

    Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete (English)
    0 references
    0 references
    0 references
    1990
    0 references
    logic programming
    0 references
    non-Horn logic programs
    0 references
    negation
    0 references
    undecidability
    0 references
    arithmetical hierarchy
    0 references

    Identifiers