Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions

DOI10.1016/S0004-3702(96)00061-6zbMath0906.68120OpenAlexW2026136572MaRDI QIDQ1392104

Yukio Ohsawa, Mitsuru Ishizuka

Publication date: 23 July 1998

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(96)00061-6

zbMATH Keywords

approximate solution methodhypothetical reasoningknowledge networkpolynomial-time inference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30)

Related Items (3)

An efficient LP-based admissible heuristic for cost-based abduction ⋮ Recurrent neural networks with backtrack-points and negative reinforcement applied to cost-based abduction ⋮ Approximating cost-based abduction is NP-hard

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A logical framework for default reasoning
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• A linear constraint satisfaction approach to cost-based abduction
• Cost-based abduction and MAP explanation
• Polynomial solvability of cost-based abduction
• Pivot and Complement–A Heuristic for 0-1 Programming
• A Sufficient Condition for Backtrack-Free Search
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables

This page was built for publication: Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions