Complexity results for answer set programming with bounded predicate arities and implications (Q2426101)

From MaRDI portal
Revision as of 21:51, 27 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity results for answer set programming with bounded predicate arities and implications
scientific article

    Statements

    Complexity results for answer set programming with bounded predicate arities and implications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 April 2008
    0 references
    0 references
    Answer set programming
    0 references
    Computational complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references