The complexity of predicate default logic over a countable domain (Q1861328)

From MaRDI portal
Revision as of 13:46, 28 July 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
The complexity of predicate default logic over a countable domain
scientific article

    Statements

    The complexity of predicate default logic over a countable domain (English)
    0 references
    16 March 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    default logic
    0 references
    circumscription
    0 references
    computability theoretic complexity
    0 references