Switch to: References

Add citations

You must login to add citations.
  1. Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.
  • Polynomial solvability of cost-based abduction.Eugene Santos & Eugene S. Santos - 1996 - Artificial Intelligence 86 (1):157-170.
  • Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions.Yukio Ohsawa & Mitsuru Ishizuka - 1997 - Artificial Intelligence 91 (1):131-154.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Analysis of notions of diagnosis.Peter J. F. Lucas - 1998 - Artificial Intelligence 105 (1-2):295-343.
  • A probabilistic plan recognition algorithm based on plan tree grammars.Christopher W. Geib & Robert P. Goldman - 2009 - Artificial Intelligence 173 (11):1101-1132.
  • Representing, Running, and Revising Mental Models: A Computational Model.Scott Friedman, Kenneth Forbus & Bruce Sherin - 2018 - Cognitive Science 42 (4):1110-1145.
    People use commonsense science knowledge to flexibly explain, predict, and manipulate the world around them, yet we lack computational models of how this commonsense science knowledge is represented, acquired, utilized, and revised. This is an important challenge for cognitive science: Building higher order computational models in this area will help characterize one of the hallmarks of human reasoning, and it will allow us to build more robust reasoning systems. This paper presents a novel assembled coherence theory of human conceptual change, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Cost-based abduction and MAP explanation.Eugene Charniak & Solomon Eyal Shimony - 1994 - Artificial Intelligence 66 (2):345-374.
  • An algorithm for rinding MAPs for belief networks through cost-based abduction.Ashraf M. Abdelbar - 1998 - Artificial Intelligence 104 (1-2):331-338.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Approximating cost-based abduction is NP-hard.Ashraf M. Abdelbar - 2004 - Artificial Intelligence 159 (1-2):231-239.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Approximating MAPs for belief networks is NP-hard and other theorems.Ashraf M. Abdelbar & Sandra M. Hedetniemi - 1998 - Artificial Intelligence 102 (1):21-38.