The complexity of reasoning with FODD and GFODD (Q900300)

From MaRDI portal
Revision as of 07:48, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of reasoning with FODD and GFODD
scientific article

    Statements

    title
    The complexity of reasoning with FODD and GFODD (English)
    0 references
    author
    Benjamin J. Hescott
    0 references
    Roni Khardon
    0 references
    publication date
    22 December 2015
    0 references
    zbMATH Keywords
    complexity analysis
    0 references
    polynomial hierarchy
    0 references
    decision diagrams
    0 references
    first-order logic
    0 references
    describes a project that uses
    ProbLog
    0 references
    FODD-Planner
    0 references
    FluCaP
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68T20
    0 references
    03B10
    0 references
    68Q17
    0 references
    68Q25
    0 references
    68T15
    0 references
    68T30
    0 references
    zbMATH DE Number
    6523255
    0 references
    OpenAlex ID
    W2293553724
    0 references
    arXiv ID
    1407.1408
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q900300&oldid=38528958"
    Powered by MediaWiki