Approximating cost-based abduction is NP-hard

Artificial Intelligence

Volumn 159, Issue 1-2, 2004, Pages 231-239

  Abdelbar, Ashraf M ^a  

^a The American University in Cairo   (Egypt)

Author keywords

Belief revision; Complexity; Diagnosis; Explanation; Uncertainty

Indexed keywords

APPROXIMATION THEORY; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; UNCERTAIN SYSTEMS;

BELIEF REVISION; COST FUNCTIONS; LEAST-COST PROOFS (LCP);

ARTIFICIAL INTELLIGENCE;

EID: 4644224479     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2004.06.001     Document Type: Article

References (27)

1. A.M. Abdelbar, An algorithm for finding MAP explanations through cost-based abduction, Artificial Intelligence 104 (1998) 331-338.
2. A.M. Abdelbar, H. Amer, Applying guided evolutionary simulated annealing to cost-based abduction, in: Proceedings IEEE International Joint Conference on Neural Networks, vol. 3, 2003, pp. 2428-2431.
3. A.M. Abdelbar, E.A.M. Andrews, D.C. Wunsch, Abductive reasoning with recurrent networks, Neural Networks 16 (5-6) (2003) 665-673.
4. A.M. Abdelbar, M. Mokhtar, A k-elitist MAX-MIN ant system approach to cost-based abduction, in: Proceedings IEEE Congress on Evolutionary Computation, vol. 4, 2003, pp. 2635-2641.
5. M. Bellare, O. Goldreich, C. Lund, A. Russel, Efficient probabilitistically checkable proofs and applications to approximation, in: Proceedings 25th ACM Symposium on Theory of Computing, 1993, pp. 294-304.
6. E. Charniak, S. Husain, A new admissible heuristic for minimal-cost proofs, in: Proceedings AAAI National Conference on Artificial Intelligence, Anaheim, CA, 1991, pp. 446-451.
7. E. Charniak, S.E. Shimony, Probabilistic semantics for cost-based abduction, in: Proceedings AAAI National Conference on Artificial Intelligence, Boston, MA, 1990, pp. 106-110.
8. E. Charniak, S.E. Shimony, Cost-based abduction and MAP explanation, Artificial Intelligence 66 (1994) 345-374.
9. Y. Den, Generalized chart algorithm: an efficient procedure for cost-based abduction, in: Proceedings Meeting of the Association for Computational Linguistics, Las Cruces, NM, 1994, pp. 218-224.
10. T. Eiter, G. Gottlob, The complexity of logic-based abduction, J. ACM 42 (1) (1995) 3-42.
11. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, New York, 1979.
12. J.R. Hobbs, M.E. Stickel, D.E. Appelt, P. Martin, Interpretation as abduction, Artificial Intelligence 63 (1993) 69-142.
13. M. Ishizuka, Y. Matsuo, SL method for computing a near-optimal solution using linear and non-linear programming in cost-based hypothetical reasoning, in: Proceedings Pacific Rim International Conference on Artificial Intelligence, 1998, pp. 611-625.
14. S. Kato, S. Oono, H. Seki, H. Itoh, Cost-based abduction using binary decision diagrams, in: Proceedings Industrial and Engineering Applications of Artificial Intelligence, 1999, pp. 215-225.
15. S. Kato, H. Seki, H. Itoh, Cost-based Horn abduction and its optimal search, in: Proceedings Third International Conference on Automation, Robotics and Computer Vision, 1994, pp. 831-835.
16. S. Kato, H. Seki, H. Itoh, Parallel cost-based abductive reasoning for distributed memory systems, in: Proceedings Pacific Rim International Conference on Artificial Intelligence, 1996, pp. 300-311.
17. M. Koshino, T. Misawa, H. Kimura, S. Hirose, High speed optimization method on cost-based abduction using improved hill climbing algorithm, Transactions of the Institute of Electronics, Information and Communication Engineers. D-1 J86-D-1 (1) (2003) 39-43 (in Japanese)
18. M. Koshino, T. Okamine, H. Kimura, S. Hirose, Improving heuristic function of cost-based abduction system using real-time heuristic search, Transactions of the Institute of Electronics, Information and Communication Engineers. D-1 J85-D-1 (1) (2002) 61-68 (in Japanese).
19. Y. Matsuo, M. Ishizuka, Two transformations of clauses into constraints and their properties for cost-based hypothetical reasoning, in: Proceedings Pacific Rim Conference on Artificial Intelligence, 2002, pp. 118-127.
20. Y. Ohsawa, M. Ishizuka, Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions, Artificial Intelligence 91 (1997) 131-154.
21. Y. Ohsawa, M. Yachida, An extended polynomial solvability of cost-based abduction, in: Proceedings International Joint Conference on Artificial Intelligence, Nagoya, Japan, 1997, p. 79 (poster session abstracts).
22. Y. Ohsawa, M. Yachida, Understanding sequential events by cost-based cooperation of multiple abducers, J. Japan. Soc. Artificial Intelligence 12 (4) (1997) 591-599 (in Japanese).
23. Y. Ohsawa, M. Yachida, A new sufficient condition for polynomial solvability of cost-based abduction, J. Japan. Soc. Artificial Intelligence 13 (3) (1998) 415-423 (in Japanese).
24. R. Raz, S. Safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, in: Proceedings 29th ACM Symposium on Theory of Computing, 1997, pp. 475-484.
25. E. Santos Jr., On the generation of alternative explanations with implications for belief revision, in: Proceedings Seventh Conference on Uncertainty in AI, 1991, pp. 339-347.
26. E. Santos Jr., A linear constraint satisfaction approach to cost-based abduction, Artificial Intelligence 65 (1994) 1-27.
27. E. Santos Jr., E.S. Santos, Polynomial solvability of cost-based abduction, Artificial Intelligence 86 (1996) 157-170.