A linear constraint satisfaction approach to cost-based abduction
From MaRDI portal
Publication:1313953
DOI10.1016/0004-3702(94)90036-1zbMath0787.68092OpenAlexW2170489073MaRDI QIDQ1313953
Publication date: 19 May 1994
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(94)90036-1
optimization0--1 integer linear programmingabductive explanationcost-based abductionlinear constraint satisfactionstandard graph searching
Integer programming (90C10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Cost-based abduction and MAP explanation, Finding MAPs for belief networks is NP-hard, The role of relevance in explanation. I: Irrelevance as statistical independence, Large-Scale Cost-Based Abduction in Full-Fledged First-Order Predicate Logic with Cutting Plane Inference, Exploiting case-based independence for approximating marginal probabilities, Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions, Polynomial solvability of cost-based abduction, An efficient LP-based admissible heuristic for cost-based abduction, An algorithm for finding MAPs for belief networks through cost-based abduction, A framework for building knowledge-bases under uncertainty, Approximating MAPs for belief networks is NP-hard and other theorems, Analysis of notions of diagnosis, Recurrent neural networks with backtrack-points and negative reinforcement applied to cost-based abduction, A linear constraint satisfaction approach to cost-based abduction, Approximating cost-based abduction is NP-hard
Cites Work
