Pages that link to "Item:Q814635"
From MaRDI portal
The following pages link to Approximating cost-based abduction is NP-hard (Q814635):
Displaying 4 items.
- Cost-based abduction and MAP explanation (Q1327167) (← 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)
- An algorithm for finding MAPs for belief networks through cost-based abduction (Q5906312) (← links)