Pages that link to "Item:Q1327167"
From MaRDI portal
The following pages link to Cost-based abduction and MAP explanation (Q1327167):
Displaying 17 items.
- Most probable explanations in Bayesian networks: complexity and tractability (Q433524) (← links)
- Approximating cost-based abduction is NP-hard (Q814635) (← links)
- Exploiting case-based independence for approximating marginal probabilities (Q1125781) (← links)
- Approximating MAPs for belief networks is NP-hard and other theorems (Q1274288) (← links)
- Analysis of notions of diagnosis (Q1274567) (← links)
- A Prolog-like inference system for computing minimum-cost abductive explanations in natural-language interpretation (Q1354059) (← links)
- Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions (Q1392104) (← links)
- Cost-based temporal reasoning (Q2212079) (← links)
- Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results (Q2385448) (← links)
- Recurrent neural networks with backtrack-points and negative reinforcement applied to cost-based abduction (Q2568027) (← links)
- Polynomial solvability of cost-based abduction (Q2676566) (← links)
- The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks (Q3075529) (← links)
- A framework for building knowledge-bases under uncertainty (Q4421246) (← links)
- Explaining by evidence (Q4779486) (← links)
- Abductive Reasoning for Continual Dialogue Understanding (Q5200463) (← links)
- An efficient LP-based admissible heuristic for cost-based abduction (Q5704534) (← links)
- An algorithm for finding MAPs for belief networks through cost-based abduction (Q5906312) (← links)
