The computational complexity of abduction (Q1182159): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3493231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of probabilistic inference using Bayesian belief networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagnosing multiple faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3198885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fusion, propagation, and structuring in belief networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed revision of composite beliefs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Probabilistic Causal Model for Diagnostic Problem Solving Part I: Integrating Symbolic Causal Inference with Numeric Probabilistic Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Probabilistic Causal Model for Diagnostic Problem Solving Part II: Diagnostic Strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of diagnosis from first principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank

Latest revision as of 14:54, 15 May 2024

scientific article
Language Label Description Also known as
English
The computational complexity of abduction
scientific article

    Statements

    The computational complexity of abduction (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    abduction
    0 references
    explanation
    0 references
    computational complexity
    0 references
    NP-hard
    0 references
    0 references