The complexity of reasoning with FODD and GFODD (Q900300): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2015.08.005 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: FODD-Planner / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FluCaP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2293553724 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1407.1408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-model theory -- A personal perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary decision diagrams for first-order predicate logic. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision-theoretic planning with generalized first-order decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Relational Planning with First Order Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning with examples: Propositional formulae and database dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning with models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning to reason / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov logic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical solution techniques for first-order MDPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Ramsey theory and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624121 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2015.08.005 / rank
 
Normal rank

Latest revision as of 07:48, 10 December 2024

scientific article
Language Label Description Also known as
English
The complexity of reasoning with FODD and GFODD
scientific article

    Statements

    The complexity of reasoning with FODD and GFODD (English)
    0 references
    0 references
    0 references
    22 December 2015
    0 references
    complexity analysis
    0 references
    polynomial hierarchy
    0 references
    decision diagrams
    0 references
    first-order logic
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references