On the complexity of identifying head-elementary-set-free programs (Q3400962)

From MaRDI portal
Revision as of 07:20, 5 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of identifying head-elementary-set-free programs
scientific article

    Statements

    On the complexity of identifying head-elementary-set-free programs (English)
    0 references
    0 references
    0 references
    28 January 2010
    0 references
    0 references
    computational complexity
    0 references
    elementary set
    0 references
    disjunctive logic program
    0 references
    head-elementary-set-free program
    0 references