Recurrent neural networks with backtrack-points and negative reinforcement applied to cost-based abduction
From MaRDI portal
(Redirected from Publication:2568027)
Recommendations
- A linear constraint satisfaction approach to cost-based abduction
- An algorithm for finding MAPs for belief networks through cost-based abduction
- Cost-based abduction and MAP explanation
- An efficient LP-based admissible heuristic for cost-based abduction
- Modelling cyclicity and generalized cost-based abduction using linear constraint satisfaction
Cites work
- A linear constraint satisfaction approach to cost-based abduction
- An algorithm for finding MAPs for belief networks through cost-based abduction
- An efficient LP-based admissible heuristic for cost-based abduction
- Approximating cost-based abduction is NP-hard
- Cost-based abduction and MAP explanation
- scientific article; zbMATH DE number 1929157 (Why is no real title available?)
- Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions
- Neural networks and physical systems with emergent collective computational abilities
- Polynomial solvability of cost-based abduction
- Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge
- Recurrent neural networks with backtrack-points and negative reinforcement applied to cost-based abduction
Cited in
(1)
This page was built for publication: Recurrent neural networks with backtrack-points and negative reinforcement applied to cost-based abduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568027)