Algorithms for parsimonious complete sets in directed graphs

Information Processing Letters

Volumn 59, Issue 6, 1996, Pages 335-339

  Melkman, Avraham A ^a   Shimony, Solomon E ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Abduction; Algorithms; Complete sets; Parsimonious; Proof graphs

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING; SET THEORY;

ACYCLIC GRAPHS; DIRECTED GRAPHS; PARSIMONIOUS COMPLETE SETS;

ALGORITHMS;

EID: 0041538243     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00123-8     Document Type: Article

References (13)

1. D. Allemang, M.C. Tanner, T. Bylander and J.R. Josephson, Computational complexity of hypothesis assembly, in: Proc. Internat. Joint Conf. on Artificial Intelligence (1987) 1112-1117.
2. T. Bylander, D. Allemang, M.C. Tanner and J.R. Josephson, The computational complexity of abduction, Artificial Intelligence 49 (1991) 25-60.
3. E. Charniak and S.E. Shimony, Cost-based abduction and MAP explanation, Artificial Intelligence 66 (1994) 345-374.
4. W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic Programming 3 (1984) 267-284.
5. J.R. Hobbs, M. Stickel, P. Martin and D. Edwards, Interpretation as abduction, in: Proc. 26th Conf. of the ACL (1988).
6. A. Melkman and S.E. Shimony, Minimal complete sets in directed graphs: Algorithms and hard problems. Tech. Rept. FC-94-13, Mathematics and Computer Science Dept., Ben-Gurion University, 1994.
7. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (Morgan Kaufmann, San Mateo, CA, 1988).
8. Y. Peng and J.A. Reggia, A probabilistic causal model for diagnostic problem solving (Parts 1 and 2), IEEE Trans. Systems Man Cybernetics 17 (2) (1987) 146-162 and 395-406.
9. D. Poole, The use of conflicts in searching Bayesian networks, in: Proc. 9th Conf. on Uncertainty in AI (1993).
10. C. Rojas-Guzman and M.A. Kramer, GALGO: A Genetic ALGOrithm decision support tool for complex uncertain systems modeled with Bayesian belief networks, in: Proc. 9th Conf. on Uncertainty in AI (Morgan Kaufmann, San Mateo, CA, 1993).
11. E. Santos Jr and S.E. Shimony, An empirical study on deterministic approximation of marginal probabilities in Bayes nets, Manuscript, Mathematics and Computer Science Dept., Ben-Gurion University, 1994.
12. B. Selman and H.J. Levesque, Abductive and default reasoning: A computational core, in: Proc. 8th Nat. Conf. on Artificial Intelligence (1990) 343-348.
13. S.E. Shimony, The role of relevance in explanation I: Irrelevance as statistical independence, Internat. J. Approximate Reasoning 8 (4) (1993) 281-324.