On the hardness of approximate reasoning

Artificial Intelligence

Volumn 82, Issue 1-2, 1996, Pages 273-302

  Roth, Dan ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; PROBABILITY; PROBLEM SOLVING;

APPROXIMATE REASONING; BAYESIAN BELIEF NETWORKS; HORN THEORY; MODEL COUNTING PROBLEMS; PROPOSITIONAL LANGUAGES;

ARTIFICIAL INTELLIGENCE;

EID: 0030120958     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(94)00092-1     Document Type: Article

References (41)

1. F. Bacchus, Representing and Reasoning with Probabilistic Knowledge: A Logical Approach to Probabilities (MIT Press, Cambridge, MA, 1990).
2. F. Bacchus, A. Grove, J.Y. Halpern, and D. Kolle, From statistics to beliefs, in: Proceedings AAAI-92, San Jose, CA (1992) 602-608.
3. M. Cadoli, Semantical and computational aspects of Horn approximations, in: Proceedings IJCAI-93, Chambery, France (1993) 39-44.
4. R. Carnap, Logical Foundations of Probability (University of Chicago Press, Chicago, IL, 1950).
5. G.F. Cooper, The computational complexity of probabilistic inference using Bayesian belief networks, Artif. Intell. 42 (1990) 393-405.
6. P. Dagum and M. Luby, Approximating probabilistic inference in Bayesian belief networks is NP-hard, Artif. Intell. 60 (1993) 141-153.
7. R. Dechter, Constraint networks, in: G.S. Shapiro, ed., Encyclopedia of Artificial Intelligence (Wiley, New York, 1992).
8. R. Dechter and J. Pearl, Network-based heuristics for constraint-satisfaction problems, Artif. Intell. 34 (1988) 1-38.
9. R. Dechter and J. Pearl, Structure identification in relational data, Artif. Intell. 58 (1992) 237-270.
10. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
11. R. Greiner and D. Schuurmans, Learning useful Horn approximations, in: Proceedings International Conference on the Principles of Knowledge Representation and Reasoning, Cambridge, MA (1992) 383-392.
12. A. Grove, J.Y. Halpern and D. Koller, Asymptotic conditional probabilities for first-order logic, in: Proceedings 24th ACM Symposium of the Theory of Computing (1992) 294-305.
13. S. Holtzman, Intelligent Decision Systems (Addison-Wesley, Reading, MA, 1989).
14. M.R. Jerrum, L.G. Valiant and V.V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoret. Comput. Sci. 43 (1986) 169-188.
15. R. Karp and M. Luby, Monte-Carlo algorithms for enumeration and reliability problems, in: Proceedings 24th IEEE Symposium of Foundations of Computer Science (1983) 56-64.
16. H. Kautz, M. Kearns and B. Selman, Horn approximations of empirical data, Artif. Intell. 74 (1995) 129-146.
17. H. Kautz and B. Selman, A general framework for knowledge compilation, in: Proceedings International Workshop on Processing Declarative Knowledge, Kaiserslautern, Germany (1991).
18. H. Kautz and B. Selman, Forming concepts for fast inference, in: Proceedings AAAI-92, San Jose, CA (1992) 786-793.
19. H. Kautz and B. Selman, An empirical evaluation of knowledge compilation by theory approximation, in: Proceedings AAAI-94, Seattle, WA (1994) 155-161.
20. R. Khardon and D. Roth, Learning to reason, in: Proceedings AAAI-94, Seattle, WA (1994) 682-687; also: Technical Report TR-02-94, Aiken Computation Lab., Harvard University, Cambridge, MA (1994).
21. R. Khardon and D. Roth, Learning to reason, in: Proceedings AAAI-94, Seattle, WA (1994) 682-687; also: Technical Report TR-02-94, Aiken Computation Lab., Harvard University, Cambridge, MA (1994).
22. R. Khardon and D. Roth, Reasoning with models, in: Proceedings of the National Conference on Artificial Intelligence (1994) 1148-1153. Submitted for publication. Full version: Technical Report TR-01-94, Aiken Computation Lab., Harvard University (1994).
23. R. Khardon and D. Roth, Reasoning with models, in: Proceedings of the National Conference on Artificial Intelligence (1994) 1148-1153. Submitted for publication. Full version: Technical Report TR-01-94, Aiken Computation Lab., Harvard University (1994).
24. H. Levesque, Making believers out of computers, Artif. Intell. 30 (1986) 81-108.
25. U. Montanari, Networks of constraint: fundamental properties and applications to picture processing, Inf. Sci. 7 (1974) 95-132.
26. N.J. Nilsson, Probabilistic logic, Artif. Intell. 28 (1986) 71-87.
27. P. Orponen, Dempster's rule of combination is #P-complete, Artif. Intell. 44 (1990) 245-253.
28. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (Morgan Kaufmann, San Mateo, CA, 1988).
29. J. Pearl, Reasoning with belief functions: an analysis of compatibility, Int. J. Approximate Reasoning 4 (1990) 343-389.
30. D. Poole, Average-case analysis of a search algorithm for estimating prior and posterior probabilities in Bayesian networks with extreme probabilities, in: Proceedings IJCAI-93, Chambery, France (1993) 607-612.
31. J.S. Provan and M.O. Ball, The complexity of counting cuts and of computing the probability that a graph is connected, SIAM J. Comput. 12 (4) (1983) 777-788.
32. M.G. Provan, A logical-based analysis of Dempster-Shafer theory, Int. J. Approximate Reasoning 4 (1990) 451-498.
33. M.G. Provan, The validity of Dempster-Shafer belief functions, Int. J. Approximate Reasoning 6 (1992) 389-399.
34. B. Selman and H. Kautz, Knowledge compilation using Horn approximations, in: Proceedings AAAI-91, Anaheim, CA (1991) 904-909.
35. G. Shafer, Perspectives of the theory and practice of belief functions, Int. J. Approximate Reasoning 4 (1990) 323-362.
36. A. Sinclair, Randomized algorithms for counting and generating combinatorial structures, Ph.D. Thesis, Department of Computer Science, University of Edinburgh (1988).
37. L. Stockmeyer, On approximation algorithms for #P, SIAM J. Comput. 14 (1985) 849-861.
38. S. Toda, On the computational power of PP and ⊕P, in: Proceedings 30th IEEE Symposium of Foundations of Computer Science (1989) 514-519.
39. L.G. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979) 189-201.
40. L.G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. 8 (1979) 410-421.
41. L.G. Valiant, A theory of the learnable, Commun. ACM 27 (11) (1984) 1134-1142.