The computational complexity of abduction (Q1182159)

From MaRDI portal
Revision as of 14:54, 15 May 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
The computational complexity of abduction
scientific article

    Statements

    title
    The computational complexity of abduction (English)
    0 references
    author
    Tom Bylander
    0 references
    Dean Allemang
    0 references
    Michael C. Tanner
    0 references
    John R. Josephson
    0 references
    publication date
    28 June 1992
    0 references
    Mathematics Subject Classification ID
    68T20
    0 references
    68Q25
    0 references
    68T15
    0 references
    zbMATH DE Number
    30529
    0 references
    zbMATH Keywords
    abduction
    0 references
    explanation
    0 references
    computational complexity
    0 references
    NP-hard
    0 references
    OpenAlex ID
    W2037481186
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1182159&oldid=34082944"
    Powered by MediaWiki